Undecidable problems for modal definability

DOI10.1093/LOGCOM/EXV094MaRDI QIDQ2983400zbMATH OpenOpenAlexFDO

Authors Philippe Balbiani, Tinko Tinchev

Publication date 17 May 2017

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

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

zbMATH Keywords

first-order logicmodal logicmodal definabilitycomputabilityChagrova's theorem

Mathematics Subject Classification ID

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

Recommendations

• Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames
• The truth about algorithmic problems in correspondence theory
• Definability in the class of all KD45-frames -- computability and complexity
• Demise of the algorithmic agenda in correspondence theory?
• A Universally Defined Undecidable Unimodal Logic

Cited in

(9)

• Modal Undefinability in Some Alternative Leibnizian Frames
• Modal correspondence theory in the class of all Euclidean frames
• scientific article; zbMATH DE number 3861119 (Why is no real title available?)
• A Universally Defined Undecidable Unimodal Logic
• The truth about algorithmic problems in correspondence theory
• Definability in the class of all KD45-frames -- computability and complexity
• Modal definability: two commuting equivalence relations
• Decidable and Undecidable Problems for First-Order Definability and Modal Definability
• Definability Over the Class of all Partitions

This page was built for publication: Undecidable problems for modal definability

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