A simple propositional \(\text{S}5\) tableau system

DOI10.1016/S0168-0072(98)00034-7zbMath0972.03017OpenAlexW1984799723MaRDI QIDQ1295438

Melvin Fitting

Publication date: 9 November 2001

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

Full work available at URL: https://doi.org/10.1016/s0168-0072(98)00034-7

zbMATH Keywords

modal logictableau systemS5

Mathematics Subject Classification ID

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

Related Items (6)

A deep inference system for the modal logic S5 ⋮ Tautology Elimination, Cut Elimination, and S5 ⋮ Modal logic S5 in answer set programming with lazy creation of worlds ⋮ Realizations and LP ⋮ Modal Logic S5 Satisfiability in Answer Set Programming ⋮ Efficient SAT-based minimal model generation methods for modal logic S5

Cites Work

• Unnamed Item
• Proof methods for modal and intuitionistic logics
• Failures of the interpolation lemma in quantified modal logic
• The Computational Complexity of Provability in Systems of Modal Propositional Logic

This page was built for publication: A simple propositional \(\text{S}5\) tableau system