Complexity of subclasses of the intuitionistic propositional calculus

DOI10.1007/BF01995108zbMath0790.03041OpenAlexW1978593318MaRDI QIDQ688732

Grigori Mints

Publication date: 22 June 1994

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01995108

zbMATH Keywords

complexity of the decision problem for subclasses of intuitionistic propositional calculusupper bounds for decision procedures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (3)

Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis ⋮ Intuitionistic Decision Procedures Since Gentzen ⋮ TRANSITIVE PRIMAL INFON LOGIC

Cites Work

• Justification of the structural synthesis of programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of subclasses of the intuitionistic propositional calculus