Infinite Hex is a draw

  • J. D. Hamkins and D. Leonessi, “Infinite Hex is a draw,” Mathematics arXiv, 2022.
    [Bibtex]
    @ARTICLE{HamkinsLeonessi:Infinite-Hex-is-a-draw,
    author = {Joel David Hamkins and Davide Leonessi},
    title = {Infinite Hex is a draw},
    journal = {Mathematics arXiv},
    year = {2022},
    volume = {},
    number = {},
    pages = {},
    month = {},
    note = {Under review},
    abstract = {},
    keywords = {under-review},
    source = {},
    doi = {},
    eprint = {2201.06475},
    archivePrefix = {arXiv},
    primaryClass = {math.LO},
    url = {http://jdh.hamkins.org/infinite-hex-is-a-draw},
    }

Download the article at https://arxiv.org/abs/2201.06475.

Abstract. We introduce the game of infinite Hex, extending the familiar finite game to natural play on the infinite hexagonal lattice. Whereas the finite game is a win for the first player, we prove in contrast that infinite Hex is a draw—both players have drawing strategies. Meanwhile, the transfinite game-value phenomenon, now abundantly exhibited in infinite chess and infinite draughts, regrettably does not arise in infinite Hex; only finite game values occur. Indeed, every game-valued position in infinite Hex is intrinsically local, meaning that winning play depends only on a fixed finite region of the board. This latter fact is proved under very general hypotheses, establishing the conclusion for all simple stone-placing games.

This is my second joint project with Davide Leonessi, the first being our work on Transfinite games values in infinite draughts, both projects growing out of his work on his MSc in MFoCS at Oxford, for which he earned a distinction in September 2021.

Here is a convenient online Hex player, for those who want to improve their game: http://www.lutanho.net/play/hex.html.

The model theory of set-theoretic mereology, Notre Dame Math Logic Seminar, January 2022

This will be a talk for the Mathematical Logic Seminar at the University of Notre Dame on 8 February 2022 at 2 pm in 125 Hayes Healy.

Abstract. Mereology, the study of the relation of part to whole, is often contrasted with set theory and its membership relation, the relation of element to set. Whereas set theory has found comparative success in the foundation of mathematics, since the time of Cantor, Zermelo and Hilbert, mereology is strangely absent. Can a set-theoretic mereology, based upon the set-theoretic inclusion relation ⊆ rather than the element-of relation ∈, serve as a foundation of mathematics? How well is a model of set theory ⟨M,∈⟩ captured by its mereological reduct ⟨M,⊆⟩? In short, how much set theory does set-theoretic mereology know? In this talk, I shall present results on the model theory of set-theoretic mereology that lead broadly to negative answers to these questions and explain why mereology has not been successful as a foundation of mathematics. (Joint work with Makoto Kikuchi)

See the research papers:

  • Set-theoretic mereology
    • [DOI] J. D. Hamkins and M. Kikuchi, “Set-theoretic mereology,” Logic and Logical Philosophy, Special issue “Mereology and beyond, part II”, vol. 25, iss. 3, p. 285–308, 2016.
      [Bibtex]
      @ARTICLE{HamkinsKikuchi2016:Set-theoreticMereology,
      author = {Joel David Hamkins and Makoto Kikuchi},
      title = {Set-theoretic mereology},
      journal = {Logic and Logical Philosophy, Special issue ``Mereology and beyond, part II''},
      editor = {A.~C.~Varzi and R.~Gruszczy{\'n}ski},
      year = {2016},
      volume = {25},
      number = {3},
      pages = {285--308},
      month = {},
      doi = {10.12775/LLP.2016.007},
      note = {},
      eprint = {1601.06593},
      archivePrefix = {arXiv},
      primaryClass = {math.LO},
      url = {http://jdh.hamkins.org/set-theoretic-mereology},
      abstract = {},
      keywords = {},
      source = {},
      ISSN = {1425-3305},
      MRCLASS = {03A05 (03E70)},
      MRNUMBER = {3546211},
      }
  • The inclusion relations of the countable models of set theory are all isomorphic
    • J. D. Hamkins and M. Kikuchi, “The inclusion relations of the countable models of set theory are all isomorphic,” ArXiv e-prints, 2017.
      [Bibtex]
      @ARTICLE{HamkinsKikuchi:The-inclusion-relations-of-the-countable-models-of-set-theory-are-all-isomorphic,
      author = {Joel David Hamkins and Makoto Kikuchi},
      title = {The inclusion relations of the countable models of set theory are all isomorphic},
      journal = {ArXiv e-prints},
      editor = {},
      year = {2017},
      volume = {},
      number = {},
      pages = {},
      month = {},
      doi = {},
      note = {Manuscript under review},
      eprint = {1704.04480},
      archivePrefix = {arXiv},
      primaryClass = {math.LO},
      url = {http://jdh.hamkins.org/inclusion-relations-are-all-isomorphic},
      abstract = {},
      keywords = {under-review},
      source = {},
      }

Bi-interpretation in set theory, Oberwolfach Set Theory Conference, January 2022

This was a talk for the 2022 Set Theory Conference at Oberwolfach, which was a hybrid of in-person talks and online talks on account of the Covid pandemic. I gave my talk online 10 January 2022.

Abstract: Set theory exhibits a truly robust mutual interpretability phenomenon: in any model of one set theory we can define models of diverse other set theories and vice versa. In any model of ZFC, we can define models of ZFC + GCH and also of ZFC + ¬CH and so on in hundreds of cases. And yet, it turns out, in no instance do these mutual interpretations rise to the level of bi-interpretation. Ali Enayat proved that distinct theories extending ZF are never bi-interpretable, and models of ZF are bi-interpretable only when they are isomorphic. So there is no nontrivial bi-interpretation phenomenon in set theory at the level of ZF or above.  Nevertheless, for natural weaker set theories, we prove, including ZFC- without power set and Zermelo set theory Z, there are nontrivial instances of bi-interpretation. Specifically, there are well-founded models of ZFC- that are bi-interpretable, but not isomorphic—even $\langle H_{\omega_1},\in\rangle$ and $\langle H_{\omega_2},\in\rangle$ can be bi-interpretable—and there are distinct bi-interpretable theories extending ZFC-. Similarly, using a construction of Mathias, we prove that every model of ZF is bi-interpretable with a model of Zermelo set theory in which the replacement axiom fails. This is joint work with Alfredo Roque Freire.

Philosophy of Mathematics, Notre Dame Spring 2022

Philosophy of Mathematics
43906 01 (31349)

43906 02 (32481) – Reserved for Glynn Honors Program
Joel David Hamkins, Professor of Philosophy and Mathematics
3:30-4:45 TR, DeBartolo Hall 301
Cross-listed with MATH 40920 01

This series of self-contained seminar lectures on the philosophy of mathematics is intended for students in philosophy and mathematics. The lectures will be organized loosely around mathematical themes, in such a way that brings various philosophical issues naturally to light.

O’Hara Professor of Philosophy and Mathematics, University of Notre Dame

I have now taken up a position at the University of Notre Dame as the O’Hara Professor of Philosophy and Mathematics, beginning January 2022.

My appointment is with the Department of Philosophy with an affiliation with the Department of Mathematics. I expect to be teaching and working with students both in philosophy and mathematics.

Notre Dame offers a unique joint PhD degree program between mathematics and philosophy, the program in logic and the foundations of mathematics. For Notre Dame undergraduates of any major, I encourage you to consider the mathematical philosophy minor.

Notre Dame has strong research groups in logic in both philosophy and mathematics. In philosophy, Notre Dame recently came out very well in the speciality PGR rankings in philosophy of mathematics (#2, tied with NYU, Princeton, behind Harvard), mathematical logic (#2 tied with CMU, behind Harvard), and philosophical logic (group 2). In mathematics, Notre Dame has a strong research group in mathematical logic.

Coming to Agreement, a logic puzzle for Oxford admissions interviews

Let me dive right in with the main puzzle.

Main puzzle. You are a contestant on a game show, known for having perfectly logical contestants. There is another contestant, whom you’ve never met, but whom you can count on to be perfectly logical, just as logical as you are.

The game is cooperative, so either you will both win or both lose, together. Imagine the stakes are very high—perhaps life and death. You and your partner are separated from one another, in different rooms. The game proceeds in turns—round 1, round 2, round 3, as many as desired to implement your strategy.

On each round, each contestant may choose either to end the game and announce a color (any color) to the game host or to send a message (any kind of message) to their partner contestant, to be received before the next round. Messages are sent simultaneously, crossing in transit.

You win the game if on some round both players opt to end the game and announce a color to the host and furthermore they do so with exactly the same color. That is, you win if you both halt the game on the same round with the same color. lf only one player announces a color, or if both do but the colors don’t match, then the game is over, but you have lost.

Round 1 is about to begin. What do you do?

Before getting to solutions, I should also like to mention several variations of the puzzle.

Alternation variation. In this variation of the puzzle, the contestants alternate in their right to send messages—only contestant 1 can send on round 1, then contestant 2 on round 2 and so forth, but still they aim to announce the same color on a round. You are contestant 1—what do you do?

Collision variation. In this variation, players may opt on each round either to end the game and announce a color, to send a message, or to do nothing. But the new thing is that if both players opt to send a message, then the messages collide and are not delivered, although an error message is generated (so the players know what happened). What do you do?

Pigeon variation. This version is like the alternating turn variation, except that now the contestants are separated at much greater distance, and the messages are sent by carrier pigeon, so neither can be sure that the messages actually arrive. You are contestant 1—what do you do?

Post your solutions in the comments! Please do so before reading the rest of this post, and then come back to read more. There are lively discussions occuring on the Twitter thread about this puzzle, on Hacker News, on www.reddit/r/mathriddles, and on www.reddit/r/philosophy.

—————————–

We had used these puzzles in our admissions interviews of candidates for a place at Oxford University in the degree courses Math/philosophy, CS/philosophy, and PPE at University College, Oxford. The candidates were high-school students, mostly 17 years old, having made the interview shortlist on the basis of the rest of their applications, including A-level scores, university entrance exam, essay, and recommendations (all considered in light of relative advantage/disadvantage). The interviews were an in-depth back-and-forth discussion, as much as could be had in about 25 minutes. These interviews, of course, are just one component among many in regard to the difficult admissions decision, a chance for the candidate to show us how they think through a problem, how well they can explain their ideas, how well they take hints and suggestions. In every interview, we had paused at a certain stage, when the candidate had a fully formed argument for one of the variations, and asked them to undertake an integrative exercise, summarizing as clearly as they could the entire problem and solution and how they expected it to play out. Since these were interviews for joint philosophy degrees, in my view this step was a key part of the interview, measuring the ability of the candidate to integrate what they had learned from the discussion and to present a complete, coherent argument.

Several of these puzzles are rather open-ended, not necessarily with a clear-cut objectively correct answer, although there are certain important issues that arise and that we had hoped the candidates would realize. So let me now discuss the puzzles in detail and the aspects of them that I find interesting.

For the main puzzle, it seems clear that one should not announce a color to the host straight away in round 1, because it seems not likely enough that the other contestant would also do so with exactly the same color. Rather, one should use the messaging capability somehow to agree on the color and round number on which to end the game. We should only announce, if we have both clearly expressed a plan to announce a specific color on a specific round.

At first, it might seem reasonable to send a message along the lines of “Let’s both announce red on round 3; please confirm in round 2.” The hope would be that the other player would indeed confirm on round 2, and then both would announce the final color of red on round 3.

That idea would work, if we were taking turns in sending messages, as in the alternation version of the puzzle. But in the main puzzle, the players are sending their messages simultaneously, and there is a difficulty for the previous proposal that can be realized by considering what kind of message we might expect to be receiving from our partner on round 1. Namely, perhaps they had a similar idea. It would be a lucky case indeed, if they had had exactly the same idea, also proposing to announce red in round 3. In that event, we would both confirm in round 2 and win with red in round 3.

But a more problematic case would occur if our partner had had a very similar idea, but happened to have made the proposal with a different color. Perhaps in round 1 our partner would have sent the message, “Let’s both announce blue on round 3; please confirm in round 2.” What shall we do then in round 2? If I decide to try to stick with my original red color, I might say, “Let’s use red in round 3”, then the other player might similarly decide to stick with blue, and we would still be at an impasse. Alternatively, if I decide to defer and switch to blue, perhaps they also defer and switch to red. What is clear is that we can’t be sure of confirming on the same color in round 2, and clearly we shouldn’t announce in round 3 with the color choice still unsettled. So the procedure we have discussed so far seems unsuitable.

A deeper contemplation of the problem reveals that this issue of the other contestant doing something very similar, but perhaps with a different color, is a fundamental obstacle to many solution attempts. There is a fundamental symmetry in play between the contestants. Since the messages are sent and received at the same time, and both players are equally logical, it could be that we both end up sending the same kind of message each time, except with different colors. We need somehow to agree on a color and a round number, but it seems that however we decide to make a proposal, it would be equally logical for our partner to make a similar proposal, but with colors permuted somehow.

We seem to need to break the symmetry somehow. Perhaps one might hope to use the alphabetically least color, amongst the two colors that have been proposed so far. That would seem to be a perfectly reasonable way to break the symmetry. But the problem here is that there are also many other perfectly reasonable ways to break the symmetry—the shortest wavelength color, the shorter color word, the color proposed by the younger person, by the older person, and so on. The difficulty is that any given proposal might be faced with a similar but equally reasonable proposal about how to break the symmetry. If I had proposed one such criterion, perhaps my partner proposes another, and we haven’t made any progress, but rather only replaced the difficulty of agreeing on the color with the difficulty of agreeing on the decision criterion of how to decide.

A key insight comes with the idea to use randomness. Suppose I had said in round 1, “I suggest we both announce red next round; I shall do so, if you also suggest this,” but you had said, “I suggest we both announce blue next round; I shall do so, if you also suggest this.” But I have got a coin in my pocket, and from now on, I intend each round to flip the coin, sending the red message on heads and the blue message on tails. If you do likewise, then we are very likely in a few rounds to hit upon the same message, and then we shall win on the next round by following through, announcing the agreed-upon color. That is, if in the first round we each happen to mention a color (whether or not my partner’s message was of the specific form I had mentioned), then I am going on every round to send a message as above, but using one of the two colors randomly. If you logically also choose to do this, then we are very likely to happen to choose the same color on some round eventually, and then win on the following round. This randomzing strategy thus seems fairly sound as a means to come to agreement, and if the partner also realizes this we should expect to win quickly, in just a few rounds with high likelihood. For this reason, I find this to be the best strategy.

A slightly more abstract way to describe the strategy I am proposing is that the symmetry between the players will need to be broken by us agreeing which of us will be leading the process and which of us will follow. I can flip a coin each round to decide if I should try to be leader or follower on that round. On heads, I shall propose a specific plan, “let’s say red next round, if your message indicates that you will follow my suggestion.” On tails, I shall send a message saying, “I am going to follow your plan of action, if you send one this round.” In this way, we are likely in a few rounds to have established a leader and follower, and win shortly afterward.

Some student candidates and commentators had proposed an interesting idea of trying to blend the two colors. This would be a way of coming to an agreement, but without needing to break the symmetry between the players. If I had proposed initially that we should announce red and you had proposed blue, then the idea is that logically we should both try to average these colors and say purple. I like this idea a lot, but it seems problematic in light of the fact that we don’t have such a clear and unambiguous means of combining colors. For example, should we mix the colors in the manner of mixing paint or rather in the manner of mixing colored light, which produces completely different results? Even when mixing red+blue, I might say purple and you might say violet. And what of stranger color combinations, such as orange+green? If we were using rgb colors, then some colors are simply adjacent in the color space (or an even distance away), and so they have no exact average mixing. Furthermore, why should we use rgb rather than cmyk or another color space system? And color mixing does not work identically for these two systems. For these reasons, I find the color mixing idea ultimately less than completely successful.

The alternation variation of the puzzle admits an easy solution, since the symmetry is broken already by the rules of the game. Player 1 will be the first to send a message, and can simply say, “I shall announce red on round 2; if you do so as well then we shall win.” There would be no reason for player 2 not to follow along, and so the players can expect to win on round 2.

Some candidates had suggested a confirmation round, having player 1 say, “let’s say red on round 3, confirm if that is agreeable.” Then both players would confirm the intention on round 2, and win on round 3. This is also successful, but it seems to me that the confirmation step is not strictly needed.

The collision variation is an interesting hybrid, because although there is a symmetry between the players in terms of how the rules apply to them, the symmetry is broken in the event that one sends a message and the other does not. The best solution here seems to be a random solution. Namely, flip a coin to decide whether to send a message or stay silent. On heads, send the message “Announce red on next round, if this message gets through.” On tails, do nothing, and plan to follow whatever is suggested on the message that might be received. Because of the randomness, it is very likely that in a few rounds a message gets through one way or the other, with a quick win straight afterward.

The pigeon variation is simply a version of the two-generals problem. The first player can try to propose a specific plan, naming a round and color, and ask for confirmation. But the confirmation itself will need to be confirmed, if the other player is to want certainty. But in this case the confirmation of the confirmation will need to be confirmed, and so on ad infinitum. No finite number of confirmations of receipt will be enough, even if all are received, since if $n$ confirmations suffice to attain mutual certainty, then the last confirmation needn’t be sent, since the protocol would work even if it didn’t arrive, and so $n-1$ should also suffice, a contradiction.

Meanwhile, one can attain very high degree of confidence in the plan. If on round 1 the first player sends the message, “We shall say red on round 1000, please confirm,” then he might hope it gets through and confirmation received. On each subsequent round, he should send this message again, together with a complete record of all prior messages sent/received. Player 2, if receiving the message on round 1 should simply follow along and send confirmations; but if nothing was received on round 1, he should not start a competing plan, which would only reintroduce the priority issue of the main puzzle, since the symmetry is already clearly broken for this version with player 1 in the leading role. So if no message was received, player 2 should simply reply with “sorry, no message received; please resend.” Eventually, messages are likely to get through and the two players will be on track to win with high probability. The players should plan on announcing red on round 1000 according to the plan, even if confirmations are missed. One can increase the probability by increasing round 1000 to a much higher number, presuming that the players can keep careful track of the round numbers. It would seem to be a mistake ever to try to change the round number or the color after some messages are sent, since perhaps the originals were received and only the cofirmations were missed, and there would be abundant confusion to have two or more plans in play.

In the admissions interviews, which were generally less than 25 minutes, we were happy if a candidate got to the realization of the symmetry issue in the main puzzle, before going on to the alternating version, which most students got quickly, and then the collision version, where the randomness idea seemed to arise more naturally. The best candidates were then able to realize how to apply the randomness idea to the main version. With the pigeon version of the puzzle, successful candidates realized the need to achieve confirmation and confirmation of confirmation, and a few put this together to mount the impossibility argument for the case of certainty, and most realized how to increase the likelihood of success by picking a distant round and repeating messages. It was quite enjoyable for me to discuss these problems with so many very sharp student candidates.

Let me close by mentioning a few observations that surprised me about using the puzzles in an interview setting.

The first observation is the remarkable amount of personality that was revealed by the candidate’s choices in the puzzles. Some candidates tended to follow what might be called a leader’s approach (or the bully strategy?), attempting in the main puzzle to achieve agreement by conveying obstinateness in the color choice, to convince the other person to change sides as a way of coming to agreement. An equal number of other candidates tried instead to be deferential, sending messages that they would agree to use whichever color the other person wanted. Of course, each of these strategies works fine when paired with the other, but when paired with exactly the same personality, the methods face the symmetry problem we discussed earlier. Some brilliant candidates pointed out that the role that these personality differences played in the puzzle—it was very unlikely that the two contestants would be perfectly balanced in their personalities, and so the symmetry would be broken simply because one candidate would be slightly more insistent or slightly more deferential. And I have to say that realistically, this is how the puzzle would actually be solved in practice.

Another observation was that the candidates overwhelmingly chose red as their color, whenever they mentioned a specific color. About 2/3 or more did so. Far behind this was blue, in second place, and then we had a very small number of mentions of orange, green, yellow, and black.

I really enjoyed using this puzzle for the interviews, and I feel it helped us to choose a really great incoming class.

Art by Erin Carmody.

The hierarchy of geometric constructibility: can we go back?

I have recently become interested in the hierarchy of relative constructibility in geometry (see the discussion on my Twitter thread). From a given collection of points in the plane, we may proceed to construct other points using the classical tools of straightedge and compass. This induces a hierarchy of relative constructiblity, namely, for any two sets of points $X$ and $Y$ in the plane, we may say that $X$ is constructible from $Y$, written as $$X\trianglelefteq Y$$ if for every point $A\in X$, there is a construction procedure using only straightedge and compass proceeding from points in $Y$ and constructing $A$. And so we are faced with a hierarchy of constructibility.

Perhaps one might ask immediately whether this is genuinely a hierarchy. A central case occurs with pairs of points, since one often proceeds in geometry with the idea of a unit segment having already been fixed.

Question 1. Given two distinct points A and B, suppose that distinct points C and D are constructible by straightedge and compass. Can we go back? That is, must A and B both be constructible from C and D?

The answer, surprisingly, is Yes! This is a sense in which the relative constructibility notion is an equivalence relation rather than a hierarchy, since it shows that if AB can construct CD, than it is also true conversely. Since constructibility is also transitive, this shows that the relative constructibility is an equivalence relation on pairs of points in the plane.

Before addressing the question, let me first dispense with a distracting line of reasoning that suggests a wrong answer to this question. Suppose that we have a segment AB of length $\sqrt[3]2$, a nonconstructible number. Since the constructible numbers are closed under multiplication, this might suggest that from AB we can construct a segment of length 2, and therefore also construct a segment CD of length 1. But from a segment of length 1, we can never construct a segment of length $\sqrt[3]2$, because the duplication of the cube is impossible. So this would suggest a negative answer to the question. Is it right?

But no, this distracting counter-argument is not correct. The reason is that although the constructible numbers are indeed closed under multiplication, the construction methods requires the consultation of a fixed unit segment. That is, to prove that from a segment of length $a$ and a segment of length $b$ one can construct a segment of length $ab$, we require the use of fixed unit segment of length $1$. Indeed, it will follow from our analysis here that one cannot omit this consultation of a unit segment from the construction—we cannot in general construct the cube of a segment just from the segment itself.

So let me prove the answer to question 1 is positive. Suppose that from distinct points AB we can construct distinct points CD. Performing excactly the same construction process again, but proceeding from points CD as input, we construct points EF. From points CD we can see how CD are related to EF, forming a quadrilateral CDFE.

The point is that we may now construct the points A and B from C and D by simply inverting this similarity. (This was also observed by user @ZenoRogue on Twitter.) Namely, the two quadrilaterals ABDC and CDFE are similar, and so have all the same angles. So the line AC is constructible from CD by the angle ACD, which is the same as CEF, and the distance AC is scaled from CE by the same factor that CD is related to EF. So from CD we can construct this similar quadrilateral, and thereby construct both A and B.

Question 2. Given three distinct points forming a triangle ABC, suppose that we can construct triangle DEF by straightedge and compass. Can we go back? That is, must A,B, and C be constructible from D,E,F?

The question is of course similar to question 1, which had a positive answer. Nevertheless, the answer here is negative. The reason is that the original idea we had with question 1 concerning $\sqrt[3]2$ now works here to refute question 2. Namely, let ABC be a right triangle where AB has length 1 but AC has length $\sqrt[3]2$.

From the triangle ABC, we may easily construct the triangle ABD, where AD has length 1, since in fact the point D is constructible from the segment AB alone. But from ABD, which is a right triangle with both legs of length 1, we shall be unable to construct the number $\sqrt[3]2$, and consequently unable to construct the point C. So although ABD is constructible from ABC, the point C is not constructible from points ABD. This is therefore a counterexample to question 2, which therefore must be answered in the negative.

Another argument, offered by Ed Wagstaff, is that from an angle trisection we can construct the original angle, but we can’t necessarily construct the trisection from the original angle.

Finally, I should like to understand the nature of the relative hierarchy of constructibility better. $$X\trianglelefteq Y$$ What is the nature of relative constructibility of sets of points in the plane? For example, one question I didn’t know how to answer at first is the following:

Question 3. Is the hierarchy of relative constructibility a dense order? That is, if the set $X$ is constructible from $Y$ but not conversely, must there be a set of points $Z$ strictly in between? $$X\lhd Y\quad\implies\quad\exists Z\quad X\lhd Z\lhd Y?$$

In an exchange on Twitter with David Madore, I had thought that we answered the question negatively, but now I am not at all sure of that argument (and thanks to Gabin for the comments below!), and so I have deleted the wrong argument here. Question 3 seems currently to be open.

I have now asked question 3 on MathOverflow: Is the hierarchy of relative geometric constructibility by straightedge and compass a dense order?

The surprising strength of reflection in second-order set theory with abundant urelements, Konstanz, December 2021

This will be talk for the workshop Philosophy of Set Theory held at the University of Konstanz, 3 – 4 December 2021 — in person!

Update: Unfortunately, the workshop has been cancelled (perhaps postponed to next year) in light of the Covid resurgence.

Abstract. I shall analyze the roles and interaction of reflection and urelements in second-order set theory. Second-order reflection already exhibits large cardinal strength even without urelements, but recent work shows that in the presence of abundant urelements, second-order reflection is considerably stronger than might have been expected—at the level of supercompact cardinals. This is joint work with Bokai Yao (Notre Dame).

Infinite draughts and the logic of infinitary games, Oslo, November 2021

This will be a talk 11 November 2021 for the Oslo Seminar in Mathematical Logic, meeting online via Zoom at 10:15am CET (9:15am GMT) at Zoom: 671 7500 0197

Abstract. I shall give an introduction to the logic of infinite games, including the theory of transfinite game values, using the case of infinite draughts as a principal illustrative instance. Infinite draughts, also known as infinite checkers, is played like the finite game, but on an infinite checkerboard stretching without end in all four directions. In recent joint work with Davide Leonessi, we proved that every countable ordinal arises as the game value of a position in infinite draughts. Thus, there are positions from which Red has a winning strategy enabling her to win always in finitely many moves, but the length of play can be completely controlled by Black in a manner as though counting down from a given countable ordinal. This result is optimal for games having countably many options at each move—in short, the omega one of infinite draughts is true omega one.

Transfinite game values in infinite draughts

A joint paper with Davide Leonessi, in which we prove that every countable ordinal arises as the game value of a position in infinite draughts, and this result is optimal for games having countably many options at each move. In short, the omega one of infinite draughts is true omega one.

  • J. D. Hamkins and D. Leonessi, “Transfinite game values in infinite draughts,” Mathematics arXiv, 2021.
    [Bibtex]
    @ARTICLE{HamkinsLeonessi:Transfinite-game-values-in-infinite-draughts,
    author = {Joel David Hamkins and Davide Leonessi},
    title = {Transfinite game values in infinite draughts},
    journal = {Mathematics arXiv},
    year = {2021},
    volume = {},
    number = {},
    pages = {},
    month = {},
    note = {Under review},
    abstract = {},
    keywords = {under-review},
    source = {},
    doi = {},
    eprint = {2111.02053},
    archivePrefix = {arXiv},
    primaryClass = {math.LO},
    url = {http://jdh.hamkins.org/transfinite-game-values-in-infinite-draughts},
    }

Download the paper at arXiv:2111.02053

Abstract. Infinite draughts, or checkers, is played just like the finite game, but on an infinite checkerboard extending without bound in all four directions. We prove that every countable ordinal arises as the game value of a position in infinite draughts. Thus, there are positions from which Red has a winning strategy enabling her to win always in finitely many moves, but the length of play can be completely controlled by Black in a manner as though counting down from a given countable ordinal.

Is the twin prime conjecture independent of Peano Arithmetic?

  • A. Berarducci, A. Fornasiero, and J. D. Hamkins, “Is the twin prime conjecture independent of Peano Arithmetic?,” Mathematics arXiv, 2021.
    [Bibtex]
    @ARTICLE{BerarducciFornasieroHamkins:Is-the-twin-prime-conjecture-independent-of-PA,
    author = {Alessandro Berarducci and Antongiulio Fornasiero and Joel David Hamkins},
    title = {Is the twin prime conjecture independent of Peano Arithmetic?},
    journal = {Mathematics arXiv},
    year = {2021},
    volume = {},
    number = {},
    pages = {},
    month = {},
    note = {Under review},
    abstract = {},
    keywords = {under-review},
    source = {},
    doi = {},
    eprint = {2110.08640},
    archivePrefix = {arXiv},
    primaryClass = {math.LO},
    url = {http://jdh.hamkins.org/is-the-twin-prime-conjecture-independent-of-peano-arithmetic/},
    }

Download the article at arXiv:2110.08640

Abstract. We show that there is an arithmetical formula $\varphi$ such that ZF proves that $\varphi$ is independent of PA and yet, unlike other arithmetical independent statements, the truth value of $\varphi$ cannot at present be established in ZF or in any other trusted metatheory. In fact we can choose an example of such a formula $\varphi$ such that ZF proves that $\varphi$ is equivalent to the twin prime conjecture. We conclude with a discussion of notion of trustworthy theory and a sharper version of the result.

This work grows in part out of an answer I posted on MathOverflow in 2012.

Frege’s philosophy of mathematics—Interview with Nathan Ormond, December 2021

I was interviewed by Nathan Ormond for a discussion on Frege’s philosophy of mathematics for his YouTube channel, Digital Gnosis, on 10 December 2021 at 4pm.

The interview concludes with a public comment and question & answer session.

Davide Leonessi, MSc MFoCS, Oxford, September 2021

Mr. Davide Leonessi successfully defended his dissertation for the Masters of Science degree in Mathematics and Foundations of Computer Science, entitled “Transfinite game values in infinite games,” on 15 September 2021. Davide earned a distinction for his thesis, an outstanding result.

Davide Leonessi | Google scholar | Dissertation | arXiv

Abstract. The object of this study are countably infinite games with perfect information that allow players to choose among arbitrarily many moves in a turn; in particular, we focus on the generalisations of the finite board games of Hex and Draughts.

In Chapter 1 we develop the theory of transfinite ordinal game values for open infinite games following [Evans-Hamkins 2014], and we focus on the properties of the omega one, that is the supremum of the possible game values, of classes of open games; we moreover design the class of climbing-through-$T$ games as a tool to study the omega one of given game classes.

The original contributions of this research are presented in the following two chapters.

In Chapter 2 we prove classical results about finite Hex and present Infinite Hex, a well-defined infinite generalisation of Hex.

We then introduce the class of stone-placing games, which captures the key features of Infinite Hex and further generalises the class of positional games already studied in the literature within the finite setting of Combinatorial Game Theory.

The main result of this research is the characterization of open stone-placing games in terms of the property of essential locality, which leads to the conclusion that the omega one of any class of open stone-placing games is at most $\omega$. In particular, we obtain that the class of open games of Infinite Hex has the smallest infinite omega one, that is $\omega_1^{\rm Hex}=\omega$.

In Chapter 3 we show a dual result; we define the class of games of Infinite Draughts and explicitly construct open games of arbitrarily high game value with the tools of Chapter 1, concluding that the omega one of the class of open games of Infinite Draughts is as high as possible, that is $\omega_1^{\rm Draughts}=\omega_1$.

The full dissertation is available:

A deflationary account of Fregean abstraction in Zermelo-Fraenkel ZF set theory, Oxford, November 2021

This will be a talk for the Oxford Seminar in the Philosophy of Mathematics, 1 November, 4:30-6:30 GMT. The talk will be held on Zoom (contact the seminar organizers for the Zoom link).

Abstract. The standard treatment of sets and classes in Zermelo-Fraenkel set theory instantiates in many respects the Fregean foundational distinction between objects and concepts, for in set theory we commonly take the sets as objects to be considered under the guise of diverse concepts, the definable classes, each serving as a predicate on that domain of individuals. Although it is often asserted that there can be no association of classes with objects in a way that fulfills Frege’s Basic Law V, nevertheless, in the ZF framework I have described, it turns out that Basic Law V does hold, and provably so, along with other various Fregean abstraction principles. These principles are consequences of Zermelo-Fraenkel ZF set theory in the context of all its definable classes. Namely, there is an injective mapping from classes to objects, definable in senses I shall explain, associating every first-order parametrically definable class $F$ with a set object $\varepsilon F$, in such a way that Basic Law V is fulfilled: $$\varepsilon F =\varepsilon G\iff\forall x\ (Fx\leftrightarrow Gx).$$ Russell’s elementary refutation of the general comprehension axiom, therefore, is improperly described as a refutation of Basic Law V itself, but rather refutes Basic Law V only when augmented with powerful class comprehension principles going strictly beyond ZF. The main result leads also to a proof of Tarski’s theorem on the nondefinability of truth as a corollary to Russell’s argument.

My favorite theorem

What a pleasure it was to be interviewed by Evelyn Lamb and Kevin Knudson for their wonderful podcast series, My Favorite Theorem, available on Apple, Spotify, and any number of other aggregators.

I had a chance to talk about one my most favorite theorems, the fundamental theorem of finite games.

Theorem.(Zermelo 1913) In any two-player finite game of perfect information, one of the players has a winning strategy, or both players have drawing strategies.

Listen to the podcast here: My Favorite Theorem. A transcript is also available.