Hostname: page-component-76d6cb85b7-xh428 Total loading time: 0 Render date: 2026-07-14T00:54:07.961Z Has data issue: false hasContentIssue false

THE MODAL LOGIC OF SET-THEORETIC POTENTIALISM AND THE POTENTIALIST MAXIMALITY PRINCIPLES

Published online by Cambridge University Press:  04 October 2019

JOEL DAVID HAMKINS
Affiliation:
FACULTY OF PHILOSOPHY UNIVERSITY OF OXFORD OXFORD, UK and UNIVERSITY COLLEGE OXFORD, UK E-mail: jhamkins@gc.cuny.edu URL: http://jdh.hamkins.org
ØYSTEIN LINNEBO
Affiliation:
DEPARTMENT OF PHILOSOPHY, IFIKK UNIVERSITY OF OSLO, POSTBOKS 1020 BLINDERN 0315 OSLO, NORWAY E-mail: oystein.linnebo@ifikk.uio.no URL: http://oysteinlinnebo.org

Abstract

We analyze the precise modal commitments of several natural varieties of set-theoretic potentialism, using tools we develop for a general model-theoretic account of potentialism, building on those of Hamkins, Leibman and Löwe [14], including the use of buttons, switches, dials and ratchets. Among the potentialist conceptions we consider are: rank potentialism (true in all larger Image$V_\beta $), Grothendieck–Zermelo potentialism (true in all larger Image$V_\kappa $ for inaccessible cardinals Image$\kappa $), transitive-set potentialism (true in all larger transitive sets), forcing potentialism (true in all forcing extensions), countable-transitive-model potentialism (true in all larger countable transitive models of ZFC), countable-model potentialism (true in all larger countable models of ZFC), and others. In each case, we identify lower bounds for the modal validities, which are generally either S4.2 or S4.3, and an upper bound of S5, proving in each case that these bounds are optimal. The validity of S5 in a world is a potentialist maximality principle, an interesting set-theoretic principle of its own. The results can be viewed as providing an analysis of the modal commitments of the various set-theoretic multiverse conceptions corresponding to each potentialist account.

Information

Type
Research Article
Copyright
© Association for Symbolic Logic, 2022

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable