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

DOI10.1007/978-3-030-98479-3_11zbMath1530.03073MaRDI QIDQ6487229

Tinko Tinchev, Philippe Balbiani

Publication date: 11 August 2022

Mathematics Subject Classification ID

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

Cites Work

• Certain logical reduction and decision problems
• The polynomial-time hierarchy
• Tools and techniques in modal logic
• Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames
• Elementary canonical formulae: extending Sahlqvist's theorem
• Undecidable problems for modal definability: Table 1.
• Definability Over the Class of all Partitions
• An undecidable problem in correspondence theory
• First-order definability in modal logic
• Definability in the class of all -frames – computability and complexity
• Modal correspondence theory in the class of all Euclidean frames
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
• Some theorems on definability and decidability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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