My first paper was “An incompleteness theorem for $\beta_n$ models” with Stephen Simpson [1]. It’s a short paper, but the idea is very pretty. We know that the incompleteness theorem implies there are strange models of arithmetic, but these models often seem mysterious, and it’s hard to see what useful properties they can have. But now suppose that a theory of the form $A+B$ meets the hypotheses of the incompleteness theorem, and moreover this theory proves its own consistency, so that $A+B$ is inconsistent. It follows that if $A$ is true (that is, true in the standard model) then $B$ must be false. In this way, we can use the incompleteness theorem to prove facts about the standard model rather than about nonstandard ones. The idea is originally due to Harvey Friedman in his thesis, I believe.

Continue reading

### Boole’s Rings

- A variety of mathematical proof-of-work problems will provide better security for cryptocurrencies than hash-based proof-of-work problems May 24, 2017 Joseph Van Name
- Euclidean Ramsey Theory 2 – Ramsey DocCourse Prague 2016 May 24, 2017 Mike Pawliuk
- Graphs obtained from endomorphic Laver tables May 16, 2017 Joseph Van Name
- Moment of Zen May 16, 2017 Asaf Karagila
- Kaethe Lynn Bruesselbach Minden, PhD 2017, CUNY Graduate Center May 12, 2017 Joel David Hamkins

### Comments on Boole’s Rings

- Comment on A program that accepts exactly any desired finite set, in the right universe by Joel David Hamkins May 26, 2017 Comments for Joel David Hamkins
- Comment on Infinite Combinatorial Topology by saf May 25, 2017 Comments for Assaf Rinot
- Comment on Infinite Combinatorial Topology by Ari Brodsky May 25, 2017 Comments for Assaf Rinot
- Comment on A Microscopic approach to Souslin-tree constructions. Part I by saf May 24, 2017 Comments for Assaf Rinot
- Comment on Math for nine-year-olds: fold, punch and cut for symmetry! by Symmetry – G∞AT May 23, 2017 Comments for Joel David Hamkins