Pages that link to "Item:Q3984404"

The following pages link to An undecidable problem in correspondence theory (Q3984404):

Displaying 19 items.

• A dichotomy for some elementarily generated modal logics (Q497429) (← links)
• Impossibility results for choice correspondences (Q1277456) (← links)
• A codicity undecidable problem in the plane. (Q1401375) (← links)
• Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames (Q1908859) (← links)
• Complexity of syntactical tree fragments of independence-friendly logic (Q2003922) (← links)
• Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi (Q2259003) (← links)
• Negation and partial axiomatizations of dependence and independence logic revisited (Q2273016) (← links)
• Undecidability of infinite Post correspondence problem for instances of size 8 (Q2905329) (← links)
• Undecidability of infinite post correspondence problem for instances of Size 9 (Q3423136) (← links)
• (Q3772198) (← links)
• The undecidability of the disjunction property of propositional logics and other related problems (Q4276033) (← links)
• Definability in the class of all -frames – computability and complexity (Q4586217) (← links)
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE (Q4882918) (← links)
• Canonical formulas for K4. Part II: Cofinal subframe logics (Q4894720) (← links)
• (Q4994195) (← links)
• Undecidability of the Spectral Gap (Q5084676) (← links)
• Canonical varieties with no canonical axiomatisation (Q5461397) (← links)
• Decidable and Undecidable Problems for First-Order Definability and Modal Definability (Q6487229) (← links)
• Parametrized modal logic. II: The unidimensional case (Q6550519) (← links)