Pages that link to "Item:Q409328"
From MaRDI portal
The following pages link to Algorithmic correspondence and canonicity for distributive modal logic (Q409328):
Displayed 33 items.
- Algebraic semantics and model completeness for intuitionistic public announcement logic (Q393906) (← links)
- Algebraic proof theory for substructural logics: cut-elimination and completions (Q409322) (← links)
- Algorithmic correspondence and canonicity for distributive modal logic (Q409328) (← links)
- Algorithmic correspondence for intuitionistic modal mu-calculus (Q483295) (← links)
- Algebraic proof theory: hypersequents and hypercompletions (Q730091) (← links)
- The bounded proof property via step algebras and step frames (Q741087) (← links)
- Canonical extensions and Kripke-Galois semantics for non-distributive logics (Q1632052) (← links)
- Order-dual relational semantics for non-distributive propositional logics: a general framework (Q1702978) (← links)
- Canonical extensions and ultraproducts of polarities (Q1800462) (← links)
- Distributive laws in residuated binars (Q2007988) (← links)
- Hyper-MacNeille completions of Heyting algebras (Q2062218) (← links)
- Hypersequent and display calculi -- a unified perspective (Q2259013) (← links)
- Algorithmic correspondence and canonicity for non-distributive logics (Q2273010) (← links)
- Proper multi-type display calculi for rough algebras (Q2333670) (← links)
- Algebraic modal correspondence: Sahlqvist and beyond (Q2401020) (← links)
- Disentangling structural connectives or life without display property (Q2421521) (← links)
- Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL} (Q2695349) (← links)
- Categories: How I Learned to Stop Worrying and Love Two Sorts (Q2820692) (← links)
- Taming Paraconsistent (and Other) Logics (Q2946751) (← links)
- Probabilistic Epistemic Updates on Algebras (Q3457689) (← links)
- THE LOGIC OF RESOURCES AND CAPABILITIES (Q4577999) (← links)
- (Q4625704) (← links)
- A SAHLQVIST THEOREM FOR SUBSTRUCTURAL LOGIC (Q4928772) (← links)
- Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$ (Q5027233) (← links)
- Syntactic Completeness of Proper Display Calculi (Q5056369) (← links)
- (Q5119388) (← links)
- Power and Limits of Structural Display Rules (Q5277918) (← links)
- Linear Logic Properly Displayed (Q5886520) (← links)
- Correspondence theory for modal Fairtlough-Mendler semantics of intuitionistic modal logic (Q6067750) (← links)
- Correspondence theory for generalized modal algebras (Q6102993) (← links)
- Topological duality and algebraic completions (Q6120604) (← links)
- Labelled calculi for lattice-based modal logics (Q6132565) (← links)
- Subordination algebras as semantic environment of input/output logic (Q6160753) (← links)