It seems we can’t find what you’re looking for. Perhaps searching, or one of the links below, can help.
Recent Posts
- Gödel incompleteness, graduate course, Notre Dame, Fall 2024
- Failing definite descriptions, Notre Dame Food for Thought Seminar, March 2024
- How the continuum hypothesis could have been a fundamental axiom, UC Irvine Logic & Philosoph of Science Colloquium, March 2024
- What if your potentialism is implicitly actualist? Oxford conference, March 2024
- The covering reflection principle, Notre Dame Logic Seminar, February 2024
- The Gödel incompleteness phenomenon, interview with Rahul Sam
- Pluralism in the foundations of mathematics, ASL invited address, joint APA/ASL meeting, New York, January 2024
- The computable model theory of forcing, Rutgers Logic Seminar, December 2023
- The Wordle and Absurdle numbers, CUNY Logic Workshop, November 2023
- What is second-order predicate modal logic? FoMoLo Seminar, February 2024
Most Used Categories
- Talks (198)
- Publications (139)
- Exposition (87)
- Videos (30)
- Math for Kids (29)
- Grants and Awards (28)
- Students (22)
- Teaching (17)
- Asides (15)
- Appointments (14)
Archives
Try looking in the monthly archives. 🙂
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