Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Versions of a Local Contraction Subexponential in the Lambek Calculus

Versions of a Local Contraction Subexponential in the Lambek Calculus The Lambek calculus was introduced as a tool for examining linguistic constructions. Then this calculus was complemented with both new connectives and structural rules like contraction, weakening, and permutation. The structural rules are allowed only for formulas under the symbol of a specific modality called exponential. The Lambek calculus itself is a noncommutative structural logic, and for arbitrary formulas, the structural rules mentioned are not allowed. The next step is the introduction of a system of subexponentials: under the symbol of such a modality, only certain structural rules are admitted. The following question arises: is it possible to formulate a system with a certain version of the local contraction rule (for formulas under subexponential) to recover the cut elimination property? We consider two approaches to solving this problem: one can both weaken the rule of introducing ! in the right-hand side of a sequent (LSCLC) and extend the local contraction rule from individual formulas to their subsequents (LMCLC). It is also worth mentioning that in commutative calculi, such a problem is missing since formulas in a sequent are allowed to be permuted (i.e, the local contraction rule coincides with the nonlocal one). The following results are proved: cut eliminability in the LMCLC and LSCLC calculi; algorithmic decidability of fragments of these calculi in which ! is allowed to be applied only to variables; algorithmic undecidability of LMCLC (for LSCLC, decidability remains an open question); correctness and absence of strong completeness of LSCLC with respect to a class of relational models; various results on equivalence for the calculi in question and the calculi with other versions of the contraction subexponential. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Algebra and Logic Springer Journals

Versions of a Local Contraction Subexponential in the Lambek Calculus

Algebra and Logic , Volume 61 (4) – Sep 1, 2022

Loading next page...
 
/lp/springer-journals/versions-of-a-local-contraction-subexponential-in-the-lambek-calculus-iBz0OFnB8Z

References (9)

Publisher
Springer Journals
Copyright
Copyright © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
ISSN
0002-5232
eISSN
1573-8302
DOI
10.1007/s10469-023-09696-0
Publisher site
See Article on Publisher Site

Abstract

The Lambek calculus was introduced as a tool for examining linguistic constructions. Then this calculus was complemented with both new connectives and structural rules like contraction, weakening, and permutation. The structural rules are allowed only for formulas under the symbol of a specific modality called exponential. The Lambek calculus itself is a noncommutative structural logic, and for arbitrary formulas, the structural rules mentioned are not allowed. The next step is the introduction of a system of subexponentials: under the symbol of such a modality, only certain structural rules are admitted. The following question arises: is it possible to formulate a system with a certain version of the local contraction rule (for formulas under subexponential) to recover the cut elimination property? We consider two approaches to solving this problem: one can both weaken the rule of introducing ! in the right-hand side of a sequent (LSCLC) and extend the local contraction rule from individual formulas to their subsequents (LMCLC). It is also worth mentioning that in commutative calculi, such a problem is missing since formulas in a sequent are allowed to be permuted (i.e, the local contraction rule coincides with the nonlocal one). The following results are proved: cut eliminability in the LMCLC and LSCLC calculi; algorithmic decidability of fragments of these calculi in which ! is allowed to be applied only to variables; algorithmic undecidability of LMCLC (for LSCLC, decidability remains an open question); correctness and absence of strong completeness of LSCLC with respect to a class of relational models; various results on equivalence for the calculi in question and the calculi with other versions of the contraction subexponential.

Journal

Algebra and LogicSpringer Journals

Published: Sep 1, 2022

Keywords: Lambek calculus; local contraction subexponential

There are no references for this article.