summaryrefslogtreecommitdiffstats
path: root/notes-mitro206.tex
Commit message (Expand)AuthorAgeFilesLines
...
* Another remark on the Grundy function.David A. Madore2016-03-231-0/+18
* Nim sum is XOR.David A. Madore2016-03-231-9/+123
* Nim sum of ordinals and games.David A. Madore2016-03-231-5/+238
* Start part on impartial combinatorial games. Also, clearly rename top-level ...David A. Madore2016-03-231-48/+173
* Add more to index.David A. Madore2016-03-221-2/+2
* Add index.upload-20160322David A. Madore2016-03-221-113/+125
* More about the Cantor normal form and binary form of ordinals.David A. Madore2016-03-221-2/+97
* Hyperref + table of contents.David A. Madore2016-03-211-0/+5
* More details on Grundy function and Grundy kernel.upload-20160321David A. Madore2016-03-211-37/+86
* Fix missing clause in definition of Borel sets.David A. Madore2016-03-201-1/+1
* Product and exponentiation of ordinals.upload-20160314David A. Madore2016-03-141-2/+194
* Briefly describe the nimber and (surreal) number associated to \alpha.David A. Madore2016-03-141-3/+49
* Acknowledge the Burali-Forti "paradox".David A. Madore2016-03-141-0/+12
* Sum of ordinals.David A. Madore2016-03-141-0/+57
* Successor and limit ordinals.David A. Madore2016-03-141-8/+78
* Split section on well-founded sets. Upper bounds of ordinals.David A. Madore2016-03-141-3/+37
* Definition of ordinals.David A. Madore2016-03-141-8/+90
* More about well-founded and non-well-founded inductions.David A. Madore2016-03-141-20/+113
* Fix lots of typos (thanks, "Pjetri").David A. Madore2016-03-121-18/+18
* Well-ordered sets.David A. Madore2016-03-101-9/+213
* Genies granting ordinal-counted wishes.David A. Madore2016-03-101-0/+39
* Another point to note about constructing ordinals.David A. Madore2016-03-091-0/+7
* Intuitive presentation of ordinals.David A. Madore2016-03-091-2/+95
* Well-founded induction, von Neumann ordinals.David A. Madore2016-03-091-1/+52
* Mention the terminology "well-ordered".David A. Madore2016-03-091-2/+16
* More on the intuitive explanation of ordinals: decreasing sequences terminate.David A. Madore2016-03-091-1/+35
* Start writing an intuitive introduction to ordinals.David A. Madore2016-03-091-0/+134
* Determinacy of combinatorial games for positional strategies (fairly tedious).upload-20160308David A. Madore2016-03-081-194/+387
* Various clarifications in wording in the combinatorial-to-Gale-Stewart argument.David A. Madore2016-03-081-36/+48
* Mention Borel determinacy and beyond.David A. Madore2016-03-071-1/+48
* Trivial comment.upload-20160307David A. Madore2016-03-071-1/+1
* Slight reformulation.David A. Madore2016-03-071-11/+11
* Alternative terminology: "progressively finite" for well-founded.David A. Madore2016-03-071-4/+5
* The halting game (Turing against Blanche).David A. Madore2016-03-071-0/+48
* Add disclaimer about provisional status of these notes.upload-20160305David A. Madore2016-03-051-0/+9
* Minor changes noted during lecture.David A. Madore2016-02-291-13/+24
* Link zero-sum games and linear programming.David A. Madore2016-02-281-1/+96
* Another self-note.David A. Madore2016-02-261-0/+7
* Self-note.David A. Madore2016-02-251-0/+3
* Remove now redundant pieces.David A. Madore2016-02-251-65/+0
* Determinacy of perfect information games from Gale-Stewart games.David A. Madore2016-02-251-3/+152
* Second proof of open determinacy.David A. Madore2016-02-251-6/+93
* Clarify how we can exchange the players' roles.David A. Madore2016-02-251-96/+148
* Product topology and open determinacy.David A. Madore2016-02-251-27/+201
* Prove the essentially trivial proposition about strategies (exists/forall).David A. Madore2016-02-251-1/+58
* An essentially trivial statement.David A. Madore2016-02-241-6/+44
* Start a new section on Gale-Stewart games.David A. Madore2016-02-241-5/+70
* Positional versus historical strategies. Prepare for induction.David A. Madore2016-02-221-33/+150
* More clarifications on impartial p.i. games (and player naming).David A. Madore2016-02-221-31/+79
* Rework and describe outline.David A. Madore2016-02-221-36/+72