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: Saharon Shelah

Superdestructibility: a dual to Laver's indestructibility

Posted on September 25, 2011 by Joel David Hamkins
1

[bibtex key=HamkinsShelah98:Dual]

After small forcing, any <𝜅-closed forcing will destroy the supercompactness, even the strong compactness, of 𝜅.

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 Publications | Tagged approximation-and-cover, forcing, indestructibility, large cardinals, Saharon Shelah, supercompact | 1 Reply

Infinitely More

Tactics versus strategies—the case of chess

Does chess admit of winning or drawing tactics? Which information exactly do we need to include as part of the board position?

Joel David Hamkins
Aug 17
8
6
The tactical variation of the fundamental theorem

We prove the tactical variation of the fundamental theorem of finite games—for finite games with sufficiently rich board positions, one of the players has a winning tactic or both have drawing tactics

Joel David Hamkins
Aug 10
6
2
Tactics versus strategies in the theory of games

How do tactics differ from strategies? Does the fundamental theorem of finite games hold for tactics? Must every finite game have a winning tactic for one player or drawing tactics for both?

Joel David Hamkins
Aug 3
12
6
Proof and the Art of Mathematics, MIT Press, 2020

Buy Me a Coffee

Recent Comments

  • Joseph Shipman on The elementary theory of surreal arithmetic is bi-interpretable with set theory, Kobe, Japan, September 2025
  • Joseph Shipman on The elementary theory of surreal arithmetic is bi-interpretable with set theory, Kobe, Japan, September 2025
  • Did Turing ever halt? HPS Colloquium, Notre Dame, October 2025 | Joel David Hamkins on Did Turing prove the undecidability of the halting problem?
  • Lecture series on the philosophy of mathematics | Joel David Hamkins on Lectures on the Philosophy of Mathematics
  • How the continuum hypothesis might have been a fundamental axiom, Lanzhou China, July 2025 | Joel David Hamkins on How the continuum hypothesis could have been a fundamental axiom

JDH on Twitter

My Tweets

RSS Mathoverflow activity

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
  • 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
Buy Me A Coffee