A simple and general method of solving the finite axiomatizability problems for Lambek's syntactic calculi
Graduate studies at Western
Studia Logica 48 (1):35 - 39 (1989)
|Abstract||In , I proved that the product-free fragment L of Lambek's syntactic calculus (cf. Lambek ) is not finitely axiomatizable if the only rule of inference admitted is Lambek's cut-rule. The proof (which is rather complicated and roundabout) was subsequently adapted by Kandulski  to the non-associative variant NL of L (cf. Lambek ). It turns out, however, that there exists an extremely simple method of non-finite-axiomatizability proofs which works uniformly for different subsystems of L (in particular, for NL). We present it below to the use of those who refer to the results of  and .|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Michał Kozak (2009). Distributive Full Lambek Calculus has the Finite Model Property. Studia Logica 91 (2):201 - 216.
Wojciech Zielonka (2001). Cut-Rule Axiomatization of the Syntactic Calculus L. Journal of Logic, Language and Information 10 (2):339-352.
Maria Bulińska (2005). The Pentus Theorem for Lambek Calculus with Simple Nonlogical Axioms. Studia Logica 81 (1):43 - 59.
Wojciech Zielonka (1990). Linear Axiomatics of Commutative Product-Free Lambek Calculus. Studia Logica 49 (4):515 - 522.
Wojciech Buszkowski (1996). The Finite Model Property for BCI and Related Systems. Studia Logica 57 (2-3):303 - 323.
Maria Bulińska (2009). On the Complexity of Nonassociative Lambek Calculus with Unit. Studia Logica 93 (1):1 - 14.
Maciej Farulewski (2005). On Finite Models of the Lambek Calculus. Studia Logica 80 (1):63 - 74.
Wojciech Zielonka (2000). Cut-Rule Axiomatization of the Syntactic Calculus NL. Journal of Logic, Language and Information 9 (3):339-352.
Makoto Kanazawa (1992). The Lambek Calculus Enriched with Additional Connectives. Journal of Logic, Language and Information 1 (2):141-171.
Wojciech Zielonka (2002). On Reduction Systems Equivalent to the Lambek Calculus with the Empty String. Studia Logica 71 (1):31-46.
Added to index2009-01-28
Total downloads2 ( #246,859 of 739,165 )
Recent downloads (6 months)1 ( #61,778 of 739,165 )
How can I increase my downloads?