Analytic cut trees

Logic Journal of the IGPL 8 (6):733-750 (2000)
It has been maintained by Smullyan that the importance of cut-free proofs does not stem from cut elimination per se but rather from the fact that they satisfy the subformula property. In accordance with such a viewpoint in this paper we introduce analytic cut trees, a system from which cuts cannot be eliminated but satisfying the subformula property. Like tableaux analytic cut trees are a refutation system but unlike tableaux they have a single inference rule and several branch closure rules. The main advantage of analytic cut trees over tableaux is efficiency: while analytic cut trees can simulate tableaux with an increase in complexity by at most a constant factor, tableaux cannot polynomially simulate analytic cut trees. Indeed analytic cut trees are intrinsically more efficient than any cut-free system.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1093/jigpal/8.6.733
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,463
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

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

255 ( #11,683 of 1,925,534 )

Recent downloads (6 months)

70 ( #3,745 of 1,925,534 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.