Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames

DOI10.1007/BF01057806zbMath0844.03007MaRDI QIDQ1908859

L.A.Chagrova, Alexander Chagrov

Publication date: 27 August 1996

Published in: Studia Logica (Search for Journal in Brave)

zbMATH Keywords

undecidabilityfirst-order definabilityfinite framessemantical consequence

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Related Items (1)

Definability in the class of all -frames – computability and complexity

Cites Work

• Unnamed Item
• Undecidable properties of extensions of the logic of provability
• Undecidable properties of extensions of provability logic. II
• Notes on modal definability
• An application of games to the completeness problem for formalized theories
• An undecidable problem in correspondence theory
• First-order definability in modal logic
• A finitely axiomatizable undecidable extension of K
• The undecidability of the disjunction property of propositional logics and other related problems

This page was built for publication: Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames