Consistency-provability strengthening conjecture

Let T\mathcal T be the class of theories under consideration, and let ConSCon_S mean that SS is consistent. Consistency-provability strengthening conjecture. For every S,TTS,T\in\mathcal T, if TT proves ConSCon_S, then the lengths of SS-proofs of ConT(nˉ)Con_T(\bar n) cannot be bounded by a polynomial in nn. 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

No solutions have been posted yet.