Transfinite recursion in higher reverse mathematics

DOI10.1017/JSL.2015.2MaRDI QIDQ3450810zbMATH OpenOpenAlexFDO

Authors Noah Schweber

Publication date 9 November 2015

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.5792

zbMATH Keywords

ATRclopen determinacyCWOdeterminacyhigher reverse mathematicsopen determinacyreverse mathematicsseparationSteel-type forcingtagged tree

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Other aspects of forcing and Boolean-valued models (03E40) Determinacy principles (03E60) Second- and higher-order arithmetic and fragments (03F35)

Abstract: In this paper we investigate the reverse mathematics of higher-order analogues of the theory ATRz{} within the framework of higher order reverse mathematics developed by Kohlenbach cite{Koh01}. We define a theory RCAzthr, a close higher-type analogue of the classical base theory RCAz, and show that it is essentially a conservative subtheory of Kohlenbach's base theory RCAzo. Working over RCAzthr, we study higher-type analogues of statements classically equivalent to ATRz, including open and clopen determinacy, as well as two choice principles, and prove several equivalences and separations. Our main result is the separation of open and clopen determinacy for reals, using a variant of Steel forcing; in the presentation of this result, we develop a new, more flexible framework for Steel-type forcing.

Recommendations

• Δ₃^O-determinacy, comprehension and induction
• Infinite games and transfinite recursion of multiple inductive definitions
• Weak determinacy and iterations of inductive definitions
• Determinacy of Wadge classes and subsystems of second order arithmetic
• scientific article; zbMATH DE number 2236640

Cites work

• Effective Mathematics of the Uncountable
• Forcing with tagged trees
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• scientific article; zbMATH DE number 824731 (Why is no real title available?)
• scientific article; zbMATH DE number 2236640 (Why is no real title available?)
• Invariant descriptive set theory
• On the Π₁ ¹ -separation principle
• Set existence axioms for general (not necessarily countable) stability theory
• Uniform versions of some axioms of second order arithmetic

Cited in

(12)

• Arithmetical conservation results
• Deflationism beyond arithmetic
• Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives
• Determinacy separations for class games
• The strength of compactness in computability theory and nonstandard analysis
• Determinacy in third order arithmetic
• Weak and strong versions of effective transfinite recursion
• Measure theory and higher order arithmetic
• A note on equality in finite‐type arithmetic
• What is effective transfinite recursion in reverse mathematics?
• Determinacy on the edge of second-order arithmetic. I
• The metamathematics of separated determinacy

This page was built for publication: Transfinite recursion in higher reverse mathematics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3450810)