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

DOI10.1090/S0002-9947-2012-05416-XMaRDI QIDQ2841359zbMATH OpenOpenAlexFDO

Authors 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

arithmetic Bolzano-Weierstrass theoremcomparabilityhyperarithmetic analysisreverse mathematicssequential limit system

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)

Recommendations

• From Bolzano‐Weierstraß to Arzelà‐Ascoli
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Theorems of hyperarithmetic analysis and almost theorems of hyperarithmetic analysis
• The Baire category theorem in weak subsystems of second-order arithmetic
• scientific article; zbMATH DE number 3924748

Cites work

• Computable structures and the hyperarithmetical hierarchy
• Forcing with tagged trees
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3176053 (Why is no real title available?)
• scientific article; zbMATH DE number 3536056 (Why is no real title available?)
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• On the Π₁ ¹ -separation principle
• Recursive Pseudo-Well-Orderings
• Recursive well-orderings
• THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM

Cited in

(9)

• Infinite dimensional proper subspaces of computable vector spaces
• Theorems of hyperarithmetic analysis and almost theorems of hyperarithmetic analysis
• THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
• Open sets in computability theory and reverse mathematics
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
• THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES
• Connecting real and hyperarithmetical analysis
• Halin's infinite ray theorems: complexity and reverse mathematics

This page was built for publication: Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem

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