Definability Over the Class of all Partitions

DOI10.1093/LOGCOM/EXL024MaRDI QIDQ3431961zbMATH OpenOpenAlexFDO

Authors Philippe Balbiani, Tinko Tinchev

Publication date 13 April 2007

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

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

zbMATH Keywords

complexitydecidabilityfirst-order definabilitymodal definability

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
• Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames
• Definability in the class of all KD45-frames -- computability and complexity
• Modal correspondence theory in the class of all Euclidean frames
• Towards a generalization of modal definability

Cited in

(5)

• Second-order logic on equivalence relations
• Stepping up lemmas in definable partitions
• Definability in the class of all KD45-frames -- computability and complexity
• Partitioning Kripke frames of finite height
• Decidable and Undecidable Problems for First-Order Definability and Modal Definability

This page was built for publication: Definability Over the Class of all Partitions

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