Classical Non-Associative Lambek Calculus
Studia Logica 71 (3):355 - 388 (2002)
| Abstract | We introduce non-associative linear logic, which may be seen as the classical version of the non-associative Lambek calculus. We define its sequent calculus, its theory of proof-nets, for which we give a correctness criterion and a sequentialization theorem, and we show proof search in it is polynomial. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,701 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesPhilippe de Groote & François Lamarche (2002). Classical Non-Associative Lambek Calculus. Studia Logica 71 (3):355-388.
Maria Bulińska (2005). The Pentus Theorem for Lambek Calculus with Simple Nonlogical Axioms. Studia Logica 81 (1):43 - 59.
Heinrich Wansing (2002). A Rule-Extension of the Non-Associative Lambek Calculus. Studia Logica 71 (3):443-451.
Richard Moot & Quintijn Puite (2002). Proof Nets for the Multimodal Lambek Calculus. Studia Logica 71 (3):415-442.
Maria Bulińska (2009). On the Complexity of Nonassociative Lambek Calculus with Unit. Studia Logica 93 (1).
Wojciech Zielonka (1989). A Simple and General Method of Solving the Finite Axiomatizability Problems for Lambek's Syntactic Calculi. Studia Logica 48 (1):35 - 39.
Sharon Shoham & Nissim Francez (2008). Game Semantics for the Lambek-Calculus: Capturing Directionality and the Absence of Structural Rules. Studia Logica 90 (2):161 - 188.
Hajnal Andréka & Szabolcs Mikulás (1994). Lambek Calculus and its Relational Semantics: Completeness and Incompleteness. Journal of Logic, Language and Information 3 (1):1-37.
Wojciech Zielonka (2002). On Reduction Systems Equivalent to the Lambek Calculus with the Empty String. Studia Logica 71 (1):31-46.
Erik Aarts (1994). Proving Theorems of the Second Order Lambek Calculus in Polynomial Time. Studia Logica 53 (3):373 - 387.
Denis Béchet (2007). Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition. Studia Logica 87 (2-3):199 - 224.
Kosta Došen (1992). Modal Logic as Metalogic. Journal of Logic, Language and Information 1 (3):173-201.
Makoto Kanazawa (1992). The Lambek Calculus Enriched with Additional Connectives. Journal of Logic, Language and Information 1 (2).
V. Michele Abrusci & Elena Maringelli (1998). A New Correctness Criterion for Cyclic Proof Nets. Journal of Logic, Language and Information 7 (4):449-459.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2011-05-29Total downloads1 ( #274,921 of 549,113 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
