Abstract
Lambek elegantly characterized part of natural language. As is well-known, his sub-structural logic L, and its non-associative version NL, handle basic function/argument composition well, but not scope taking and syntactic displacement—at least, not in their full generality. In previous work, I propose NLλ, which is NL supplemented with a single structural inference rule (“abstraction”). Abstraction closely resembles the traditional linguistic rule of quantifier raising, and characterizes both semantic scope taking and syntactic displacement. Due to the unconventional form of the abstraction inference, there has been some doubt that NLλ should count at a legitimate substruc-tural logic. This paper argues that NLλ is perfectly well-behaved. In particular, it enjoys cut elimination and an interpolation result. In addition, perhaps surprisingly, it is decidable. Finally, I prove that it is sound and complete with respect to the usual class of relational frames.
Original language | English (US) |
---|---|
Pages (from-to) | 217-237 |
Number of pages | 21 |
Journal | Journal of Logic, Language and Information |
Volume | 28 |
Issue number | 2 |
DOIs | |
State | Published - Jun 2019 |
Keywords
- Continuations
- Decidability
- Lambek
- Quantifier raising
- Scope
- Substructural logic
- Syntactic movement
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- Philosophy
- Linguistics and Language