Algebraic proof theory for LE-logics
From MaRDI portal
Publication:6493417
DOI10.1145/3632526WikidataQ130808724 ScholiaQ130808724MaRDI QIDQ6493417
Apostolos Tzimoulis, Alessandra Palmigiano, Giuseppe Greco, Fei Liang, Peter Jipsen
Publication date: 26 April 2024
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
substructural logicsfinite model propertycut-eliminationalgebraic proof theorynon-distributive logicspolarity-based semanticsnormal lattice expansionsdisplay sequent calculi
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic proof theory for substructural logics: cut-elimination and completions
- Algorithmic correspondence and canonicity for distributive modal logic
- Disjunction property and complexity of substructural logics
- Cut elimination and strong separation for substructural logics: an algebraic approach
- A Sahlqvist theorem for distributive modal logic
- Amalgamation, interpolation, and implicit definability in varieties of algebras
- Towards a semantic characterization of cut-elimination
- Residuated lattices. An algebraic glimpse at substructural logics
- Semantic analysis of orthologic
- Multi-type display calculus for semi De Morgan logic
- Algebraic aspects of cut elimination
- The finite embeddability property for residuated lattices, pocrims and BCK-algebras.
- Displaying modal logic
- Display 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
- Modelling socio-political competition
- Toward a Dempster-Shafer theory of concepts
- Algorithmic correspondence and canonicity for non-distributive logics
- Logics for rough concept analysis
- Modelling informational entropy
- Bilattice logic properly displayed
- Proper multi-type display calculi for rough algebras
- An algebraic approach to the disjunction property of substructural logics
- Algebraization, parametrized local deduction theorem and interpolation for substructural logics over FL
- In so many possible worlds
- Non-normal modal logics and conditional logics: semantic analysis and proof theory
- Categories: How I Learned to Stop Worrying and Love Two Sorts
- A Multi-type Calculus for Inquisitive Logic
- Multi-type display calculus for dynamic epistemic logic
- Multi-type display calculus for propositional dynamic logic
- Interpolation Properties, Beth Definability Properties and Amalgamation Properties for Substructural Logics
- Symmetries in Natural Language Syntax and Semantics: The Lambek-Grishin Calculus
- Nonassociative Lambek Calculus with Additives and Context-Free Languages
- Gaggles, Gentzen and Galois: how to display your favourite substructural logic
- Substructural logics on display
- THE LOGIC OF RESOURCES AND CAPABILITIES
- Unified correspondence as a proof-theoretic tool
- Residuated frames with applications to decidability
- Non-distributive logics: from semantics to meaning
- Syntactic Completeness of Proper Display Calculi
- Unified Correspondence
- Power and Limits of Structural Display Rules
- Which structural rules admit cut elimination? An algebraic criterion
- On the finite embeddability property for residuated ordered groupoids
- Boolean Algebras with Operators. Part I
- Bounded lattice expansions
- Rough concepts
This page was built for publication: Algebraic proof theory for LE-logics
