Infinitary Action Logic with Exponentiation

by   Stepan L. Kuznetsov, et al.
LLC Mail.Ru

We introduce infinitary action logic with exponentiation—that is, the multiplicative-additive Lambek calculus extended with Kleene star and with a family of subexponential modalities, which allows some of the structural rules (contraction, weakening, permutation). The logic is presented in the form of an infinitary sequent calculus. We prove cut elimination and, in the case where at least one subexponential allows non-local contraction, establish exact complexity boundaries in two senses. First, we show that the derivability problem for this logic is Π_1^1-complete. Second, we show that the closure ordinal of its derivability operator is ω_1^CK.


page 1

page 2

page 3

page 4


Complexity of the Infinitary Lambek Calculus with Kleene Star

We consider the Lambek calculus, or non-commutative multiplicative intui...

A Curry-Howard Correspondence for the Minimal Fragment of Łukasiewicz Logic

In this paper we introduce a term calculus B which adds to the affine λ...

Action Logic is Undecidable

Action logic is the algebraic logic (inequational theory) of residuated ...

Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics

We establish decidability for the infinitely many axiomatic extensions o...

A type-assignment of linear erasure and duplication

We introduce LEM, a type-assignment system for the linear λ-calculus tha...

The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities

We give a proof-theoretic and algorithmic complexity analysis for system...

Comparing and evaluating extended Lambek calculi

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

Please sign up or login with your details

Forgot password? Click here to reset