Pincherle's theorem in reverse mathematics and computability theory
DOI10.1016/j.apal.2020.102788zbMath1443.03008arXiv1808.09783OpenAlexW3006582179MaRDI QIDQ2304540
Publication date: 12 March 2020
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.09783
compactnessreverse mathematicslocal-global principlelocally boundedPincherlehigher-order computabilityHeinerealizerFejerLindeloff
Foundations of classical theories (including reverse mathematics) (03B30) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35) Higher-type and set recursion theory (03D65)
Related Items (14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reverse mathematics and uniformity in proofs without excluded middle
- ``Local-global: the first twenty years
- Scenes from the history of real functions. Translated from the Russian by Roger Cooke
- Topological existence and stability for min sup problems
- On subcontinuity
- Recursion on the countable functionals
- Constructivism in mathematics. An introduction. Volume I
- Multilevel optimization: algorithms and applications
- Disasters in topology without the axiom of choice
- Functionals of type 3 as realisers of classical theorems in analysis
- Locally bounded functions
- Reverse mathematics of topology: dimension, paracompactness, and splittings
- Splittings and disjunctions in reverse mathematics
- Nets and reverse mathematics. Some initial results
- Reverse mathematics and computability theory of domain theory
- The strength of compactness in computability theory and nonstandard analysis
- Classical consequences of continuous choice principles from intuitionistic analysis
- Points of continuity, quasicontinuity, cliquishness, and upper and lower quasicontinuity
- Relations among continuous and various non-continuous functions
- Bolzano and uniform continuity
- On uniform relationships between combinatorial problems
- Excursions in the History of Mathematics
- Uniform versions of some axioms of second order arithmetic
- Open Questions in Reverse Mathematics
- Higher-Order Computability
- The Use of Tagged Partitions in Elementary Real Analysis
- Located sets and reverse mathematics
- The Gandy–Hyland functional and a computational aspect of Nonstandard Analysis
- COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS
- On the mathematical and foundational significance of the uncountable
- A Note on the Sequential Version of ${\rm \Pi^1_2}$ Statements
- A NOTE ON THE REVERSE MATHEMATICS OF THE SORITES
- On the strength of marriage theorems and uniformity
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Reverse Mathematics and Π12 Comprehension
- Analysis II
This page was built for publication: Pincherle's theorem in reverse mathematics and computability theory