Consistency-provability strengthening conjecture
Consistency-provability strengthening conjecture
Let be the class of theories under consideration, and let mean that is consistent. Consistency-provability strengthening conjecture. For every , if proves , then the lengths of -proofs of cannot be bounded by a polynomial in . This proposes a concrete sufficient condition for the relative strength in the finite consistency conjecture.
Sources & referencesView supporting material
Primary source
Pavel Pudlak, “Incompleteness in the finite domain”, arXiv:1601.01487 (2017).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.