The Complexity of Disjunction in Intuitionistic Logic

DOI10.1007/978-3-319-27683-0_24zbMath1476.03004OpenAlexW2401823700MaRDI QIDQ5283439

No author found.

Publication date: 21 July 2017

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27683-0_24

zbMATH Keywords

complexityproof theoryintuitionistic logicdisjunction

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subsystems of classical logic (including intuitionistic logic) (03B20)

Uses Software

• DKAL

Cites Work

• Hypersequent calculi for intuitionistic logic with classical atoms
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• The complexity of primal logic with disjunction
• Logic of infons
• Primal Infon Logic: Derivability in Polynomial Time
• A dexptime-Complete Dolev-Yao Theory with Distributive Encryption
• On the security of public key protocols
• A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property
• Automatic recognition of tractability in inference relations
• Verification: Theory and Practice
• Propositional primal logic with disjunction

This page was built for publication: The Complexity of Disjunction in Intuitionistic Logic