•  443
    A simple solution to the hardest logic puzzle ever
    Analysis 68 (2): 105-112. 2008.
    We present the simplest solution ever to 'the hardest logic puzzle ever'. We then modify the puzzle to make it even harder and give a simple solution to the modified puzzle. The final sections investigate exploding god-heads and a two-question solution to the original puzzle.
  •  439
    Dangerous Reference Graphs and Semantic Paradoxes
    with Brian Rabern and Matthew Macauley
    Journal of Philosophical Logic 42 (5): 727-765. 2013.
    The semantic paradoxes are often associated with self-reference or referential circularity. Yablo (Analysis 53(4):251–252, 1993), however, has shown that there are infinitary versions of the paradoxes that do not involve this form of circularity. It remains an open question what relations of reference between collections of sentences afford the structure necessary for paradoxicality. In this essay, we lay the groundwork for a general investigation into the nature of reference structures that sup…Read more
  •  398
    We analyze a solitaire game in which a demon rearranges some cards after each move. The graph edge coloring theorems of K˝onig (1931) and Vizing (1964) follow from the winning strategies developed.
  •  234
    The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open question what relations of reference between collections of sentences afford the structure necessary for paradoxicality -- these are the so-called "dangerous" directed graphs. Building on Rabern, et. al (2013) we reformulate this problem in terms of fixed points of c…Read more