Analytic cut trees

Logic Journal of the IGPL 8:733-750 (2000)
Abstract 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 <span class='Hi'>analytic</span> cut trees, a system from which cuts cannot be eliminated but satisfying the subformula property. Like tableaux <span class='Hi'>analytic</span> cut trees are a refutation system but unlike tableaux they have a single inference rule (a form of the <span class='Hi'>analytic</span> cut rule) and several branch closure rules. The main advantage of <span class='Hi'>analytic</span> cut trees over tableaux is efficiency: while <span class='Hi'>analytic</span> cut trees can simulate tableaux with an increase in complexity by at most a constant factor, tableaux cannot polynomially simulate <span class='Hi'>analytic</span> cut trees. Indeed <span class='Hi'>analytic</span> cut trees are intrinsically more efficient than any cut-free system.
Keywords No keywords specified (fix it)
Categories
Options
 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: 5,701
External links
  •   Try with proxy.
  • Through your library Configure

    Similar books and articles

    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    17 ( #71,134 of 549,124 )

    Recent downloads (6 months)

    3 ( #25,740 of 549,124 )

    How can I increase my downloads?


    My notes
    Sign in to use this feature


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

    Other forums