Pages that link to "Item:Q2772884"
From MaRDI portal
The following pages link to Sahlqvist formulas in hybrid polyadic modal logics (Q2772884):
Displaying 18 items.
- Algorithmic correspondence and canonicity for distributive modal logic (Q409328) (← links)
- On the modal logic of subset and superset: tense logic over Medvedev frames (Q519848) (← links)
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (Q631077) (← links)
- The bounded proof property via step algebras and step frames (Q741087) (← links)
- Notes on logics of metric spaces (Q878157) (← links)
- A Sahlqvist theorem for relevant modal logics (Q1810815) (← links)
- Many-sorted hybrid modal languages (Q2035658) (← links)
- Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations (Q2304538) (← links)
- Hybrid formulas and elementarily generated modal logics (Q2372681) (← links)
- Elementary canonical formulae: extending Sahlqvist's theorem (Q2498906) (← links)
- Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL} (Q2695349) (← links)
- On Sahlqvist theory for hybrid logics (Q2983399) (← links)
- Simulating polyadic modal logics by monadic ones (Q3160548) (← links)
- Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA (Q4982120) (← links)
- (Q4994195) (← links)
- Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$ (Q5027233) (← links)
- (Q5419870) (← links)
- Hybrid logics with Sahlqvist axioms (Q5697717) (← links)
