On the public citation graph

The Baire category theorem in weak subsystems of second-order arithmetic

0 signed · 47 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-662-21755-9openalex-snapshot
Degrees of Unsolvability
inferredcites →https://doi.org/10.1007/bfb0067639openalex-snapshot
Set Theory and Hierarchy Theory V
inferredcites →https://doi.org/10.1007/bfb0067653openalex-snapshot
Initial segments of models of Peano's axioms
inferredcites →https://doi.org/10.1016/0168-0072(83)90012-xopenalex-snapshot
Countable algebra and set existence axioms11Research partially supported by NSF grants MCS-79-23743, MCS-78-02558, and MCS 8107867. Simpson's research was also supported by an Alfred P. Sloan Research Fellowship.
inferredcites →https://doi.org/10.1016/0168-0072(85)90030-2openalex-snapshot
Fragments of arithmetic
inferredcites →https://doi.org/10.1016/0168-0072(86)90066-7openalex-snapshot
Which set existence axioms are needed to prove the separable Hahn-Banach theorem?
inferredcites →https://doi.org/10.1016/0168-0072(86)90074-6openalex-snapshot
Factorization of polynomials and Σ10 induction
inferredcites →https://doi.org/10.1016/0168-0072(90)90014-sopenalex-snapshot
Weak comparability of well orderings and reverse mathematics
inferredcites →https://doi.org/10.1017/s0022481200028309openalex-snapshot
Partial realizations of Hilbert's program
inferredcites →https://doi.org/10.1090/conm/065openalex-snapshot
Logic and Combinatorics
inferredcites →https://doi.org/10.1090/conm/106/1057814openalex-snapshot
Notions of closed subsets of a complete separable metric space in weak subsystems of second-order arithmetic
inferredcites →https://doi.org/10.1090/pspum/005/0141595openalex-snapshot
Algebras of sets binumerable in complete extensions of arithmetic
inferredcites →https://doi.org/10.1090/s0002-9947-1972-0316227-0openalex-snapshot
Π⁰₁ classes and degrees of theories
inferredcites →https://doi.org/10.1515/9783112451144openalex-snapshot
Das Kontinuum
inferredcites →https://doi.org/10.2307/1970028openalex-snapshot
On Degrees of Unsolvability
inferredcites →https://doi.org/10.2307/1996261openalex-snapshot
∏ 0 1 Classes and Degrees of Theories
inferredcites →https://doi.org/10.2307/2026089openalex-snapshot
Finitism
inferredcites →https://doi.org/10.2307/2274131openalex-snapshot
Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?

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-319-40189-8_12openalex-snapshot
The Typical Constructible Object
inferred← citeshttps://doi.org/10.1007/978-3-319-53385-8_16openalex-snapshot
On the Alleged Simplicity of Impure Proof
inferred← citeshttps://doi.org/10.1007/978-94-017-0395-6_10openalex-snapshot
Features in Phonological Theory
inferred← citeshttps://doi.org/10.1007/978-94-017-0395-6_19openalex-snapshot
Synchrony and Composition: Toward a Cognitive Architecture between Classicism and Connectionism
inferred← citeshttps://doi.org/10.1007/s001530050103openalex-snapshot
Lebesgue numbers and Atsuji spaces in subsystems of second-order arithmetic
inferred← citeshttps://doi.org/10.1007/s001530100100openalex-snapshot
Vitali's Theorem and WWKL
inferred← citeshttps://doi.org/10.1016/0168-0072(96)00003-6openalex-snapshot
Formalizing forcing arguments in subsystems of second-order arithmetic
inferred← citeshttps://doi.org/10.1016/j.apal.2010.07.004openalex-snapshot
A measure-theoretic proof of Turing incomparability
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00121-xopenalex-snapshot
Some conservation results on weak König's lemma
inferred← citeshttps://doi.org/10.1017/9781316755723.007openalex-snapshot
Computable versions of the uniform boundedness theorem
inferred← citeshttps://doi.org/10.1017/9781316755846.009openalex-snapshot
The Baire category theoremover a feasible base theory
inferred← citeshttps://doi.org/10.1017/9781316755846.016openalex-snapshot
Did Cantor need set theory?
inferred← citeshttps://doi.org/10.1017/cbo9780511629167.011openalex-snapshot
On a question of Brown and Simpson
inferred← citeshttps://doi.org/10.1017/cbo9780511750762.008openalex-snapshot
The Gödel hierarchy and reverse mathematics
inferred← citeshttps://doi.org/10.1017/jsl.2022.58openalex-snapshot
ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
inferred← citeshttps://doi.org/10.1017/jsl.2023.65openalex-snapshot
BIG IN REVERSE MATHEMATICS: MEASURE AND CATEGORY
inferred← citeshttps://doi.org/10.1090/s0002-9947-96-01725-4openalex-snapshot
Separable Banach space theory needs strong set existence axioms
inferred← citeshttps://doi.org/10.1142/s0219061316500045openalex-snapshot
On principles between ∑1- and ∑2-induction, and monotone enumerations
inferred← citeshttps://doi.org/10.1215/00294527-2018-0016openalex-snapshot
On the Uniform Computational Content of the Baire Category Theorem
inferred← citeshttps://doi.org/10.1215/00294527-2022-0001openalex-snapshot
Representations and the Foundations of Mathematics
inferred← citeshttps://doi.org/10.1215/00294527-2377887openalex-snapshot
Baire Categoricity and Σ10-Induction
inferred← citeshttps://doi.org/10.1305/ndjfl/1040136917openalex-snapshot
On the Strength of Ramsey's Theorem
inferred← citeshttps://doi.org/10.2178/bsl/1102022660openalex-snapshot
Forcing in Proof Theory
inferred← citeshttps://doi.org/10.2307/421198openalex-snapshot
1995 European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2748/tmpub.17.1openalex-snapshot
Model-theoretic studies on subsystems of second order arithmetic
inferred← citeshttps://doi.org/10.3233/com-150033openalex-snapshot
On maximum conservative extensions
inferred← citeshttps://doi.org/10.3233/com-190247openalex-snapshot
A constructive proof of the dense existence of nowhere-differentiable functions in C [ 0 , 1 ]
inferred← citeshttps://doi.org/10.48550/arxiv.1306.1936openalex-snapshot
On principles between $Σ_1$- and $Σ_2$-induction, and monotone enumerations
inferred← citeshttps://doi.org/10.48550/arxiv.1807.10022openalex-snapshot
Computational reverse mathematics and foundational analysis
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.