Corrigendum to: ``A new method to obtain termination in backward proof search for modal logic S4

DOI10.1093/LOGCOM/EXP051MaRDI QIDQ3406695zbMATH OpenOpenAlexFDO

Authors Aida Pliuškevičienė, R. Pliuškevičius

Publication date 19 February 2010

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exp051

Mathematics Subject Classification ID

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

Recommendations

• A New Method to Obtain Termination in Backward Proof Search For Modal Logic S4
• Terminating sequent calculi for proving and refuting formulas in S4
• Correcting the tableau procedure for S4
• Loop-free calculus for modal logic S4. II
• scientific article; zbMATH DE number 970625

Cited in

(6)

• A new variant of the Gödel-Malcev theorem for the classical propositional calculus and correction to my paper: ``The connective of necessity of modal logic \(S_ 5\) is metalogical
• Correction to: ``Local is best: efficient reductions to modal logic \textsf{K}
• A New Method to Obtain Termination in Backward Proof Search For Modal Logic S4
• Loop-free calculus for modal logic S4. I
• Errata and addenda to: ``Finite non-deterministic semantics for some modal systems
• Correcting the tableau procedure for S4

This page was built for publication: Corrigendum to: ``A new method to obtain termination in backward proof search for modal logic S4

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