Complexity of some problems in positive and related calculi

DOI10.1016/S0304-3975(02)00450-4zbMath1020.03005OpenAlexW2076738152MaRDI QIDQ1401362

Larisa L. Maksimova

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00450-4

zbMATH Keywords

interpolationcomplexityprojective Beth propertypositive logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Interpolation, preservation, definability (03C40) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items

LC and Its Pretabular Relatives ⋮ The tabularity problem over the minimal logic

Cites Work

• A guide to completeness and complexity for modal logics of knowledge and belief
• Propositional dynamic logic of regular programs
• Intuitionistic propositional logic is polynomial-space complete
• Intuitionistic logic and implicit definability
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item