Lifting recursive counterexamples to higher-order arithmetic

DOI10.1007/978-3-030-36755-8_16MaRDI QIDQ2177592zbMATH OpenOpenAlexFDO

Authors Sam Sanders

Publication date 6 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-36755-8_16

zbMATH Keywords

higher-order arithmeticnetsrecursive counterexamplesSpecker sequences

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35)

Recommendations

• Lifting proofs from countable to uncountable mathematics
• Open sets in computability theory and reverse mathematics
• scientific article; zbMATH DE number 2236640
• Reverse mathematics, countable and uncountable
• scientific article; zbMATH DE number 3924748

Cited in

(7)

• Representations and the foundations of mathematics
• Lifting proofs from countable to uncountable mathematics
• Nets and reverse mathematics
• Countable sets versus sets that are countable in reverse mathematics
• On the uncountability of \(\mathbb{R}\)
• scientific article; zbMATH DE number 7753345 (Why is no real title available?)
• On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor

This page was built for publication: Lifting recursive counterexamples to higher-order arithmetic

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