Skip to primary content
Skip to secondary content

Joel David Hamkins

mathematics and philosophy of the infinite

Joel David Hamkins

Main menu

  • Home
    • About
    • My Curriculum Vita
    • Contact
    • Comment Board
  • Publications
    • Publication list
    • Recent publications
    • Publications by topic
      • Automorphism towers
      • Infinitary computability
      • Infinitary utilitarianism
      • Large cardinals
    • My Research Collaborators
  • Talks
    • Talks
    • Recent and Upcoming Talks
    • Videos
  • Appointments and Grants
    • About Me
    • My Academic Appointments
    • Grants and Awards
  • Teaching
    • About My Courses
  • Students
    • About My Graduate Students
    • List of My Graduate Students
  • Mathematical Shorts
  • Math for Kids

Tag Archives: naturalist account of forcing

A multiverse perspective in mathematics and set theory: does every mathematical statement have a definite truth value? Shanghai, June 2013

Posted on May 18, 2013 by Joel David Hamkins
Reply

Fudan blueThis will be a talk for specialists in philosophy, mathematics and the philosophy of mathematics, given as part of the workshop Metamathematics and Metaphysics, June 15, 2013, sponsored by the group in Mathematical Logic at Fudan University.

Abstract:  Much of the debate on pluralism in the philosophy of set theory turns on the question of whether every mathematical and set-theoretic assertion has a definite truth value. A traditional Platonist view in set theory, which I call the universe view, holds that there is an absolute background concept of set and a corresponding absolute background set-theoretic universe in which every set-theoretic assertion has a final, definitive truth value. I shall try to tease apart two often-blurred aspects of this perspective, namely, to separate the claim that the set-theoretic universe has a real mathematical existence from the claim that it is unique. A competing view, the multiverse view, accepts the former claim and rejects the latter, by holding that there are many distinct concepts of set, each instantiated in a corresponding set-theoretic universe, and a corresponding pluralism of set-theoretic truths. After framing the dispute, I shall argue that the multiverse position explains our experience with the enormous diversity of set-theoretic possibility, a phenomenon that is one of the central set-theoretic discoveries of the past fifty years and one which challenges the universe view. In particular, I shall argue that the continuum hypothesis is settled on the multiverse view by our extensive knowledge about how it behaves in the multiverse, and as a result it can no longer be settled in the manner formerly hoped for.

Fudan University seal

 

Slides

 

 

 

 

The talk will engage with ideas from some of my recent papers on the topic:

  • The set-theoretic multiverse
  • The multiverse perspective on the axiom of constructibility
  • Is the dream solution of the continuum hypothesis possible to achieve?

Share:

  • Share on X (Opens in new window) X
  • Share on Facebook (Opens in new window) Facebook
  • Share on Reddit (Opens in new window) Reddit
  • Share on WhatsApp (Opens in new window) WhatsApp
  • Email a link to a friend (Opens in new window) Email
  • Print (Opens in new window) Print
  • More
  • Share on LinkedIn (Opens in new window) LinkedIn
  • Share on Tumblr (Opens in new window) Tumblr
  • Share on Pinterest (Opens in new window) Pinterest
Posted in Talks | Tagged CH, forcing, multiverse, naturalist account of forcing, pluralism, Shanghai | Leave a reply

Well-founded Boolean ultrapowers as large cardinal embeddings

Posted on June 26, 2012 by Joel David Hamkins
2

[bibtex key=HamkinsSeabold:BooleanUltrapowers]

Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are well-founded, the associated Boolean ultrapower embeddings exhibit a large cardinal nature, and the Boolean ultrapower construction thereby unifies two central themes of set theory—forcing and large cardinals—by revealing them to be two facets of a single underlying construction, the Boolean ultrapower.

The topic of this article was the focus of my tutorial lecture series at the Young Set Theorists Workshop at the Hausdorff Center for Mathematics in Königswinter near Bonn, Germany, March 21-25, 2011.

Share:

  • Share on X (Opens in new window) X
  • Share on Facebook (Opens in new window) Facebook
  • Share on Reddit (Opens in new window) Reddit
  • Share on WhatsApp (Opens in new window) WhatsApp
  • Email a link to a friend (Opens in new window) Email
  • Print (Opens in new window) Print
  • More
  • Share on LinkedIn (Opens in new window) LinkedIn
  • Share on Tumblr (Opens in new window) Tumblr
  • Share on Pinterest (Opens in new window) Pinterest
Posted in Publications | Tagged Boolean ultrapower, Daniel Seabold, elementary embeddings, forcing, large cardinals, multiverse, naturalist account of forcing | 2 Replies

Infinitely More

Proof and the Art of Mathematics, MIT Press, 2020

Buy Me a Coffee

Recent Comments

  • Philosophy and Logic of Games, Notre Dame, Fall 2026 | Joel David Hamkins on Infinite-Games Workshop
  • Joel David Hamkins on Alternative Fields Medal, awarded August 2026
  • Richard Waddell on Alternative Fields Medal, awarded August 2026
  • Joel David Hamkins on The lattice of sets of natural numbers is rich
  • MathFan on The lattice of sets of natural numbers is rich

JDH on Twitter

My Tweets

RSS Mathoverflow activity

  • Comment by Joel David Hamkins on Extracting a first order proof from a non first order proof
    We always have an effective procedure to find a first-order proof by searching through all proofs.
  • Comment by Joel David Hamkins on Do there exist "quasi-decidable" non-trivial properties of Turing Machines?
    Another point is that one might reply to your question by saying: all decidable properties are trivial in virtue of that, and this applies just as much to quasi-decidable, so no, there can be no nontrivial quasi-decidable properties. This is basically how you argued against the falling-off-the-tape result, by saying it was trivial and didn't […]
  • Comment by Joel David Hamkins on Do there exist "quasi-decidable" non-trivial properties of Turing Machines?
    @Benyamin It isn't cheating, since that model of computation is quite standard and appears in many textbooks (it was the model I was taught). But indeed there are a variety of Turing machine models. The paper considers other models, with two-way infinite tape, multiple states marked as halting, etc., and proves similar theorems for them. […]
  • Comment by Joel David Hamkins on Ultralimit versus partial limit
    In my view it is inadvisable to use the symbol $\omega$ in a set-theory context to mean something other than the first infinite ordinal. This invites confusion, and it will cause problems as soon as one wants to refer to the ordinal $\omega$. It's like using $e$ to denote some other real number in a […]
  • Comment by Joel David Hamkins on Infinite hash function $h:\{0,1\}^\omega\to \{0,1\}^*$
    The constant all-zero function seems to fulfill your desired property. Have you asked what you intended?
  • Comment by Joel David Hamkins on Examples of ubiquitous objects that are hard to find?
    @none Yes, that seems to be exactly the same idea.
  • Comment by Joel David Hamkins on Is every nowhere dense closed set contained in the boundary of a regular open set?
    @ChayimLowen I had been worried about both objections, but I see now how the other objection is resolved.
  • Comment by Joel David Hamkins on Is every nowhere dense closed set contained in the boundary of a regular open set?
    I don't see that the proof of the claim works, even for the suggested modification. Suppose for example $X$ consists of a rapidly converging sequence, with its limit. The $1/i$ requirement is too lax to obtain the "exactly $X$" claim, since I could choose $c_i$ quite freely in this event.

Meta

  • Log in
  • Entries feed
  • Comments feed
  • WordPress.org

Subscribe to receive update notifications by email.

Tags

  • absoluteness
  • bi-interpretation
  • buttons+switches
  • CH
  • chess
  • computability
  • continuum hypothesis
  • countable models
  • definability
  • determinacy
  • elementary embeddings
  • forcing
  • forcing axioms
  • games
  • GBC
  • generic multiverse
  • geology
  • HOD
  • indestructibility
  • infinitary computability
  • infinite chess
  • infinite games
  • ITTMs
  • kids
  • KM
  • large cardinals
  • Leibnizian models
  • maximality principle
  • modal logic
  • models of PA
  • multiverse
  • Notre Dame
  • open games
  • Oxford
  • philosophy of mathematics
  • pluralism
  • pointwise definable
  • potentialism
  • PSC-CUNY
  • supercompact
  • truth
  • universal algorithm
  • universal definition
  • universal program
  • Victoria Gitman
Proudly powered by WordPress