Undecidability of the transitive graded modal logic with converse

DOI10.1093/LOGCOM/EXW026zbMATH Open1444.03079OpenAlexW2508927473MaRDI QIDQ3133169FDOQ3133169

Authors: Evgeni E. Zolin 

Publication date: 13 February 2018

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

Full work available at URL: https://semanticscholar.org/paper/c3117f2c2f0cd554a8c7d0fc84b267c6a5fb0bda

Recommendations

• Elementary modal logics over transitive structures
• scientific article; zbMATH DE number 487145
• scientific article; zbMATH DE number 589751
• A Universally Defined Undecidable Unimodal Logic
• On the undecidability of logics with converse, nominals, recursion and counting

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25)

Cited In (6)

• Description logic on image graphs
• Existential definability of modal frame classes
• On transitive modal many-valued logics
• Completing the Picture: Complexity of Graded Modal Logics with Converse
• On the complexity of graded modal logics with converse
• On the undecidability of logics with converse, nominals, recursion and counting

This page was built for publication: Undecidability of the transitive graded modal logic with converse

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