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: Caltech

What is your number? Logic puzzles for mathematicians – 2025 DePrima Memorial Lecture, Caltech

Posted on November 4, 2025 by Joel David Hamkins
Reply

I am honored to be giving the 2025-26 Charles R. DePrima Memorial Lecture for the Mathematics Department of the California Institute of Technology. This lecture series aims to bring mathematical researchers to Caltech to give talks for a primarily undergraduate audience.

This invitation truly gives me a lot of pleasure, first, because Caltech is my alma mater (B.S. Mathematics 1988), but second, because my daughter is currently an undergraduate student at Caltech, majoring in mathematics. So I am looking forward to this talk.

De Prima Lecture Flyer 2025Download

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 axiom of choice, Caltech, epistemic logic, puzzle | Leave a reply

Infinitely More

Proof and the Art of Mathematics, MIT Press, 2020

Buy Me a Coffee

Recent Comments

  • Joel David Hamkins on Cheryl’s Rational Gifts: transfinite epistemic logic puzzle challenge!
  • Connect Master on Cheryl’s Rational Gifts: transfinite epistemic logic puzzle challenge!
  • Jenga Views – Making Your Own Sense on Math for kids: fun with orthoprojections!
  • Joel David Hamkins on Largest-number contest: what is the largest number that you can describe on an index card?
  • Cayden Wood on Largest-number contest: what is the largest number that you can describe on an index card?

JDH on Twitter

My Tweets

RSS Mathoverflow activity

  • Comment by Joel David Hamkins on Fields $\ (\mathbb R\,\ \oplus\, \cdot\,\ 0\ \ 1) $
    It is a nice question. @YCor Why not post your comment as an answer? Perhaps a little more fully sketched...
  • Comment by Joel David Hamkins on Checking topologies of orders and suborders
    @Wojowu I think it would be helpful to post the ideas of the comments as an answer.
  • Comment by Joel David Hamkins on A question on elementary embedding
    Yes, thanks, now edited.
  • Comment by Joel David Hamkins on A question on elementary embedding
    @AliEnayat Good idea. I have now done this.
  • Comment by Joel David Hamkins on A question on elementary embedding
    Here is a way to make it work. Suppose that $\gamma
  • Comment by Joel David Hamkins on Do mathematicians have an ethical role to play, regarding the AI bubble?
    I rarely vote to close questions, but I voted to close this question, because I find it polemical. I would regret it if MathOverflow were to become filled with this kind of question, instead of questions about interesting mathematics. Put it on a blog post.
  • Comment by Joel David Hamkins on A question on elementary embedding
    I think the argument is problematic when $0^\sharp$ exists. If the two models are generated by indiscernibles, then whoever has fewer will embed into the other model.
  • Comment by Joel David Hamkins on A question on elementary embedding
    But now I am worried that $\alpha$ is the definable cut in $V_\kappa$, but perhaps not in $L_\kappa$. Perhaps we can fix it by adding those countably many definable ordinals to $Q$? Hmm.

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