Studia Logica 53 (3):373 - 387 (1994)

Abstract
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
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 53,682
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
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

Analytics

Added to PP index
2009-01-28

Total views
78 ( #121,976 of 2,349,498 )

Recent downloads (6 months)
1 ( #510,673 of 2,349,498 )

How can I increase my downloads?

Downloads

My notes