Re:Computer Proof ‘Blows Up’ Centuries-Old Fluid Equations
by auggierose on Saturday November 19, 2022 @05:09PM
(#33675322)
Ah ok, I see what you mean.
This is different what I would understand under an Ur-Logic: Just a logical system that can express anything you want, given you are free to add axioms. Obviously there are a few choices for that.
Re:Computer Proof ‘Blows Up’ Centuries-Old Fluid Equations
by qazxcvbnm on Sunday November 20, 2022 @01:23AM
(#33678807)
> there is another possible escape hatch that hasn't been fully explored IMO, and that's some variant of finitism. All these impossibility proofs depend on infinite structures to derive incompleteness or contradiction, but if infinite structures are not expressible...
Could you elaborate on what such a formalism where infinite structures are not expressible might look like? It sounds an intriguing notion, though I'm unable to quite get at it.
Re:Computer Proof ‘Blows Up’ Centuries-Old Fluid Equations
by naasking on Sunday November 20, 2022 @10:56AM
(#33681916)
Bendegem's paper is a good introduction and overview:
A Defense of Strict Finitism, http://www.jeanpaulvanbendegem.be/strict%20finitism.pdf
This is why Hilbert's program to finitely axiomatize mathematics can't be completed. The "escape hatch" here is simply that not all propositions are actually interesting, so finite axiomatizations are still very useful, and we can extend the axiomatic basis as needed given satisfactory justification. This last part is the only place where social consensus sometimes comes into play (continuum hypothesis, etc).
Edit: there is another possible escape hatch that hasn't been fully explored IMO, and that's some variant of finitism. All these impossibility proofs depend on infinite structures to derive incompleteness or contradiction, but if infinite structures are not expressible...