Partizan Games in Isabelle/HOLZF
Partizan Games (PGs) were invented by John H. Conway and are described in his book On Numbers and Games. We formalize PGs in Higher Order Logic extended with ZF axioms (HOLZF) using Isabelle, a mechanical proof assistant. We show that PGs can be defined as the unique fixpoint of a function that arises naturally from Conway’s original definition. While the construction of PGs in HOLZF relies heavily on the ZF axioms, operations on PGs are defined on a game type that hides its set theoretic origins. A polymorphic type of sets that are not bigger than ZF sets facilitates this. We formalize the induction principle that Conway uses throughout his proofs about games, and prove its correctness. For these purposes we examine how the notions of well-foundedness in HOL and ZF are related in HOLZF. Finally, games (modulo equality) are added to Isabelle’s numeric types by showing that they are an instance of the axiomatic type class of partially ordered abelian groups.
KeywordsProper Class Induction Principle Game Type Polymorphic Type Modulo Equality
Unable to display preview. Download preview PDF.
- 1.Conway, J.H.: On Numbers And Games, 2nd edn. A K Peters Ltd. (2001)Google Scholar
- 3.Gordon, M.J.C.: Set Theory, Higher Order Logic or Both. In: von Wright, J., Harrison, J., Grundy, J. (eds.) TPHOLs 1996. LNCS, vol. 1125, pp. 190–201. Springer, Heidelberg (1996)Google Scholar
- 4.Agerholm, S.: Formalising a Model of the λ-Calculus in HOL-ST. Technical Report 354, University of Cambridge Computer Laboratory (1994)Google Scholar
- 5.Agerholm, S., Gordon, M.J.C.: Experiments with ZF Set Theory in HOL and Isabelle. Technical Report RS-95-37, BRICS (1995)Google Scholar
- 9.Baader, F., Nipkow, T.: Term Rewriting and All That, Cambridge U.P (1998)Google Scholar
- 12.Paulson, L.C.: Defining Functions on Equivalence Classes. In: ACM Transactions on Computational Logic (in press)Google Scholar
- 14.Obua, S.: Partizan Games in Isabelle/HOLZF, www4.in.tum.de/~obua/partizan