Uniform versions of some axioms of second order arithmetic

DOI10.1002/MALQ.200310122MaRDI QIDQ3159415zbMATH OpenOpenAlexFDO

Authors Nobuyuki Sakamoto, Takeshi Yamazaki

Publication date 16 February 2005

Published in MLQ (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200310122

zbMATH Keywords

higher-order arithmeticreverse mathematicssecond-order arithmeticuniform weak König's lemma

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Recommendations

• scientific article; zbMATH DE number 3924748
• scientific article; zbMATH DE number 2019844
• scientific article; zbMATH DE number 2236636
• Minimal prime ideals and arithmetic comprehension
• Reverse mathematics, countable and uncountable
• Banach’s theorem in higher-order reverse mathematics
• The cohesive principle and the Bolzano-Weierstraß principle
• Set existence principles and closure conditions: unravelling the standard view of reverse mathematics
• A multi-sorted version of second order arithmetic
• Proof-theoretic investigations on Kruskal's theorem

Cited in

(36)

• On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness
• Refining the taming of the reverse mathematics zoo
• Reverse mathematics and parameter-free transfer
• Reverse mathematics of topology: dimension, paracompactness, and splittings
• Reverse formalism 16
• Reverse mathematics of the uncountability of \(\mathbb{R}\)
• Splittings and robustness for the Heine-Borel theorem
• Representations and the foundations of mathematics
• Splittings and disjunctions in reverse mathematics
• Pincherle's theorem in reverse mathematics and computability theory
• The strength of compactness in computability theory and nonstandard analysis
• Lifting proofs from countable to uncountable mathematics
• Non-principal ultrafilters, program extraction and higher-order reverse mathematics
• Effective Choice and Boundedness Principles in Computable Analysis
• Open questions in reverse mathematics
• Transfinite recursion in higher reverse mathematics
• scientific article; zbMATH DE number 6983478 (Why is no real title available?)
• Nets and reverse mathematics
• The computational content of nonstandard analysis
• Countable sets versus sets that are countable in reverse mathematics
• On the uncountability of \(\mathbb{R}\)
• Computability theory, nonstandard analysis, and their connections
• On the mathematical and foundational significance of the uncountable
• Classical provability of uniform versions and intuitionistic provability
• A note on the sequential version of ^1_2 statements
• Banach’s theorem in higher-order reverse mathematics
• The Dirac delta function in two settings of reverse mathematics
• On the logical and computational properties of the Vitali covering theorem
• On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor
• A note on continuous functions on metric spaces
• Connecting real and hyperarithmetical analysis
• Big in reverse mathematics: measure and category
• The biggest five of reverse mathematics
• Sometimes tame, sometimes wild: weak continuity
• Big in reverse mathematics: the uncountability of the reals
• Approximation theorems throughout reverse mathematics

This page was built for publication: Uniform versions of some axioms of second order arithmetic

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