Undecidability of admissibility in the product of two \textbf{Alt} logics

DOI10.1093/JIGPAL/JZAD021MaRDI QIDQ7007790zbMATH OpenFDO

Authors Philippe Balbiani, Çiğdem Gencer

Publication date 25 March 2025

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/JIGPAL/JZAD021

zbMATH Keywords

admissibility of inference rulescomputabilitydomino-tiling problemsproducts of two modal logics

Mathematics Subject Classification ID

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

Cites work

• A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
• A Resolution/Tableaux Algorithm for Projective Approximations in IPC
• About the unification type of modal logics between \(\mathbf{KB}\) and \(\mathbf{KTB} \)
• About the unification types of modal logics
• Admissibility of logical inference rules
• Best solving modal equations
• Complexity of admissible rules
• Decidable modal logic with undecidable admissibility problem
• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• scientific article; zbMATH DE number 1471983 (Why is no real title available?)
• Many-dimensional modal logics: theory and applications
• Modal logic
• On the admissible rules of intuitionistic propositional logic
• Products of modal logics, part 1
• Remarks about the unification type of several non-symmetric non-transitive modal logics
• The price of universality
• Tools and techniques in modal logic
• Undecidability of the unification and admissibility problems for modal and description logics
• Unifiability in extensions of K4
• Unification in modal and description logics
• Unification in modal logic \(\mathrm{Alt}_1\)
• Unification types in logic

This page was built for publication: Undecidability of admissibility in the product of two \textbf{Alt} logics

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