Decidability of the Admissibility Problem for Inference Rules in Some S5t-Logics

DOI10.1007/S10469-005-0024-XMaRDI QIDQ3409447zbMATH OpenOpenAlexFDO

Authors Anna Vladimirovna Kosheleva

Publication date 17 November 2006

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10469-005-0024-x

zbMATH Keywords

decidabilityinference rulepolymodal logicadmissibility problem

Mathematics Subject Classification ID

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

Recommendations

• Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property
• scientific article; zbMATH DE number 4204318
• scientific article; zbMATH DE number 1080249
• Decidability of the admissibility problem in layer-finite logics
• scientific article; zbMATH DE number 2024620

Cited in

(7)

• Two decidable classes of formulas of the modal logic S5
• Semantics of admissible sets of truth values for S5. The decision procedure
• Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
• scientific article; zbMATH DE number 2024620 (Why is no real title available?)
• Multi-modal and Temporal Logics with Universal Formula--Reduction of Admissibility to Validity and Unification
• On admissible rules for the polymodal logic \(\text{S}5_n\text{C}\)
• scientific article; zbMATH DE number 1114336 (Why is no real title available?)

This page was built for publication: Decidability of the Admissibility Problem for Inference Rules in Some S5t-Logics

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