The cost of a cycle is a square

Journal of Symbolic Logic 67 (1):35-60 (2002)
The logical flow graphs of sequent calculus proofs might contain oriented cycles. For the predicate calculus the elimination of cycles might be non-elementary and this was shown in [Car96]. For the propositional calculus, we prove that if a proof of k lines contains n cycles then there exists an acyclic proof with O(k n+l ) lines. In particular, there is a polynomial time algorithm which eliminates cycles from a proof. These results are motivated by the search for general methods on proving lower bounds on proof size and by the design of more efficient heuristic algorithms for proof search
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1190150028
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,719
Through your library
References found in this work BETA
Bounds for Proof-Search and Speed-Up in the Predicate Calculus.Richard Statman - 1978 - Annals of Mathematical Logic 15 (3):225-287.
Duplication of Directed Graphs and Exponential Blow Up of Proofs.A. Carbone - 1999 - Annals of Pure and Applied Logic 100 (1-3):1-67.
Some Remarks on Lengths of Propositional Proofs.Samuel R. Buss - 1995 - Archive for Mathematical Logic 34 (6):377-394.
Turning Cycles Into Spirals.A. Carbone - 1999 - Annals of Pure and Applied Logic 96 (1-3):57-73.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index

Total downloads
12 ( #389,132 of 2,197,288 )

Recent downloads (6 months)
1 ( #298,964 of 2,197,288 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature