Modal trees: Correction to a decision procedure for S5 (and T)

DOI10.1305/NDJFL/1093637558zbMATH Open0638.03015OpenAlexW1997270303MaRDI QIDQ1099159

J.-C. Léon, Alfredo Burrieza

Publication date: 1987

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093637558

zbMATH Keywords

extensions of the tree method

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)

Recommendations

• A loop-free decision procedure for modal propositional logics K4, S4 and S5 👍 👎
• The Method of Tree-Hypersequents for Modal Propositional Logic 👍 👎
• Tree-sequent calculi and decision procedures for intuitionistic modal logics 👍 👎
• Modal Tree‐Sequents 👍 👎
• Modal Logic S5 Satisfiability in Answer Set Programming 👍 👎
• Two decidable classes of formulas of the modal logic S5 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Modal trees: Correction to a decision procedure for S5 (and T)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099159)