TRANSFINITE RECURSION IN HIGHER REVERSE MATHEMATICS

DOI10.1017/jsl.2015.2zbMath1358.03023arXiv1310.5792OpenAlexW2963204392MaRDI QIDQ3450810

Noah Schweber

Publication date: 9 November 2015

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

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

zbMATH Keywords

ATRreverse mathematicsseparationdeterminacyopen determinacyclopen determinacyCWOhigher reverse mathematicsSteel-type forcingtagged tree

Mathematics Subject Classification ID

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

Related Items (8)

Measure theory and higher order arithmetic ⋮ Determinacy in third order arithmetic ⋮ Arithmetical conservation results ⋮ A note on equality in finite‐type arithmetic ⋮ Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives ⋮ Deflationism beyond arithmetic ⋮ Determinacy separations for class games ⋮ The strength of compactness in computability theory and nonstandard analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Set existence axioms for general (not necessarily countable) stability theory
• Uniform versions of some axioms of second order arithmetic
• On the Π₁ ¹ -separation principle
• Forcing with tagged trees
• Effective Mathematics of the Uncountable

This page was built for publication: TRANSFINITE RECURSION IN HIGHER REVERSE MATHEMATICS