Algebraic proof theory for substructural logics: cut-elimination and completions
From MaRDI portal
(Redirected from Publication:409322)
Recommendations
Cites work
- scientific article; zbMATH DE number 5295854 (Why is no real title available?)
- scientific article; zbMATH DE number 1215493 (Why is no real title available?)
- scientific article; zbMATH DE number 1497485 (Why is no real title available?)
- scientific article; zbMATH DE number 2138212 (Why is no real title available?)
- scientific article; zbMATH DE number 1361537 (Why is no real title available?)
- scientific article; zbMATH DE number 1907195 (Why is no real title available?)
- scientific article; zbMATH DE number 1406811 (Why is no real title available?)
- scientific article; zbMATH DE number 2208113 (Why is no real title available?)
- A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
- Adding involution to residuated structures
- Algebraic aspects of cut elimination
- Algebraization, parametrized local deduction theorem and interpolation for substructural logics over FL
- Algorithmic correspondence and canonicity for distributive modal logic
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Boolean Algebras with Operators
- Boolean Algebras with Operators. Part I
- Canonicity results of substructural and lattice-based logics
- Correspondences between gentzen and hilbert systems
- Cut elimination and strong separation for substructural logics: an algebraic approach
- Ein System des Verknüpfenden Schliessens
- Expanding the Realm of Systematic Proof Theory
- Extending intuitionistic linear logic with knotted structural rules
- Hypersequents, logical consequence and intermediate logics for concurrency
- Kripke Semantics for Basic Sequent Systems
- Logic Programming with Focusing Proofs in Linear Logic
- MacNeille completions and canonical extensions
- MacNeille completions of FL-algebras
- MacNeille completions of lattice expansions
- Minimal varieties of residuated lattices
- On the completion by cuts of distributive lattices
- Partially Ordered Sets
- Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic
- Residuated frames with applications to decidability
- Residuated lattices. An algebraic glimpse at substructural logics
- Specially ordered groups
- The finite model property for various fragments of intuitionistic linear logic
- Towards a semantic characterization of cut-elimination
- Which structural rules admit cut elimination? An algebraic criterion
- Zur Kennzeichnung der Dedekind-MacNeilleschen Hülle einer geordneten Menge
Cited in
(50)- The logic of pseudo-uninorms and their residua
- Density revisited
- Finite-valued semantics for canonical labelled calculi
- Canonical formulas for \(k\)-potent commutative, integral, residuated lattices
- Hyper-MacNeille completions of Heyting algebras
- Residuated structures and orthomodular lattices
- Semantical approach to cut elimination and subformula property in modal logic
- Densification of FL chains via residuated frames
- Skolemization and Herbrand theorems for lattice-valued logics
- Syntactic Completeness of Proper Display Calculi
- A note on the substructural hierarchy
- Intermediate logics admitting a structural hypersequent calculus
- Jankov Formulas and Axiomatization Techniques for Intermediate Logics
- Power and limits of structural display rules
- Join-completions of partially ordered algebras
- Hypersequent rules with restricted contexts for propositional modal logics
- Integrally closed residuated lattices
- Poset products as relational models
- Disjunction property and complexity of substructural logics
- Proof theory for lattice-ordered groups
- Algebraic proof theory for LE-logics
- MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE
- Cut elimination and strong separation for substructural logics: an algebraic approach
- Finite embeddability property for residuated lattices via regular languages
- Universal proof theory: semi-analytic rules and Craig interpolation
- Fibred algebraic semantics for a variety of non-classical first-order logics and topological logical translation
- Conuclear images of substructural logics
- Uniform proofs of standard completeness for extensions of first-order MTL
- Algebraic proof theory: hypersequents and hypercompletions
- An algebraic approach to the disjunction property of substructural logics
- THE LOGIC OF RESOURCES AND CAPABILITIES
- Which structural rules admit cut elimination? An algebraic criterion
- The distributivity on bi-approximation semantics
- Algebraization, parametrized local deduction theorem and interpolation for substructural logics over FL
- Expanding the Realm of Systematic Proof Theory
- Tools for the investigation of substructural and paraconsistent logics
- Higher-Order Categorical Substructural Logic: Expanding the Horizon of Tripos Theory
- Specifying proof systems in linear logic with subexponentials
- Modal translation of substructural logics
- FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE
- Judgement aggregation in non-classical logics
- scientific article; zbMATH DE number 7204446 (Why is no real title available?)
- Extensions of Lambek calculi
- MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics
- MacNeille completions of FL-algebras
- Focused proof-search in the logic of bunched implications
- Topological duality and algebraic completions
- Distributive residuated frames and generalized bunched implication algebras
- The bounded proof property via step algebras and step frames
- Taming paraconsistent (and other) logics: an algorithmic approach
This page was built for publication: Algebraic proof theory for substructural logics: cut-elimination and completions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409322)
