Propositional proof systems, the consistency of first order theories and the complexity of computations

Journal of Symbolic Logic 54 (3):1063-1079 (1989)
We consider the problem about the length of proofs of the sentences $\operatorname{Con}_S(\underline{n})$ saying that there is no proof of contradiction in S whose length is ≤ n. We show the relation of this problem to some problems about propositional proof systems
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274765
 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,422
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

Add more references

Citations of this work BETA
Lutz Straßburger (2012). Extension Without Cut. Annals of Pure and Applied Logic 163 (12):1995-2007.
Jan Krajicek (2001). Tautologies From Pseudo-Random Generators. Bulletin of Symbolic Logic 7 (2):197-212.
Samuel R. Buss (1991). Propositional Consistency Proofs. Annals of Pure and Applied Logic 52 (1-2):3-29.

View all 8 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

6 ( #533,111 of 1,924,770 )

Recent downloads (6 months)

1 ( #417,923 of 1,924,770 )

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.