News for hackers. Stuff that matters.
Re:Set Theory and Algebra in CS: Introduction to Mathematica... by antidesitter on Sunday August 26, 2018 @12:20AM (#17844238)
Can a statement like Goodstein's theorem (which is about finite objects) be proven by finitist mathematics? It cannot be proven by Peano arithmetic, which is bi-interpretable with ZFC with the axiom of infinity replaced by its negation [1], or any weaker theory.

[1] https://math.stackexchange.com/questions/315399/how-does-zfc...

There are no comments on this comment yet.