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

  • Joel David Hamkins on The spectrum of consistency strengths for membership in a computably enumerable set, Notre Dame Logic Seminar, April 2026
  • barcodegenerate on Infinite Sudoku and the Sudoku game
  • Jack Tisdell on The spectrum of consistency strengths for membership in a computably enumerable set, Notre Dame Logic Seminar, April 2026
  • Joel David Hamkins on Comment Board
  • Edgar Graham on Did Turing prove the undecidability of the halting problem?

JDH on Twitter

My Tweets

RSS Mathoverflow activity

  • Comment by Joel David Hamkins on Transcendence degree of the surreals over the subfield generated by the ordinals
    I would appreciate fuller explanation of this answer, if it would be possible.
  • Comment by Joel David Hamkins on Are there substantive differences between the different approaches to "size issues" in category theory?
    @JoeLamond You say it is reflexive if $\kappa$ is small, but the link you provided said it is reflexive only if $\kappa$ is small. Those are not the same, so I am not sure what the true state is. But also, neither of those statements state whether there is a universal claim to be made. […]
  • Comment by Joel David Hamkins on Forcing with strong binary trees
    Can one implement the fusion arguments? It seems delicate to enforce the strong splitting requirement...
  • Comment by Joel David Hamkins on Interpretability and relative consistency with Kolmogorov randomness axioms
    Can you tell us what is $R$?
  • Comment by Joel David Hamkins on What tools are there, apart from using the countable chain condition, to show that forcing preserves cardinals?
    Perhaps someone should collect the various ideas in the comments and post an answer? I think the site works better when answers are posted as answers.
  • Comment by Joel David Hamkins on What tools are there, apart from using the countable chain condition, to show that forcing preserves cardinals?
    In case you are not aware, the generalized Delta-system lemma (theorem 9.19 in Jech) is extremely useful for proving instances of $\delta$-c.c. for higher cardinals, including your case. Also, an often useful variation of closure would be strategic closure, which shows that no new sequences of a certain length over the ground model are added, […]
  • Comment by Joel David Hamkins on Full name (in the sense of forcing) for a partial order
    This is also possible, since we can mix the names $\tau$ that I had used, with condition $p$, with the name $1_\pi$ having value $\neg p$. That was my first idea, actually, but I realized this complication was not needed for the version of fullness you had stated.
  • Answer by Joel David Hamkins for Full name (in the sense of forcing) for a partial order
    Suppose that we have a $\newcommand\P{\mathbb{P}}\P$-name of a partial order $\langle\pi,\leq_\pi,1_\pi\rangle$. So it is forced that this is a partial order and also that $1_\pi\in\pi$. Let $\pi'$ consist of all nice names $\tau$ for elements of $\pi$. These are the names $\tau$ for which there is a condition $p$ and maximal antichain of conditions $r\leq […]

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