Log In Sign Up

Proof-theoretic aspects of NLλ

by   Richard Moot, et al.

We present a proof-theoretic analysis of the logic NLλ (Barker & Shan 2014, Barker 2019). We notably introduce a novel calculus of proof nets and prove it is sound and complete with respect to the sequent calculus for the logic. We study decidability and complexity of the logic using this new calculus, proving a new upper bound for complexity of the logic (showing it is in NP) and a new lower bound for the class of formal language generated by the formalism (mildly context-sensitive languages extended with a permutation closure operation). Finally, thanks to this new calculus, we present a novel comparison between NLλ and the hybrid type-logical grammars of Kubota & Levine (2020). We show there is an unexpected convergence of the natural language analyses proposed in the two formalism. In addition to studying the proof-theoretic properties of NLλ, we greatly extends its linguistic coverage.


page 1

page 2

page 3

page 4


The Logic for a Mildly Context-Sensitive Fragment of the Lambek-Grishin Calculus

While context-free grammars are characterized by a simple proof-theoreti...

Logical foundations for hybrid type-logical grammars

This paper explores proof-theoretic aspects of hybrid type-logical gramm...

Proof Complexity of Substructural Logics

In this paper, we investigate the proof complexity of a wide range of su...

Supporting Context Monotonicity Abstractions in Neural NLI Models

Natural language contexts display logical regularities with respect to s...

Comparing and evaluating extended Lambek calculi

Lambeks Syntactic Calculus, commonly referred to as the Lambek calculus,...

Computational Aspects of the Calculus of Structure

Logic is the science of correct inferences and a logical system is a too...

A syllogistic system for propositions with intermediate quantifiers

This paper describes a formalism that subsumes Peterson's intermediate q...