Proving theorems of the second order Lambek calculus in polynomial time

Studia Logica 53 (3):373 - 387 (1994)
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 decides provability of sequents in polynomial time.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF01057934
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 35,865
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles


Added to PP index

Total downloads
49 ( #132,103 of 2,293,801 )

Recent downloads (6 months)
3 ( #182,547 of 2,293,801 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature