scientific article; zbMATH DE number 2209455

MaRDI QIDQ5692444zbMATH OpenFDO

Authors L.A.Chagrova, Alexander Vasil'evich Chagrov

Publication date 28 September 2005

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) 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
• scientific article; zbMATH DE number 2209837
• An undecidable problem in correspondence theory
• On propositional definability
• The truth about algorithmic problems in correspondence theory

Cited in

(8)

• Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames
• On propositional definability
• The Modal Formula (†) \square \diamondsuit p \supset \square \diamondsuit \square \diamondsuit p Is Not First-Order Definable
• An undecidable problem in correspondence theory
• The algorithmic problem of finitary semantic consequence for propositional formulas. I: Context and problem formulation
• Demise of the algorithmic agenda in correspondence theory?
• scientific article; zbMATH DE number 2209837 (Why is no real title available?)
• A decision method for a set of first order classical formulas and its applications to decision problems for non-classical propositional logics

This page was built for publication:

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