Two decidable classes of formulas of the modal logic S5

DOI10.1007/BF02465136MaRDI QIDQ5930988zbMATH OpenOpenAlexFDO

Authors Stanislova Norgėla

Publication date 24 July 2001

Published in Lithuanian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02465136

zbMATH Keywords

decidabilitydecidable classes of formulasderivabilityMaslov's inverse methodquantifier modal logic S5

Mathematics Subject Classification ID

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

Recommendations

• Decidability of some classes of modal logic
• Decidability of the class E by Maslov's inverse method
• Maslov's inverse method and decidable classes
• scientific article; zbMATH DE number 3902618
• Decidability of the Admissibility Problem for Inference Rules in Some S5t-Logics

Cites work

• scientific article; zbMATH DE number 3208243 (Why is no real title available?)
• scientific article; zbMATH DE number 3246242 (Why is no real title available?)
• The inverse method for establishing deducibility for logical calculi

Cited in

(3)

• Modal trees: Correction to a decision procedure for S5 (and T)
• Decidability of the class E by Maslov's inverse method
• Maslov's inverse method and decidable classes

This page was built for publication: Two decidable classes of formulas of the modal logic S5

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