On the public citation graph
Open sets in computability theory and reverse mathematics
0 signed · 69 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.200310122openalex-snapshot
Uniform versions of some axioms of second order arithmetic
inferredcites →https://doi.org/10.1007/978-1-4020-8926-8_6openalex-snapshot
A Constructive Version of the Lusin Separation Theorem
inferredcites →https://doi.org/10.1007/978-3-030-36755-8_16openalex-snapshot
Lifting Recursive Counterexamples to Higher-Order Arithmetic
inferredcites →https://doi.org/10.1007/978-3-642-61693-8openalex-snapshot
Elements of the History of Mathematics
inferredcites →https://doi.org/10.1007/bf02402869openalex-snapshot
Sur les fonctions de n variables complexes
inferredcites →https://doi.org/10.1007/bfb0066739openalex-snapshot
Metamathematical Investigation of Intuitionistic Arithmetic and Analysis
inferredcites →https://doi.org/10.1007/bfb0091894openalex-snapshot
Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies
inferredcites →https://doi.org/10.1007/s00153-011-0256-5openalex-snapshot
The Dirac delta function in two settings of Reverse Mathematics
inferredcites →https://doi.org/10.1007/s001530100094openalex-snapshot
Disasters in topology without the axiom of choice
inferredcites →https://doi.org/10.1016/0168-0072(87)90065-0openalex-snapshot
Representations of the real numbers and of the open subsets of the set of real numbers
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50001-0openalex-snapshot
STUDIES IN LOGIC AND THE FOUNDATIONS OF MATHEMATICS
inferredcites →https://doi.org/10.1016/j.apal.2019.05.007openalex-snapshot
The strength of compactness in Computability Theory and Nonstandard Analysis
inferredcites →https://doi.org/10.1016/j.apal.2020.102788openalex-snapshot
Pincherle's theorem in reverse mathematics and computability theory
inferredcites →https://doi.org/10.1016/j.hm.2008.01.001openalex-snapshot
The emergence of open sets, closed sets, and limit points in analysis and topology
inferredcites →https://doi.org/10.1016/j.ic.2015.03.005openalex-snapshot
Probabilistic computability and choice
inferredcites →https://doi.org/10.1016/s0049-237x(98)80020-7openalex-snapshot
Gödel’s Functional (“Dialectica”) Interpretation
inferredcites →https://doi.org/10.1017/9781316755983.005openalex-snapshot
Foundational and mathematical uses of higher types
inferredcites →https://doi.org/10.1017/cbo9780511581007openalex-snapshot
Subsystems of Second Order Arithmetic
inferredcites →https://doi.org/10.1017/jsl.2019.69openalex-snapshot
COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS
inferredcites →https://doi.org/10.1090/procopenalex-snapshot
Proceedings of the American Mathematical Society
inferredcites →https://doi.org/10.1090/proc/14413openalex-snapshot
On the computability of perfect subsets of sets with positive measure
inferredcites →https://doi.org/10.1090/s0002-9947-1959-0102480-9openalex-snapshot
Recursive functionals and quantifiers of finite types. I
inferredcites →https://doi.org/10.1090/s0002-9947-1967-0236010-2openalex-snapshot
Hyperanalytic predicates
inferredcites →https://doi.org/10.1215/00294527-2018-0016openalex-snapshot
On the Uniform Computational Content of the Baire Category Theorem
inferredcites →https://doi.org/10.1515/crll.1915.145.9openalex-snapshot
Über Funktionen, die auf einer abgeschlossenen Menge stetig sind.
inferredcites →https://doi.org/10.2307/2314383openalex-snapshot
Foundations of Constructive Analysis.
inferredcites →https://doi.org/10.2307/2369589openalex-snapshot
Non-Uniform Convergence and the Integration of Series Term by Term
inferredcites →https://doi.org/10.24033/bsmf.996openalex-snapshot
Sur la classification des ensembles de mesure nulle
inferredcites →https://doi.org/10.3233/com-170074openalex-snapshot
The Gandy–Hyland functional and a computational aspect of Nonstandard Analysis
inferredcites →https://doi.org/10.48550/arxiv.1905.04058openalex-snapshot
Nets and Reverse Mathematics, a pilot study
inferredcites →https://doi.org/10.48550/arxiv.1908.05676openalex-snapshot
Plato and the foundations of mathematics
inferredcites →https://doi.org/10.48550/arxiv.1908.05677openalex-snapshot
Lifting countable to uncountable mathematics
inferredcites →https://doi.org/10.48550/arxiv.2007.07560openalex-snapshot
On the uncountability of $\mathbb{R}$
inferredcites →https://doi.org/10.5860/choice.46-3606openalex-snapshot
The Princeton companion to mathematics
inferredcites →https://doi.org/10.7146/brics.v6i31.20100openalex-snapshot
Foundational and Mathematical Uses of Higher Types
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-80049-9_18openalex-snapshot
On False Heine/Borel Compactness Principles in Proof Mining
inferred← citeshttps://doi.org/10.1007/978-3-030-93100-1_15openalex-snapshot
Betwixt Turing and Kleene
inferred← citeshttps://doi.org/10.1007/978-3-030-93100-1_18openalex-snapshot
Between Turing and Kleene
inferred← citeshttps://doi.org/10.1007/978-3-031-08740-0_23openalex-snapshot
Reverse Mathematics of the Uncountability of $${\mathbb R}$$
inferred← citeshttps://doi.org/10.1007/978-3-031-15298-6_23openalex-snapshot
On the Computational Properties of the Uncountability of the Real Numbers
inferred← citeshttps://doi.org/10.1007/978-3-031-36978-0_4openalex-snapshot
The Non-normal Abyss in Kleene’s Computability Theory
inferred← citeshttps://doi.org/10.1007/978-3-032-31348-5_33openalex-snapshot
On the Reverse Mathematics of Darboux’s Supremum Principle
inferred← citeshttps://doi.org/10.1007/978-3-032-31348-5_34openalex-snapshot
On the Computational Properties of Ambivalent Sets and Functions
inferred← citeshttps://doi.org/10.1007/s00153-025-00991-4openalex-snapshot
On sequential theorems in Reverse Mathematics
inferred← citeshttps://doi.org/10.1007/s00153-026-01020-8openalex-snapshot
Computability of a whitney extension
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103505openalex-snapshot
On the logical and computational properties of the Vitali covering theorem
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104762openalex-snapshot
Lifting proofs from countable to uncountable mathematics
inferred← citeshttps://doi.org/10.1017/jsl.2022.71openalex-snapshot
ON ROBUST THEOREMS DUE TO BOLZANO, WEIERSTRASS, JORDAN, AND CANTOR
inferred← citeshttps://doi.org/10.1017/jsl.2023.65openalex-snapshot
BIG IN REVERSE MATHEMATICS: MEASURE AND CATEGORY
inferred← citeshttps://doi.org/10.1017/s1755020325000061openalex-snapshot
FROM REAL ANALYSIS TO THE SORITES PARADOX VIA REVERSE MATHEMATICS
inferred← citeshttps://doi.org/10.1090/bproc/111openalex-snapshot
Cousin’s lemma in second-order arithmetic
inferred← citeshttps://doi.org/10.1093/logcom/exac075openalex-snapshot
On the computational properties of basic mathematical notions
inferred← citeshttps://doi.org/10.1093/logcom/exae048openalex-snapshot
On some computational properties of open sets
inferred← citeshttps://doi.org/10.1112/blms.70019openalex-snapshot
Sometimes tame, sometimes wild: Weak continuity
inferred← citeshttps://doi.org/10.1142/s0219061324500077openalex-snapshot
The Biggest Five of Reverse Mathematics
inferred← citeshttps://doi.org/10.1177/22113568251320082openalex-snapshot
On the computational properties of the Baire category theorem
inferred← citeshttps://doi.org/10.1215/00294527-2020-0021openalex-snapshot
Reverse Mathematics of Topology: Dimension, Paracompactness, and Splittings
inferred← citeshttps://doi.org/10.1215/00294527-2022-0001openalex-snapshot
Representations and the Foundations of Mathematics
inferred← citeshttps://doi.org/10.3233/com-200321openalex-snapshot
Computability and non-monotone induction
inferred← citeshttps://doi.org/10.3233/com-210313openalex-snapshot
Countable sets versus sets that are countable in reverse mathematics
inferred← citeshttps://doi.org/10.3233/com-230475openalex-snapshot
Exploring the abyss in Kleene’s computability theory
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.