You are not currently logged in.
Access JSTOR through your library or other institution:
Proving Theorems of the Second Order Lambek Calculus in Polynomial Time
Studia Logica: An International Journal for Symbolic Logic
Vol. 53, No. 3 (Aug., 1994), pp. 373-387
Published by: Springer
Stable URL: http://www.jstor.org/stable/20015731
Page Count: 15
You can always find the topics here!Topics: Sequents, Syntactical antecedents, Lambek calculus, Algorithms, Polynomials, Logical antecedents, Mathematical intervals, Logical theorems, Provability logic, Mathematical theorems
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
In the Lambek calculus of order 2 we allow only sequents in which the depth of nesting of implications is limited to 2. We prove that the decision problem of provability in the calculus can be solved in time polynomial in the length of the sequent. A normal form for proofs of second order sequents is defined. It is shown that for every proof there is a normal form proof with the same axioms. With this normal form we can give an algorithm that dècides provability of sequents in polynomial time.
Studia Logica: An International Journal for Symbolic Logic © 1994 Springer