- 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
A note on the substructural hierarchy
Mathematical Logic Quarterly 62 (1-2):102-110 (2016)
Abstract
We prove that all axiomatic extensions of the full Lambek calculus with exchange can be axiomatized by formulas on the level of the substructural hierarchy.Author's Profile
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
Most Simple Extensions of Are Undecidable.Nikolaos Galatos & Gavin St John - 2022 - Journal of Symbolic Logic 87 (3):1156-1200.
On the Complexity of Some Substructural Logics.Buszkowski Wojciech - 2008 - Reports on Mathematical Logic.
Extensions of Lambek Calculi.Wojciech Buszkowski - 2021 - In Claudia Casadio & Philip J. Scott (eds.), Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics. Springer Verlag. pp. 105-134.
Algebraization, Parametrized Local Deduction Theorem and Interpolation for Substructural Logics over FL.Nikolaos Galatos & Hiroakira Ono - 2006 - Studia Logica 83 (1-3):279-308.
Nonassociative substructural logics and their semilinear extensions: Axiomatization and completeness properties: Nonassociative substructural logics.Petr Cintula, Rostislav Horčík & Carles Noguera - 2013 - Review of Symbolic Logic 6 (3):394-423.
On two questions about feasibly constructive arithmetic.Morteza Moniri - 2003 - Mathematical Logic Quarterly 49 (4):425.
Finite Models of Some Substructural Logics.Wojciech Buszkowski - 2002 - Mathematical Logic Quarterly 48 (1):63-72.
Cut Elimination In Noncommutative Substructural Logics.Bayu Surarso & Hiroakira Ono - 1996 - Reports on Mathematical Logic:13-29.
Note on Deduction Theorems in contraction‐free logics.Karel Chvalovský & Petr Cintula - 2012 - Mathematical Logic Quarterly 58 (3):236-243.
Analytics
Added to PP
2016-02-04
Downloads
37 (#616,168)
6 months
13 (#270,984)
2016-02-04
Downloads
37 (#616,168)
6 months
13 (#270,984)
Historical graph of downloads
Author's Profile
Citations of this work
Algebraic proof theory: Hypersequents and hypercompletions.Agata Ciabattoni, Nikolaos Galatos & Kazushige Terui - 2017 - Annals of Pure and Applied Logic 168 (3):693-737.
Bounded-analytic sequent calculi and embeddings for hypersequent logics.Agata Ciabattoni, Timo Lang & Revantha Ramanayake - 2021 - Journal of Symbolic Logic 86 (2):635-668.
References found in this work
Algebraic proof theory for substructural logics: cut-elimination and completions.Agata Ciabattoni, Nikolaos Galatos & Kazushige Terui - 2012 - Annals of Pure and Applied Logic 163 (3):266-290.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
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
Server: philpapers-web-667477cd97-lxkd2 dc2