Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem

DOI10.1090/S0002-9947-2012-05416-XzbMath1287.03030MaRDI QIDQ2841359

Chris J. Conidis

Publication date: 25 July 2013

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-2012-05416-x

zbMATH Keywords

comparability; reverse mathematics; arithmetic Bolzano-Weierstrass theorem; hyperarithmetic analysis; sequential limit system

Mathematics Subject Classification ID

03B30: Foundations of classical theories (including reverse mathematics)

03D80: Applications of computability and recursion theory

03F35: Second- and higher-order arithmetic and fragments

Related Items

THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS, THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH, THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES, Infinite dimensional proper subspaces of computable vector spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable structures and the hyperarithmetical hierarchy
• Recursive well-orderings
• THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM
• On the Π₁ ¹ -separation principle
• Forcing with tagged trees
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• Recursive Pseudo-Well-Orderings