- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Algebraic proof theory for substructural logics: cut-elimination and completions
Annals of Pure and Applied Logic 163 (3):266-290 (2012)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Glivenko theorems revisited.Hiroakira Ono - 2010 - Annals of Pure and Applied Logic 161 (2):246-250.
Cut elimination and strong separation for substructural logics: an algebraic approach.Nikolaos Galatos & Hiroakira Ono - 2010 - Annals of Pure and Applied Logic 161 (9):1097-1133.
Proof complexity of substructural logics.Raheleh Jalali - 2021 - Annals of Pure and Applied Logic 172 (7):102972.
Synthesized substructural logics.Norihiro Kamide - 2007 - Mathematical Logic Quarterly 53 (3):219-225.
Synthesized substructural logics.Norihori Kamide - 2007 - Mathematical Logic Quarterly 53 (3):219-225.
A cut-elimination proof in intuitionistic predicate logic.Mirjana Borisavljević - 1999 - Annals of Pure and Applied Logic 99 (1-3):105-136.
Crawley Completions of Residuated Lattices and Algebraic Completeness of Substructural Predicate Logics.Hiroakira Ono - 2012 - Studia Logica 100 (1-2):339-359.
Cut elimination for the unified logic.Jacqueline Vauzeilles - 1993 - Annals of Pure and Applied Logic 62 (1):1-16.
Cut Elimination, Identity Elimination, and Interpolation in Super-Belnap Logics.Adam Přenosil - 2017 - Studia Logica 105 (6):1255-1289.
Analytics
Added to PP
2013-10-27
Downloads
341 (#133,652)
6 months
62 (#149,499)
2013-10-27
Downloads
341 (#133,652)
6 months
62 (#149,499)
Historical graph of downloads
Citations of this work
Order algebraizable logics.James G. Raftery - 2013 - Annals of Pure and Applied Logic 164 (3):251-283.
Universal proof theory: Semi-analytic rules and Craig interpolation.Amirhossein Akbar Tabatabai & Raheleh Jalali - 2025 - Annals of Pure and Applied Logic 176 (1):103509.
Judgement aggregation in non-classical logics.Daniele Porello - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):106-139.
Algebraic proof theory: Hypersequents and hypercompletions.Agata Ciabattoni, Nikolaos Galatos & Kazushige Terui - 2017 - Annals of Pure and Applied Logic 168 (3):693-737.
References found in this work
Residuated Lattices: An Algebraic Glimpse at Substructural Logics.Nikolaos Galatos, Peter Jipsen, Tomasz Kowalski & Hiroakira Ono - 2007 - Elsevier.
Algebraization, Parametrized Local Deduction Theorem and Interpolation for Substructural Logics over FL.Nikolaos Galatos & Hiroakira Ono - 2006 - Studia Logica 83 (1-3):279-308.
Algorithmic correspondence and canonicity for distributive modal logic.Willem Conradie & Alessandra Palmigiano - 2012 - Annals of Pure and Applied Logic 163 (3):338-376.
The finite model property for various fragments of intuitionistic linear logic.Mitsuhiro Okada & Kazushige Terui - 1999 - Journal of Symbolic Logic 64 (2):790-802.
Correspondences between Gentzen and Hilbert Systems.J. G. Raftery - 2006 - Journal of Symbolic Logic 71 (3):903 - 957.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation