Pages that link to "Item:Q3984404"
From MaRDI portal
The following pages link to An undecidable problem in correspondence theory (Q3984404):
Displaying 11 items.
- A dichotomy for some elementarily generated modal logics (Q497429) (← 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)
- 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)
- Canonical formulas for K4. Part II: Cofinal subframe logics (Q4894720) (← links)
- (Q4994195) (← links)
- Canonical varieties with no canonical axiomatisation (Q5461397) (← links)
- Parametrized modal logic. II: The unidimensional case (Q6550519) (← links)
