Partizan games in Isabelle/HOLZF

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4281 LNCS, Issue , 2006, Pages 272-286

  Obua, Steven ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; FUNCTIONS; LINEAR ALGEBRA; NUMBER THEORY;

INDUCTION PRINCIPLE; PARTIZAN GAMES (PGS); ZF AXIOMS;

GAME THEORY;

EID: 33845939903     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11921240_19     Document Type: Conference Paper

References (14)

1. John H. Conway. On Numbers And Games, 2nd ed., A K Peters Ltd., 2001.
2. Lionel E. Mamane. Surreal Numbers in Coq. TYPES 2004, LNCS 3839, Springer 2005, pp. 170-185.
3. Mike J.C. Gordon. Set Theory, Higher Order Logic or Both. Theorem Proving in Higher Order Logics, 9th International Conference, TPHOLs'96, LNCS 1125, Springer 1996, pp. 190-201.
4. Sten Agerholm. Formalising a Model of the λ-Calculus in HOL-ST. Technical Report 354, University of Cambridge Computer Laboratory, 1994.
5. Sten Agerholm, Mike J.C. Gordon. Experiments with ZF Set Theory in HOL and Isabelle. Technical Report RS-95-37, BRICS 1995.
6. Lawrence C. Paulson. Set theory for verification: I. From foundations to functions. J. Automated Reasoning 11 (1993), 353-389.
7. Lawrence C. Paulson. Set theory for verification: II. Induction and Recursion. J. Automated Reasoning 15 (1995), 167-215.
8. Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic, Springer 2002.
9. F. Baader, T. Nipkow. Term Rewriting and All That, Cambridge U.P. 1998.
10. Thomas Jech. Set Theory, 3rd rev. ed., Springer 2003.
11. Lawrence C. Paulson. Organizing Numerical Theories Using Axiomatic Type Classes. Journal of Automated Reasoning, 2004, Vol. 33, No. 1, pages 29-49.
12. Lawrence C. Paulson. Defining Functions on Equivalence Classes. ACM Transactions on Computational Logic, in press.
13. Steven Obua. Proving Bounds for Real Linear Programs in Isabelle/HOL. TPHOLs 2005, LNCS 3683, Springer 2005, pp. 227-244.
14. Steven Obua. Partizan Games in Isabelle/HOLZF. http://www4.in.tum.de/~obua/partizan.