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

NATO Research Grant, 1999 – 2000

Posted on October 1, 1999 by Joel David Hamkins
Reply

I was co-PI on this NATO Collaborative Research grant, organized by Mirna Dzamonja, with Arthur Apter, myself and six others as co-PIs.

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 Grants and Awards | Tagged NATO | Leave a reply

Infinitely More

Proof and the Art of Mathematics, MIT Press, 2020

Buy Me a Coffee

Recent Comments

  • Joel David Hamkins on Infinite Sudoku and the Sudoku game
  • 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

JDH on Twitter

My Tweets

RSS Mathoverflow activity

  • Comment by Joel David Hamkins on Incentivizing mathematics in an era of AI-accelerated proof abundance
    The comment thread seems to have become off-topic. Since Carlson had his entire chess career in the era of strong chess engines, he would seem to make a weak case for the argument that people leave chess because of them. In any case, as I mention above, chess is more popular than ever, at almost […]
  • Comment by Joel David Hamkins on Incentivizing mathematics in an era of AI-accelerated proof abundance
    There are more people working as chess tutors and coaches as there ever have been, even though there are also machine tutors. Similarly, I believe there will always be a place for human mathematicians.
  • Answer by Joel David Hamkins for Incentivizing mathematics in an era of AI-accelerated proof abundance
    Why do we play chess if the machines can play it better? Because it is such a joy to take on the challenge and to figure something out. Why will we study mathematics when the machines can do it as well or better? Because it is a joy to figure something out and to share […]
  • Comment by Joel David Hamkins on When are two proofs of the same theorem really different proofs
    Cantor's proof does construct specific transcendental numbers explicitly. He provides an explicit construction enumerating the algebraic numbers, and then the diagonal construction produces a real number not on that list. And indeed the constructive nature of his proof was important to Cantor in his presentation.
  • Comment by Joel David Hamkins on Borel homomorphism of equivalence relation
    I edited to add the subscript 0 in the second displayed equation, since I think that is what you intended.
  • Comment by Joel David Hamkins on T=ZFC + Con(ZFC), a flawed reasoning process but why
    For a theory to prove that there is a contradiction is not the same as the theory proving a contradiction. This is the content of the second incompleteness theorem.
  • Comment by Joel David Hamkins on If $|\bigcup S|<|S|$, then there is $R\subseteq S$ so that $|\bigcup R|<|R|$ and there exists $\phi:\bigcup R\hookrightarrow R$ with $r\in\phi(r)$
    Clearly, $r\in\bigcup R$, so that $\phi(r)$ makes sense.
  • Comment by Joel David Hamkins on If $|\bigcup S|<|S|$, then there is $R\subseteq S$ so that $|\bigcup R|<|R|$ and there exists $\phi:\bigcup R\hookrightarrow R$ with $r\in\phi(r)$
    It is a very nice problem!

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