Separability of normalizable superintuitionistic propositional logics

被引：0

作者：

V. I. Khomich

机构：

[1] Russian Academy of Sciences,Institute of Computational Mathematics

来源：

Mathematical Notes | 1998年 / 64卷

关键词：

intuitionistic logics; separability of logics; intermediate propositional logics; normalizable logics;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

The problem of separability of superintuitionistic propositional logics that are extensions of the intuitionistic propositional logic is studied. A criterion of separability of normal superintuitionistic propositional logics, as well as results concerning the completeness of their subcalculi is obtained. This criterion makes it possible to determine whether a normalizable superintuitionistic propositional logic is separable. By means of these results, the mistakes discovered by the author in the proofs of certain statements by McKay and Hosoi are corrected.

引用

页码：524 / 531

页数：7

共 50 条

[1] Separability of normalizable superintuitionistic propositional logics
Khomich, VI
[J]. MATHEMATICAL NOTES, 1998, 64 (3-4) : 524 - 531
[2] ON THE PROBLEM OF SEPARABILITY FOR SUPERINTUITIONISTIC PROPOSITIONAL LOGICS
KHOMICH, VI
[J]. DOKLADY AKADEMII NAUK SSSR, 1980, 254 (04): : 820 - 823
[3] The simple substitution property for superintuitionistic propositional logics and its relation to the separability property
Khomich, VI
[J]. IZVESTIYA MATHEMATICS, 2003, 67 (02) : 377 - 404
[4] On the property of simple substitution for superintuitionistic propositional logics
Khomich, VI
[J]. DOKLADY MATHEMATICS, 2000, 62 (02) : 213 - 215
[5] On the simple substitution property for superintuitionistic and modal propositional logics
Khomich, V. I.
[J]. DOKLADY MATHEMATICS, 2008, 78 (03) : 923 - 924
[6] ON SUPERINTUITIONISTIC PROPOSITIONAL LOGICS CONNECTED WITH PARTIALLY ORDERED SETS
KHOMICH, VI
[J]. MATHEMATICS OF THE USSR-IZVESTIYA, 1992, 38 (02): : 375 - 397
[7] On the simple substitution property for superintuitionistic and modal propositional logics
V. I. Khomich
[J]. Doklady Mathematics, 2008, 78 : 923 - 924
[8] Complexity function and complexity of validity of modal and superintuitionistic propositional logics
Rybakov, Mikhail
Shkatov, Dmitry
[J]. JOURNAL OF LOGIC AND COMPUTATION, 2023, 33 (07) : 1566 - 1595
[9] On Systems of Slices in the Structure of Superintuitionistic Predicate (or Propositional) Logics. I
Skvortsov, D.
[J]. PATTERN RECOGNITION AND IMAGE ANALYSIS, 2023, 33 (03) : 511 - 516
[10] On Systems of Slices in the Structure of Superintuitionistic Predicate (or Propositional) Logics. I
D. Skvortsov
[J]. Pattern Recognition and Image Analysis, 2023, 33 : 511 - 516

← 1 2 3 4 5 →