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:

  • Click to share on X (Opens in new window) X
  • Click to share on Facebook (Opens in new window) Facebook
  • Click to share on Reddit (Opens in new window) Reddit
  • Click to share on WhatsApp (Opens in new window) WhatsApp
  • Click to email a link to a friend (Opens in new window) Email
  • Click to print (Opens in new window) Print
  • More
  • Click to share on LinkedIn (Opens in new window) LinkedIn
  • Click to share on Tumblr (Opens in new window) Tumblr
  • Click to share on Pocket (Opens in new window) Pocket
  • Click to 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:

  • Click to share on X (Opens in new window) X
  • Click to share on Facebook (Opens in new window) Facebook
  • Click to share on Reddit (Opens in new window) Reddit
  • Click to share on WhatsApp (Opens in new window) WhatsApp
  • Click to email a link to a friend (Opens in new window) Email
  • Click to print (Opens in new window) Print
  • More
  • Click to share on LinkedIn (Opens in new window) LinkedIn
  • Click to share on Tumblr (Opens in new window) Tumblr
  • Click to share on Pocket (Opens in new window) Pocket
  • Click to 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

The tactical variation of the fundamental theorem

We prove the tactical variation of the fundamental theorem of finite gamesβ€”for finite games with sufficiently rich board positions, one of the players has a winning tactic or both have drawing tactics

Joel David Hamkins
Aug 10
5
2
Tactics versus strategies in the theory of games

How do tactics differ from strategies? Does the fundamental theorem of finite games hold for tactics? Must every finite game have a winning tactic for one player or drawing tactics for both?

Joel David Hamkins
Aug 3
10
6
The curvature of space

An excerpt from Lectures on the Philosophy of Mathematics

Joel David Hamkins
Jul 27
13
Proof and the Art of Mathematics, MIT Press, 2020

Buy Me a Coffee

Recent Comments

  • Lecture series on the philosophy of mathematics | Joel David Hamkins on Lectures on the Philosophy of Mathematics
  • How the continuum hypothesis might have been a fundamental axiom, Lanzhou China, July 2025 | Joel David Hamkins on How the continuum hypothesis could have been a fundamental axiom
  • Joel David Hamkins on Lectures on Set Theory, Beijing, June 2025
  • Joel David Hamkins on Lectures on Set Theory, Beijing, June 2025
  • Mohammad Golshani on Lectures on Set Theory, Beijing, June 2025

JDH on Twitter

My Tweets

RSS Mathoverflow activity

  • Comment by Joel David Hamkins on Algorithms to count restricted injections
    Have you mixed up 𝑛 and π‘š in the beginning? You have 𝑓⁑(π‘Ž), where π‘Ž is from {1,…,π‘š}, but the domain of 𝑓 is said to be {1,…,𝑛}. If $n
  • Comment by Joel David Hamkins on Terminology: commonly used name for an πœ” machine?
    Of course ultimately the computational power has nothing to do with fitting the computation into finite time, but rather just the idea of making sense of a computation with infinitely many steps. So you may be interested in the BΓΌchi automata (en.wikipedia.org/wiki/B%C3%BCchi_automaton), and beyond this, the infinite time Turing machines (jstor.org/stable/2586556), which extend the operation […]
  • Comment by Joel David Hamkins on Is this theory of bottomless hierarchy, consistent?
    Ah, sorry, you had the comma before β†’ not after, namely, βˆƒπ‘¦ ∈𝐴 :πœ™, β†’.
  • Comment by Joel David Hamkins on Is this theory of bottomless hierarchy, consistent?
    I confess that I have long been a little confused by your manner of using colons and commas in formal expressions, since it is different from what I am used to in first-order logic or in type theory. For example, how am I to read the meaning of "βˆƒπ‘¦ ∈𝐴 :πœ™ β†’,"? And how are we […]
  • Comment by Joel David Hamkins on Is every external downshifting elementary embedding 𝑗 with 𝑗⁑(π‘₯) =𝑗⁑[π‘₯], an automorphism?
    Ah, yes, of course. Thanks!
  • Answer by Joel David Hamkins for About forcing method
    Yes, part of your perspective is correctβ€”we can make sense of forcing over any model of set theory. We can in effect internalize the concepts of forcing and express everything we need inside ZFC rather than in the metatheory. The assertion of "πœ‘ is forceable", meaning that it is true in some forcing extension, is […]
  • Comment by Joel David Hamkins on Is it possible to transform a statement of unsolvabilty to an equivalent one by using a bounded universal quantifier
    OK, I have posted the argument I had in mind for the multi-variable case.
  • Answer by Joel David Hamkins for Is it possible to transform a statement of unsolvabilty to an equivalent one by using a bounded universal quantifier
    Let me answer negatively for the case where the polynomial 𝑝 is a polynomial in several variables 𝑝⁑(π‘₯1,…,π‘₯𝑛) over the integers. To begin, for any given program π‘ž, consider the c.e. set πΈπ‘ž that undertakes the algorithm of checking whether π‘žβ‘(0) halts, then whether π‘žβ‘(1) halts, then whether π‘žβ‘(2) halts, and so forth, and each […]

Meta

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

Subscribe to receive update notifications by email.

Tags

  • absoluteness
  • buttons+switches
  • CH
  • chess
  • computability
  • continuum hypothesis
  • countable models
  • definability
  • determinacy
  • elementary embeddings
  • forcing
  • forcing axioms
  • games
  • GBC
  • generic multiverse
  • geology
  • ground axiom
  • HOD
  • hypnagogic digraph
  • indestructibility
  • infinitary computability
  • infinite chess
  • infinite games
  • ITTMs
  • kids
  • KM
  • large cardinals
  • Leibnizian models
  • maximality principle
  • modal logic
  • models of PA
  • multiverse
  • 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
Buy Me A Coffee