Solving the \$100 modal logic challenge

DOI10.1016/j.jal.2007.07.007zbMath1161.03302OpenAlexW2064273963MaRDI QIDQ1006738

Weina Shen, Pavel Pudlák, Geoff Sutcliffe, Florian Rabe

Publication date: 25 March 2009

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2007.07.007

zbMATH Keywords

modal logicautomated theorem proving\$100 challengeaxiomatizations of propositional modal logicssubset relationship

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35)

Related Items

Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)

Uses Software

• MiniSat
• LWB
• VAMPIRE
• TPTP
• MSPASS

Cites Work

• An almost general splitting theorem for modal logic
• The TPTP problem library. CNF release v1. 2. 1
• Admissibility of logical inference rules
• SAT-based decision procedures for classical modal logics
• Short single axioms for Boolean algebra
• First-order modal logic
• Functional translation and second-order frame properties of modal logics
• Relations between propositional normal modal logics: an overview
• An incompleteness theorem in modal logic
• Algebraic semantics for modal logics I
• Relational and Kleene-Algebraic Methods in Computer Science
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
• Boolean Algebras with Operators. Part I
• Boolean Algebras with Operators
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item