Commit message (Collapse) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
* | Second proof (using ordinals) of the lemma. | David A. Madore | 2016-01-30 | 1 | -0/+23 | |
| | ||||||
* | Complete/fix the proof of the non-well-founded induction theorem (and its ↵ | David A. Madore | 2016-01-30 | 1 | -59/+76 | |
| | | | | key lemma). | |||||
* | Steps toward proving the non-well-founded-induction theorem by a fixed point ↵ | David A. Madore | 2016-01-30 | 1 | -13/+74 | |
| | | | | argument. | |||||
* | Fix missing condition. | David A. Madore | 2016-01-29 | 1 | -3/+4 | |
| | ||||||
* | Add version control line. | David A. Madore | 2016-01-29 | 2 | -0/+11 | |
| | ||||||
* | More re-reading. | David A. Madore | 2016-01-29 | 1 | -31/+39 | |
| | ||||||
* | Slight change of notation/convention on forfeiting games. | David A. Madore | 2016-01-29 | 1 | -12/+11 | |
| | ||||||
* | Definition by non-well-founded induction. | David A. Madore | 2015-12-18 | 1 | -0/+67 | |
| | ||||||
* | Reorganized by moving stuff on non-well-founded graphs to a different section. | David A. Madore | 2015-12-18 | 1 | -59/+81 | |
| | ||||||
* | Incremental improvements. | David A. Madore | 2015-12-15 | 1 | -20/+69 | |
| | ||||||
* | Transitive collapse, combinatorial games. | David A. Madore | 2015-12-11 | 1 | -35/+182 | |
| | ||||||
* | Very few changes. | David A. Madore | 2015-12-08 | 1 | -7/+14 | |
| | ||||||
* | New terminology: "downstream-closed" and "downstream-inductive", clarify things. | David A. Madore | 2015-12-08 | 1 | -19/+83 | |
| | ||||||
* | Terminology: use "sink" rather than "terminal (vertex)". | David A. Madore | 2015-12-06 | 1 | -35/+34 | |
| | ||||||
* | Terminology: use "out-neighbor" rather than "successor". | David A. Madore | 2015-12-05 | 1 | -40/+40 | |
| | ||||||
* | TODO of sorts. | David A. Madore | 2015-12-05 | 1 | -0/+5 | |
| | ||||||
* | Transitive collapse, etc. | David A. Madore | 2015-12-04 | 1 | -16/+69 | |
| | ||||||
* | Grundy function on a graph. | David A. Madore | 2015-12-04 | 1 | -2/+28 | |
| | ||||||
* | Well-founded graphs and well-founded induction. | David A. Madore | 2015-12-04 | 1 | -0/+206 | |
| | ||||||
* | Update outline. | David A. Madore | 2015-12-04 | 1 | -2/+2 | |
| | ||||||
* | State and prove von Neumann's minimax theorem. | David A. Madore | 2015-12-03 | 1 | -16/+137 | |
| | ||||||
* | Prove the existence of Nash equilibria. | David A. Madore | 2015-12-03 | 1 | -32/+141 | |
| | ||||||
* | Start writing about games in normal form. | David A. Madore | 2015-12-03 | 1 | -0/+121 | |
| | ||||||
* | Game of nim. | David A. Madore | 2015-11-30 | 1 | -0/+9 | |
| | ||||||
* | Fix description of Choquet's game. | David A. Madore | 2015-11-30 | 1 | -10/+11 | |
| | ||||||
* | Blah. | David A. Madore | 2015-11-30 | 1 | -1/+1 | |
| | ||||||
* | Choquet's topological game. | David A. Madore | 2015-11-30 | 1 | -1/+17 | |
| | ||||||
* | More examples of games, and a discussion about preposing choices. | David A. Madore | 2015-11-25 | 1 | -7/+85 | |
| | ||||||
* | Start writing course notes. | David A. Madore | 2015-11-25 | 1 | -0/+302 | |
| | ||||||
* | Update provisional outline. | David A. Madore | 2015-11-24 | 1 | -1/+4 | |
| | ||||||
* | Provisional outline. | David A. Madore | 2015-11-24 | 1 | -0/+102 | |