Decidable and Undecidable Problems for First-Order Definability and Modal Definability

DOI10.1007/978-3-030-98479-3_11MaRDI QIDQ6487229zbMATH OpenFDO

Authors Philippe Balbiani, Tinko Tinchev

Publication date 11 August 2022

Full work available at URL https://doi.org/10.1007/978-3-030-98479-3_11

Mathematics Subject Classification ID

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

Recommendations

• Undecidable problems for modal definability
• scientific article; zbMATH DE number 4189692
• Decidability of some classes of modal logic
• Decidable fragments of first-order modal logics
• Undecidability of First-Order Intuitionistic and Modal Logics with Two variables
• Decidable first-order modal logics with counting quantifiers
• Decidable modal logic with undecidable admissibility problem
• Decidability of definability
• scientific article; zbMATH DE number 1500655
• Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames

Cites work

• Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames
• An undecidable problem in correspondence theory
• Certain logical reduction and decision problems
• Definability in the class of all KD45-frames -- computability and complexity
• Definability Over the Class of all Partitions
• Demise of the algorithmic agenda in correspondence theory?
• Elementary canonical formulae: extending Sahlqvist's theorem
• First-order definability in modal logic
• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• scientific article; zbMATH DE number 4041866 (Why is no real title available?)
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 3499717 (Why is no real title available?)
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 4189692 (Why is no real title available?)
• Modal correspondence theory in the class of all Euclidean frames
• Modal logic
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
• Some theorems on definability and decidability
• The polynomial-time hierarchy
• The truth about algorithmic problems in correspondence theory
• Tools and techniques in modal logic
• Undecidable problems for modal definability

Cited in

(1)

• Modal definability: two commuting equivalence relations

This page was built for publication: Decidable and Undecidable Problems for First-Order Definability and Modal Definability

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