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: Columbia University

A potentialist conception of ultrafinitism, Columbia University, April 2025

Posted on April 6, 2025 by Joel David Hamkins
4


This will be a talk for the conference on Ultrafinitism: Physics, Mathematics, and Philosophy at Columbia University in New York, April 11-13, 2025.

Abstract. I shall argue in various respects that ultrafinitism is fruitfully understood from a potentialist perspective, an approach to the topic that enables certain formal treatments of ultrafinitist ideas, which otherwise often struggle to find satisfactory formalization.

Slides – Ultrafinitism – Columbia 2025 – HamkinsDownload

Handout format, without pauses: Slides – Ultrafinitism – Columbia 2025 – Hamkins – handout

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 Columbia University, potentialism, ultrafinitism | 4 Replies

Infinitely More

Proof and the Art of Mathematics, MIT Press, 2020

Buy Me a Coffee

Recent Comments

  • 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
  • Jack Edward Tisdell on Lectures on Set Theory, Beijing, June 2025
  • Joel David Hamkins on Skolem’s paradox and the countable transitive submodel theorem, Leeds Set Theory Seminar, May 2025

JDH on Twitter

My Tweets

RSS Mathoverflow activity

  • Comment by Joel David Hamkins on About definition of proper forcing
    Yes, I agree. We just quantify over countable M. Of course, in ZFC when we say that something is true, what we mean is that it is true in the ambient set theoretic realm that the theory is talking about. And that realm can be called V, referring to the current universe under consideration.
  • Answer by Joel David Hamkins for About definition of proper forcing
    Yes, countable in V. Properness of the forcing notion P is something that is verified in the ground model V over which you intend to force.
  • Comment by Joel David Hamkins on References for incompleteness proofs using infinite trees or König's lemma
    Yes, there are diagonal arguments almost everywhere in logic.
  • Comment by Joel David Hamkins on References for incompleteness proofs using infinite trees or König's lemma
    One could object that in order to provide the tree, one must essentially have already proved the undecidability of the halting problem, and then one could prove the incompleteness theorem directly with that, using proofs to decide the halting problem, rather than doing the further work to create the computable tree with no computable branch. […]
  • Answer by Joel David Hamkins for References for incompleteness proofs using infinite trees or König's lemma
    I'm not sure about the particular proof your professor has in mind, but here is a proof using trees and paths-through-trees. First, we prove the classic result in computability theory that there is a computable infinite tree $T\subset 2^{
  • Comment by Joel David Hamkins on Where is the error in this argument against external automorphisms on models of ZFC?
    The two subset orders are isomorphic externally, by j, but there is no reason to think they are isomorphic internally, so M cannot build the map as you say. For example, even just when $j(\alpha)
  • Answer by Joel David Hamkins for Negation of cardinal characteristics
    Let me interpret your question as a request for alternative ways of thinking of the cardinal characteristics and how they relate to one another. From this perspective, the work of Corey Switzer seems relevant. In his dissertation (under my supervision), he proposed to compare the cardinal characteristics not just by comparing the least cardinal sizes […]
  • Comment by Joel David Hamkins on Does the parity obstruction hold for ∈-embeddings?
    ∈-embeddings need not take ordinals to ordinals, so it isn't just a matter of moving an ordinal up or down.

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