Journal of Logic, Language and Information 9 (3):339-352 (2000)
An axiomatics of the product-free syntactic calculus L ofLambek has been presented whose only rule is the cut rule. It was alsoproved that there is no finite axiomatics of that kind. The proofs weresubsequently simplified. Analogous results for the nonassociativevariant NL of L were obtained by Kandulski. InLambek's original version of the calculus, sequent antecedents arerequired to be nonempty. By removing this restriction, we obtain theextensions L 0 and NL 0 ofL and NL, respectively. Later, the finiteaxiomatization problem for L 0 andNL 0 was partially solved, viz., for formulas withoutleft (or, equivalently, right) division and an (infinite) cut-ruleaxiomatics for the whole of L 0 has been given. Thepresent paper yields an analogous axiomatics forNL 0. Like in the author's previous work, the notionof rank of an axiom is introduced which, although inessentialfor the results given below, may be useful for the expectednonfinite-axiomatizability proof.
|Keywords||axiomatizability cut rule Lambek calculus|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Cut-Free Tableau Calculi for Some Propositional Normal Modal Logics.Martin Amerbauer - 1996 - Studia Logica 57 (2-3):359 - 372.
On Reduction Systems Equivalent to the Lambek Calculus with the Empty String.Wojciech Zielonka - 2002 - Studia Logica 71 (1):31-46.
A Simple and General Method of Solving the Finite Axiomatizability Problems for Lambek's Syntactic Calculi.Wojciech Zielonka - 1989 - Studia Logica 48 (1):35 - 39.
Linear Axiomatics of Commutative Product-Free Lambek Calculus.Wojciech Zielonka - 1990 - Studia Logica 49 (4):515 - 522.
A Simple Proof of Completeness and Cut-Elimination for Propositional G¨ Odel Logic.Arnon Avron - unknown
Cut-Elimination and Proof-Search for Bi-Intuitionistic Logic Using Nested Sequents.Rajeev Gore, Linda Postniece & Alwen Tiu - unknown
Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic.Roy Dyckhoff & Luis Pinto - 1998 - Studia Logica 60 (1):107-118.
Valentini's Cut-Elimination for Provability Logic Resolved.Rajeev Gore & Revantha Ramanayake - 2012 - Review of Symbolic Logic 5 (2):212-238.
Cut-Rule Axiomatization of the Syntactic Calculus L.Wojciech Zielonka - 2001 - Journal of Logic, Language and Information 10 (2):339-352.
Added to index2009-01-28
Total downloads8 ( #490,775 of 2,168,327 )
Recent downloads (6 months)1 ( #346,758 of 2,168,327 )
How can I increase my downloads?