Abstract
We prove that determinacy for all Boolean combinations of \({F_{\sigma \delta }}\) (Π 03 ) sets implies the consistency of second-order arithmetic and more. Indeed, it is equivalent to the statement saying that for every set X and every number n, there exists a β-model of Π 1 n -comprehension containing X.
We prove this result by providing a careful level-by-level analysis of determinacy at the finite level of the difference hierarchy on \({F_{\sigma \delta }}\) (Π 03 ) sets in terms of both reverse mathematics, complexity and consistency strength. We show that, for n ≥ 1, determinacy for sets at the nth level in this difference hierarchy lies strictly between (in the reverse mathematical sense of logical implication) the existence of β-models of Π 1 n+2 -comprehension containing any given set X, and the existence of β-models of Δ 1 n+2 -comprehension containing any given set X. Thus the nth of these determinacy axioms lies strictly between Π 1 n+2 -comprehension and Δ 1 n+2 -comprehension in terms of consistency strength. The major new technical result on which these proof theoretic ones are based is a complexity theoretic one. The nth determinacy axiom implies closure under the operation taking a set X to the least Σ n+1 admissible containing X (for n = 1; this is due to Welch [9]).
Similar content being viewed by others
References
J. P. Burgess, The truth is never simple, Journal of Symbolic Logic 51 (1986), 663–681.
H, Friedman, Higher set theory and mathematical practice, Annals of Mathematical Logic 2 (1972), 325–357.
H. T. Hodes, Jumping through the transfinite: The mastercode hierarchy of Turing degrees, Journal of Symbolic Logic 45 (1980), 204–220.
D. A. Martin, Determinacy, circulated drafts, about 578 pp.
A, Montalbán and R. A. Shore, The limits of determinacy in second order arithmetic, Proceedings of the London Mathematical Society 104 (2012), 223–252.
R. A. Shore, Reverse mathematics: the playground of logic, Bulletin of Symbolic Logic 16 (2010), 378–402.
S. G. Simpson, Subsystems of Second Order Arithmetic, 2nd ed., Perspectives in Logic, Cambridge University Press, 2009.
P. D. Welch, Weak systems of determinacy and arithmetical quasi-inductive definitions, Journal of Symbolic Logic 76 (2011), 418–436.
P. D. Welch, \({G_{\sigma \delta }}\)-games, Isaac Newton Insistute, Series No. NI12050-SAS, 2012, preprint.
Author information
Authors and Affiliations
Corresponding author
Additional information
Partially supported by NSF grant DMS-0901169, and by a Packard fellowship.
Partially supported by NSF Grants DMS-0852811 and DMS-1161175.
Rights and permissions
About this article
Cite this article
Montalbán, A., Shore, R.A. The limits of determinacy in second order arithmetic: consistency and complexity strength. Isr. J. Math. 204, 477–508 (2014). https://doi.org/10.1007/s11856-014-1117-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11856-014-1117-9