Algebraic proof theory for LE-logics
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1361537 (Why is no real title available?)
- scientific article; zbMATH DE number 1406808 (Why is no real title available?)
- scientific article; zbMATH DE number 7243670 (Why is no real title available?)
- scientific article; zbMATH DE number 3349770 (Why is no real title available?)
- scientific article; zbMATH DE number 970628 (Why is no real title available?)
- scientific article; zbMATH DE number 7668119 (Why is no real title available?)
- A Multi-type Calculus for Inquisitive Logic
- A Sahlqvist theorem for distributive modal logic
- Algebraic aspects of cut elimination
- Algebraic characterizations of variable separation properties
- Algebraic proof theory for substructural logics: cut-elimination and completions
- Algebraization, parametrized local deduction theorem and interpolation for substructural logics over FL
- Algorithmic correspondence and canonicity for distributive modal logic
- Algorithmic correspondence and canonicity for non-distributive logics
- Amalgamation, interpolation, and implicit definability in varieties of algebras
- An algebraic approach to the disjunction property of substructural logics
- Bilattice logic properly displayed
- Boolean Algebras with Operators. Part I
- Bounded lattice expansions
- Categories: how I learned to stop worrying and love two sorts
- Cut elimination and strong separation for substructural logics: an algebraic approach
- Disjunction property and complexity of substructural logics
- Display logic
- Displaying modal logic
- Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics. I
- Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics. II
- Gaggles, Gentzen and Galois: how to display your favourite substructural logic
- In so many possible worlds
- Interpolation properties, Beth definability properties and amalgamation properties for substructural logics
- Logics for rough concept analysis
- Modelling informational entropy
- Modelling socio-political competition
- Multi-type display calculus for dynamic epistemic logic
- Multi-type display calculus for propositional dynamic logic
- Multi-type display calculus for semi De Morgan logic
- Non-distributive logics: from semantics to meaning
- Non-normal modal logics and conditional logics: semantic analysis and proof theory
- Nonassociative Lambek Calculus with Additives and Context-Free Languages
- On the finite embeddability property for residuated ordered groupoids
- Power and limits of structural display rules
- Proper multi-type display calculi for rough algebras
- Residuated frames with applications to decidability
- Residuated lattices. An algebraic glimpse at substructural logics
- Rough concepts
- Semantic analysis of orthologic
- Substructural logics on display
- Symmetries in Natural Language Syntax and Semantics: The Lambek-Grishin Calculus
- Syntactic Completeness of Proper Display Calculi
- THE LOGIC OF RESOURCES AND CAPABILITIES
- The finite embeddability property for residuated lattices, pocrims and BCK-algebras.
- Toward a Dempster-Shafer theory of concepts
- Toward an epistemic-logical theory of categorization
- Towards a semantic characterization of cut-elimination
- Unified correspondence
- Unified correspondence as a proof-theoretic tool
- Vector spaces as Kripke frames
- Which structural rules admit cut elimination? An algebraic criterion
Cited in
(4)
This page was built for publication: Algebraic proof theory for LE-logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6493417)
