51
votes
28answers
5k views
Can infinity shorten proofs a lot?
I've just been asked for a good example of a situation in maths where using infinity can greatly shorten an argument. The person who wants the example wants it as part of a present …
15
votes
3answers
742 views
Finite versions of Godel' s incompleteness
Assume you have some notion of proof complexity: for instance, at the basic level, the length of a proof, or the number of symbols used, take your pick (there are more involved mea …
3
votes
2answers
504 views
Measure of progress towards a proof
Can one define some measure of progress towards a proof of a statement? I'm not sure if it's even possible for general first order logic statements so let's restrict ourselves to p …
3
votes
1answer
525 views
Proof system with same complexity as “informal mathematics”?
The Completeness Theorem in first-order logic states that any mathematical validity is derivable from axioms. Hence, any informal mathematical proof (which is rigorous) can be tran …
2
votes
2answers
428 views
Proof systems and their hierarchy
Why ZFC is placed in top of the proof system hierarchy? How it can p-simulate other systems?
2
votes
0answers
163 views
Oracle sparating FIP for bounded-depth Frege from FIP for Frege (and hardness conditions on DDH)
Is there an oracle such that in the relativized world, bd-Frege (bounded depth Frege propositional proof system) has FIP (feasible interpolation property) but Frege does not hav …

