Earlier quoted context omitted.
These are the implications of Godel's incompleteness theorems. No formal system expressive enough to encode arithmetic can simultaneously be both complete and prove its own consistency, because there will always be true propositions expressible in that system that cannot be proven in that system. This is why Hilbert's program to finitely axiomatize mathematics can't be completed. The "escape hatch" here is simply tha…
> 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…
A Defense of Strict Finitism, http://www.jeanpaulvanbendegem.be/strict%20finitism.pdf