The complexity of primal logic with disjunction

DOI10.1016/j.ipl.2015.01.003zbMath1327.68120OpenAlexW1965384668MaRDI QIDQ2339598

Martin Mundhenk, Raphaela Palenta, Marco Magirius

Publication date: 2 April 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.01.003

zbMATH Keywords

computational complexitymodel checkingKripke semanticssatisfiabilityprimal logic with disjunctionquasi-Boolean semantics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (1)

The Complexity of Disjunction in Intuitionistic Logic

Uses Software

• DKAL

Cites Work

• Unnamed Item
• Unnamed Item
• An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic
• Intuitionistic implication makes model checking hard
• Logic of infons
• Propositional primal logic with disjunction

This page was built for publication: The complexity of primal logic with disjunction