pith. sign in

arxiv: 1906.11762 · v1 · pith:EOCGUZWLnew · submitted 2019-06-27 · 🧮 math.LO

F_σ Games and Reflection in L(mathbb{R})

J. P. Aguilera This is my paper

Pith reviewed 2026-05-25 13:48 UTC · model grok-4.3

classification 🧮 math.LO
keywords F_sigma determinacyKP + ADPi_1 reflectionadmissible setstransitive modelsL(R)infinite gamesomega^2 length
0
0 comments X

The pith

Determinacy of F_sigma games of length omega^2 equals existence of a transitive model of KP + AD containing the reals that reflects Pi_1 facts about the next admissible set.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes an equivalence between the determinacy of all F_sigma games of length omega squared and the existence of a transitive model of KP plus AD. This model must contain every real number and reflect Pi_1 statements about its next admissible set. The result links a statement about winning strategies in games of transfinite length to a precise model-theoretic property inside L(R). A sympathetic reader cares because the equivalence isolates the minimal model features needed to guarantee the determinacy, allowing one direction to be derived from the other without extra large-cardinal or forcing assumptions.

Core claim

Determinacy of F_sigma games of length omega^2 is equivalent to the existence of a transitive model of KP + AD which contains the reals and reflects Pi_1 facts about the next admissible set.

What carries the argument

The transitive model of KP + AD that contains the reals and reflects Pi_1 facts about the next admissible set; this model supplies the exact strength shown to be equivalent to the stated game determinacy.

If this is right

  • Existence of the model yields determinacy for every F_sigma game of length omega^2.
  • Determinacy of those games yields existence of such a model.
  • The equivalence is internal to the theory of L(R).

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The characterization may permit proofs of determinacy at this length by constructing the model directly rather than via game strategies.
  • Analogous equivalences could be investigated for games whose payoff sets belong to other pointclasses or whose lengths are different ordinals.
  • The Pi_1 reflection condition may interact with other known reflection principles for admissible ordinals in descriptive set theory.

Load-bearing premise

The reflection property for Pi_1 facts about the next admissible set, together with transitivity and containment of the reals, is precisely the model feature that captures the game determinacy.

What would settle it

A concrete counterexample would be either a transitive model of KP + AD containing the reals that reflects the Pi_1 facts yet some F_sigma game of length omega^2 lacks a winning strategy, or a situation in which all such games are determined but no model with those three properties exists.

read the original abstract

It is shown that determinacy of $F_\sigma$ games of length $\omega^2$ is equivalent to the existence of a transitive model of KP + AD which contains the reals and reflects $\Pi_1$ facts about the next admissible set.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript proves that determinacy of F_σ games of length ω² is equivalent to the existence of a transitive model of KP + AD containing the reals and reflecting Π₁ facts about the next admissible set.

Significance. If correct, the result supplies a precise inner-model characterization of determinacy at this specific game length, linking the quantifier complexity of F_σ payoffs directly to Π₁ reflection over the next admissible set. Such equivalences are useful for calibrating consistency strengths and for applications inside L(ℝ) under AD.

minor comments (2)
  1. The introduction would benefit from a brief reminder of the definition of F_σ payoff sets for readers outside descriptive set theory.
  2. Notation for the next admissible set and the reflection property could be introduced with an explicit display equation in §2.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive report and recommendation to accept the manuscript. The assessment accurately captures the main result and its significance for calibrating consistency strengths under AD.

Circularity Check

0 steps flagged

No significant circularity; equivalence is self-contained

full rationale

The paper claims an equivalence between determinacy of F_sigma games of length omega^2 and existence of a transitive model of KP + AD containing the reals with Pi_1 reflection on the next admissible set. No quoted derivation step reduces one side to the other by construction, fitted parameter, or self-citation chain. The model properties are presented as an independent characterization matching the quantifier complexity of the games, with no evidence of ansatz smuggling, renaming, or uniqueness imported from prior author work. This is a standard non-circular equivalence result in descriptive set theory.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

Only the abstract is available, so the ledger is necessarily incomplete; no free parameters, invented entities, or non-standard axioms are identifiable from the given text.

axioms (2)
  • domain assumption Standard background set theory including existence of the reals and definitions of F_sigma sets and games of length omega^2
    Invoked implicitly by the statement of the equivalence involving games and models containing the reals.
  • standard math KP set theory and the axiom of determinacy (AD)
    The model is required to satisfy KP + AD.

pith-pipeline@v0.9.0 · 5553 in / 1194 out tokens · 35159 ms · 2026-05-25T13:48:30.797362+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

  1. [1]

    Aczel and W

    P. Aczel and W. Richter. Inductive Definitions and Reflect ing Properties of Admissible Or- dinals. In J. E. Fenstad and P. G. Hinman, editors, Generalized Recursion Theory , pages 301–381. 1974

    work page 1974

  2. [2]

    J. P. Aguilera. Determined admissible sets. 2018. Forth coming

    work page 2018

  3. [3]

    J. P. Aguilera. Long Borel Games. 2018. Forthcoming

    work page 2018

  4. [4]

    J. P. Aguilera. Shortening clopen games. 2018. Forthcom ing

    work page 2018

  5. [5]

    J. P. Aguilera. Between the Finite and the Infinite. 2019. Ph.D. Thesis

    work page 2019

  6. [6]

    J. P. Aguilera and S. M¨ uller. The consistency strength o f long projective determinacy. 2018. Forthcoming

    work page 2018

  7. [7]

    K. J. Barwise, R. Gandy, and Y. N. Moschovakis. The Next Ad missible Set. J. Symbolic Logic, 36:108–120, 1971

    work page 1971

  8. [8]

    A. Blass. Equivalence of Two Strong Forms of Determinacy . Proc. Amer. Math. Soc. , 52:373– 376, 1975

    work page 1975

  9. [9]

    Gale and F

    D. Gale and F. M. Stewart. Infinite games with perfect info rmation. In H. W. Kuhn and A. W. Tucker, editors, Contributions to the Theory of Games , volume 2, pages 245–266. Princeton University Press, 1953

    work page 1953

  10. [10]

    L. A. Harrington and A. S. Kechris. On Monotone vs. Nonmo notone Induction. Handwritten notes dated September 1975. 9 pp

    work page 1975

  11. [11]

    L. A. Harrington and A. S. Kechris. On Monotone vs. Nonmo notone Induction. Bull. Amer. Math. Soc. , 82:888–890, 1976. 20 J. P. AGUILERA

    work page 1976

  12. [12]

    L. A. Harrington and Y. N. Moschovakis. On Positive Indu ction vs. Nonmonotone Induction. Mimeographed notes

    work page

  13. [13]

    A. S. Kechris. On Spector Classes. In A. S. Kechris, B. L¨ owe, and J. R. Steel, editors, Ordinal definability and recursion theory, The Cabal Seminar, Volum e III . Cambridge University Press, 2016

    work page 2016

  14. [14]

    A. S. Kechris and W. H. W oodin. Equivalence of Partition Properties and Determinacy. Proc. Natl. Acad. Sci. USA , 80:1783–1786, 1983

    work page 1983

  15. [15]

    Koellner and W

    P. Koellner and W. H. W oodin. Large Cardinals from Deter minacy. In M. Foreman and A. Kanamori, editors, Handbook of Set Theory . Springer, 2010

    work page 2010

  16. [16]

    Y. N. Moschovakis. Uniformization in a playful univers e. Bull. Amer. Math. Soc. , 77:731–736, 1971

    work page 1971

  17. [17]

    Y. N. Moschovakis. The Game Quantifier. Proc. Amer. Math. Soc. , 31:245–250, 1972

    work page 1972

  18. [18]

    Y. N. Moschovakis. Elementary Induction on Abstract Structures . Studies in Logic and the Foundations of Mathematics. Elsevier, 1974

    work page 1974

  19. [19]

    Y. N. Moschovakis. Descriptive set theory, second edition , volume 155 of Mathematical Sur- veys and Monographs . AMS, 2009

    work page 2009

  20. [20]

    I. Neeman. The Determinacy of Long Games . De Gruyter series in logic and its applications. W alter de Gruyter, 2004

    work page 2004

  21. [21]

    J. R. Steel. Scales in L(R). In A. S. Kechris, B. L¨ owe, and J. R. Steel, editors, Games, Scales and Suslin Cardinals, The Cabal Seminar, Volume I . Cambridge University Press, 2008

    work page 2008

  22. [22]

    K. Tanaka. W eak Axioms of Determinacy and Subsystems of Analysis, II. Ann. Pure Appl. Logic, 52:181–193, 1991

    work page 1991

  23. [23]

    N. D. Trang. Generalized Solovay Measures, the HOD analysis, and the Cor e Model Induc- tion. PhD thesis, University of California at Berkeley, 2013

    work page 2013

  24. [24]

    Uhlenbrock

    S. Uhlenbrock. Pure and Hybrid Mice with Finitely Many Woodin Cardinals fro m Levels of Determinacy. PhD thesis, WWU M¨ unster, 2016

    work page 2016

  25. [25]

    P. W olfe. The strict determinateness of certain infinit e games. Pacific J. Math. , 5:841–847, 1955. Institute of Discrete Mathematics and Geometry, Vienna Unive rsity of Technology. Wiedner Hauptstraße 8–10, 1040 Vienna, Austria. E-mail address : aguilera@logic.at

    work page 1955