Subexponentials in Nonassociative Lambek Calculus

We focus on a family on noncommutative nonassociative substructural logics enriched with subexponentials, unary modalities licensing local application of structural rules. Primarily, we prove upper and lower bounds on complexity of provability in a broad class of these logics. To uniformly frame these results, we present two sets of rules, one intuitionistic and one classical, with the intention of capturing a broad subset of existing logics as fragments. We also prove equivalences of these systems in natural settings.

Author dc:creator

• Blaisdell, Eben

Advisor dc:contributor.advisor

• Scedrov, Andre

• Mathematics

Language dc:language.iso

en

Repository record dc:identifier.uri

https://repository.upenn.edu/handle/20.500.14332/60270

OAI identifier oai:identifier

oai:repository.upenn.edu:20.500.14332/60270