Axiom of determinacy: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

31 May 2024

25 September 2023

31 August 2023

  • curprev 13:2713:27, 31 August 2023RhubarbJayde talk contribs 2,565 bytes +491 No edit summary undo Tag: Visual edit
  • curprev 13:2113:21, 31 August 2023RhubarbJayde talk contribs 2,074 bytes +2,074 Created page with "The axiom of determinacy is a powerful proposal for a foundational axiom inspired by Zermelo's theorem. Given any subset \(A\) of Baire space \(\omega^\omega\), let \(\mathcal{G}_A\) be the topological game of length \(\omega\) where players I and II alternatively play natural numbers \(n_1, n_2, n_3, \cdots\). Then player I wins iff \(\langle n_1, n_2, n_3, \cdots \rangle \in A\), and else player II wins. \(A\) is called the payoff set of \(\mathcal{G}_A\). AD states th..." Tag: Visual edit