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: Sean Carroll

Puzzles of reality and infinity, Mindscape Podcast

Posted on July 15, 2024 by Joel David Hamkins
Reply

I was interviewed by Sean Carroll for his Mindscape Podcast, broadcast 15 July 2024.

282 | Joel David Hamkins on Puzzles of Reality and Infinity

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, Videos | Tagged Gödel, incompleteness, Mindscape, multiverse, philosophy of mathematics, Sean Carroll | Leave a reply

Infinitely More

Proof and the Art of Mathematics, MIT Press, 2020

Buy Me a Coffee

Recent Comments

  • Joel David Hamkins on Alternative Fields Medal, awarded August 2026
  • Joel David Hamkins on Set-theoretic mereology as a foundation of mathematics? Shandong University, Workshop on Mereology, China, June 2026
  • Christian Oppel on Alternative Fields Medal, awarded August 2026
  • Christian Oppel on Set-theoretic mereology as a foundation of mathematics? Shandong University, Workshop on Mereology, China, June 2026
  • BodaciousTattvas on Set-theoretic mereology as a foundation of mathematics? Shandong University, Workshop on Mereology, China, June 2026

JDH on Twitter

My Tweets

RSS Mathoverflow activity

  • 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.
  • Answer by Joel David Hamkins for Examples of ubiquitous objects that are hard to find?
    For each natural number $k$, almost all finite strings have a Kolmogorov complexity at least $k$, that is, they are not the output result of a program of size less than $k$. But in light of the Chaitin incompleteness theorem, for all sufficiently large values of $k$, and indeed beginning with comparatively small values of […]
  • Comment by Joel David Hamkins on Examples of ubiquitous objects that are hard to find?
    Sure. Or "arithmetic", "projective", "Borel". There are many degrees of complexity and definability.
  • Comment by Joel David Hamkins on How many subsets of $\omega^\omega$ are isomorphic to $\omega^\omega$?
    @bof The notation $\omega^\omega$ is also commonly used the way Dominic is using it. This is a standard notation for Baire space.

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