Joel David Hamkins jdh.hamkins.org

The hierarchy of consistency strengths for membership in a computably enumerable set, Oxford Logic Seminar, May 2025

jdh.hamkins.org·58w

Introduction to modal model theory, Panglobal Algebra and Logic Seminar, Boulder, March 2025

jdh.hamkins.org·62w

2025 William Reinhardt Memorial Lecture, Boulder

jdh.hamkins.org·62w

On Skolem’s paradox and the transitive submodel theorem, Rust Belt Workshop in the Philosophy of Logic, Language, and Mathematics, February 2025

jdh.hamkins.org·67w

The covering reflection principle – Oberwolfach January 2025

jdh.hamkins.org·68w

The Human Podcast: 10 questions in 10 minutes

jdh.hamkins.org·70w

Every worldly cardinal admits a Gödel-Bernays structure

jdh.hamkins.org·74w

The computable surreal numbers, Notre Dame Logic Seminar, December 2024

jdh.hamkins.org·76w

Determinateness of truth does not come for free from determinateness of objects, Singapore, November 2024

jdh.hamkins.org·83w

The covering reflection theorem, Madison Logic Seminar, October 2024

jdh.hamkins.org·83w

Infinite-time computable analogues of the universal algorithm, Generalized Computability Theory Workshop, Spain, August 2024

jdh.hamkins.org·91w

How we might have viewed the continuum hypothesis as a fundamental axiom necessary for mathematics, Oxford Phil Maths seminar, May 2025

jdh.hamkins.org·95w

Log in to enable infinite scrolling