- This event has passed.

# CUNY Logic Workshop: Joel David Hamkins

## September 8 @ 2:00 pm - 3:30 pm

**CUNY Logic Workshop**

September 8, 2017, 2-3:30pm

Room GC 6417

**Joel David Hamkins** (CUNY Graduate Center)

“Arithmetic potentialism and the universal algorithm”

**Abstract.** Consider the collection of all the models of arithmetic under the end-extension relation, which forms a potentialist system for arithmetic, a collection of possible arithmetic worlds or universe fragments, with a corresponding potentialist modal semantics. What are the modal validities? I shall prove that every model of arithmetic validates exactly S4 with respect to assertions in the language of arithmetic allowing parameters, but if one considers sentences only (no parameters), then some models can validate up to S5, thereby fulfilling the *arithmetic maximality principle*, which asserts for a model MM that whenever an arithmetic sentence is true in some end-extension of MM and all subsequent end-extensions, then it is already true in MM.

The proof makes fundamental use of what I call the universal algorithm, a fascinating result due to W. Hugh Woodin, asserting that there is a computable algorithm that can in principle enumerate any desired finite sequence, if only it is undertaken in the right universe, and furthermore any given model of arithmetic can be end-extended so as to realize any desired additional behavior for that universal program. I shall give a simple proof of the universal algorithm theorem and explain how it can be used to determine the potentialist validities of a model of arithmetic. This is current joint work in progress with Victoria Gitman and Roman Kossak, and should be seen as an arithmetic analogue of my recent work on set-theoretic potentialism with Øystein Linnebo. The mathematical program is strongly motivated by philosophical ideas arising in the distinction between actual and potential infinity.