2020
DOI: 10.1093/logcom/exaa010
|View full text |Cite
|
Sign up to set email alerts
|

Reconciling Lambek’s restriction, cut-elimination and substitution in the presence of exponential modalities

Abstract: The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's restriction," that is, the antecedent of any provable sequent should be non-empty. In this paper we discuss ways of extending the Lambek calculus with the linear logic exponential modality while keeping Lambek's restriction. Interestingly enough, we show that for any system equipped with a reasonable exponential modality the followi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 25 publications
0
1
0
Order By: Relevance
“…In the view of the above, Lambek's non-emptiness restriction is a desirable feature of a logical system underlying categorial grammars. Unfortunately, as shown in [Kanovich et al 2020], this restriction conflicts with one of the extensions of the Lambek calculus we study in this paper, namely, (sub)exponential modalities (see below)-so we opt for the system without Lambek's restriction. This system is called the Lambek calculus allowing empty antecedents [Lambek 1961] and is a fragment of the broader system !ACT ω , which is defined in the next section.…”
Section: Linguistic Introductionmentioning
confidence: 99%
“…In the view of the above, Lambek's non-emptiness restriction is a desirable feature of a logical system underlying categorial grammars. Unfortunately, as shown in [Kanovich et al 2020], this restriction conflicts with one of the extensions of the Lambek calculus we study in this paper, namely, (sub)exponential modalities (see below)-so we opt for the system without Lambek's restriction. This system is called the Lambek calculus allowing empty antecedents [Lambek 1961] and is a fragment of the broader system !ACT ω , which is defined in the next section.…”
Section: Linguistic Introductionmentioning
confidence: 99%