Pages that link to "Item:Q2273010"

The following pages link to Algorithmic correspondence and canonicity for non-distributive logics (Q2273010):

Displaying 19 items.

• Semi De Morgan logic properly displayed (Q2021557) (← links)
• Definable operators on stable set lattices (Q2027212) (← links)
• Modelling socio-political competition (Q2035344) (← links)
• Residuation algebras with functional duals (Q2325603) (← links)
• Non-normal modal logics and conditional logics: semantic analysis and proof theory (Q2672662) (← links)
• A non-distributive logic for semiconcepts and its modal extension with semantics based on Kripke contexts (Q2677854) (← links)
• Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL} (Q2695349) (← links)
• Reasoning with Incomplete Information in Generalized Galois Logics Without Distribution: The Case of Negation and Modal Operators (Q3305430) (← links)
• (Q3384065) (← links)
• Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$ (Q5027233) (← links)
• Syntactic Completeness of Proper Display Calculi (Q5056369) (← links)
• (Q5119388) (← links)
• Modal translation of substructural logics (Q5217248) (← links)
• Linear Logic Properly Displayed (Q5886520) (← links)
• Rough concepts (Q6081075) (← links)
• Positive modal logic beyond distributivity (Q6179826) (← links)
• Semantic Analysis of Subexponential Modalities in Distributive Non-commutative Linear Logic (Q6196503) (← links)
• Non-distributive description logic (Q6541145) (← links)
• Polynomial-time checking of generalized Sahlqvist syntactic shape (Q6639733) (← links)