Pages that link to "Item:Q1709685"
From MaRDI portal
The following pages link to The completeness problem for modal logic (Q1709685):
Displaying 14 items.
- A completeness proof for a logic with an alternative necessity operator (Q677080) (← links)
- Methods for proving completeness via logical reductions (Q685391) (← links)
- Effective completeness theorems for modal logic (Q1877094) (← links)
- Completeness and incompleteness for plausibility logic (Q1923829) (← links)
- Proof-theoretic modal PA-completeness. III: The syntactic proof (Q1970916) (← links)
- The complexity of identifying characteristic formulae (Q1987735) (← links)
- When are prime formulae characteristic? (Q2422016) (← links)
- (Q2974968) (← links)
- On the Meaning of Logical Completeness (Q3637186) (← links)
- An incomplete decidable modal logic (Q3718681) (← links)
- A new proof of completeness for a relative modal logic with composition and intersection (Q4443008) (← links)
- (Q5411427) (← links)
- Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic (Q5427258) (← links)
- (Q5884945) (← links)