COMPLEXITY OF SUBCLASSES OF THE INTUITIONISTIC PROPOSITIONAL CALCULUS

被引：3

作者：

MINTS, G ^{[1
]}

机构：

[1] ESTONIAN ACAD SCI,INST CYBERNET,TALLINN 200108,ESTONIA,USSR

来源：

BIT | 1992年 / 32卷 / 01期

关键词：

F.1.3; F.4.1;

D O I：

10.1007/BF01995108

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We investigate the complexity of the decision problem for subclasses of the intuitionistic propositonal calculus and present upper bounds for decision procedures locating these subclasses into lower complexity classes like co-NP or polynomial time.

引用

页码：64 / 69

页数：6

共 50 条

[11] SEPARATION THEOREM FOR FRAGMENTS OF INTUITIONISTIC PROPOSITIONAL CALCULUS
ROUSSEAU, G
ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1970, 16 (05): : 469 - &
[12] On the complexity of propositional quantification in intuitionistic logic
Kremer, P
JOURNAL OF SYMBOLIC LOGIC, 1997, 62 (02) : 529 - 544
[13] THE COMPUTATIONAL COMPLEXITY OF PROPOSITIONAL CIRQUENT CALCULUS
Bauer, Matthew S.
LOGICAL METHODS IN COMPUTER SCIENCE, 2015, 11 (01)
[14] COMPLEXITY OF CONCLUSIONS IN CLASSICAL PROPOSITIONAL CALCULUS
POPOV, SV
DOKLADY AKADEMII NAUK SSSR, 1976, 228 (05): : 1041 - 1044
[15] On the number of new logical constants in the intuitionistic propositional calculus
Yashin, AD
VESTNIK MOSKOVSKOGO UNIVERSITETA SERIYA 1 MATEMATIKA MEKHANIKA, 1997, (01): : 7 - 10
[16] Fixed-point Elimination in the Intuitionistic Propositional Calculus
Ghilardi, Silvio
Gouveia, Maria Joao
Santocanale, Luigi
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2020, 21 (01)
[17] Fixed-Point Elimination in the Intuitionistic Propositional Calculus
Ghilardi, Silvio
Gouveia, Maria Joao
Santocanale, Luigi
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2016), 2016, 9634 : 126 - 141
[18] CRITERIA FOR ADMISSIBILITY OF RULES OF INFERENCE WITH PARAMETERS IN THE INTUITIONISTIC PROPOSITIONAL CALCULUS
RYBAKOV, VV
MATHEMATICS OF THE USSR-IZVESTIYA, 1990, 54 (06): : 693 - 703
[19] SUB-LOGICAL PROPERTIES OF CLASSICAL AND INTUITIONISTIC PROPOSITIONAL CALCULUS
SEMENENK.MI
ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1970, 16 (03): : 201 - &
[20] A COMPARISON BETWEEN LAMBEK SYNTACTIC CALCULUS AND INTUITIONISTIC LINEAR PROPOSITIONAL LOGIC
ABRUSCI, VM
ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1990, 36 (01): : 11 - 15

← 1 2 3 4 5 →