On the public citation graph

Ordinal diagrams for Π3-reflection

https://doi.org/10.2307/2586705
0 signed · 16 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/bf01625829openalex-snapshot
Ein Wohlordnungsbeweis für das OrdinalzahlensystemT(J)
inferredcites →https://doi.org/10.1007/bf02017494openalex-snapshot
Archive for mathematical logic
inferredcites →https://doi.org/10.1007/bf02023014openalex-snapshot
A well-ordering proof for Feferman's theoryT 0
inferredcites →https://doi.org/10.1016/0168-0072(94)90074-4openalex-snapshot
Proof theory of reflection
inferredcites →https://doi.org/10.1017/9781316717110.010openalex-snapshot
Generalized Recursion Theories
inferredcites →https://doi.org/10.2307/421108openalex-snapshot
Pure Proof Theory Aims, Methods and Results: Extended Version of Talks Given at Oberwolfach and Haifa

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-7643-8653-5_16openalex-snapshot
Proof theory and Martin-Löf Type Theory
inferred← citeshttps://doi.org/10.1007/s00153-022-00840-8openalex-snapshot
Wellfoundedness proof with the maximal distinguished set
inferred← citeshttps://doi.org/10.1016/j.apal.2004.01.001openalex-snapshot
Proof theory for theories of ordinals II: Π3-reflection
inferred← citeshttps://doi.org/10.1016/j.apal.2010.08.002openalex-snapshot
Wellfoundedness proofs by means of non-monotonic inductive definitions II: First order operators
inferred← citeshttps://doi.org/10.1016/j.apal.2013.07.016openalex-snapshot
Relativized ordinal analysis: The case of Power Kripke–Platek set theory
inferred← citeshttps://doi.org/10.1017/cbo9780511721151.009openalex-snapshot
Universes in type theory part I—Inaccessibles and Mahlo
inferred← citeshttps://doi.org/10.1142/s0219061313500037openalex-snapshot
PROOF THEORY OF WEAK COMPACTNESS
inferred← citeshttps://doi.org/10.1515/9783110324907.315openalex-snapshot
An Extended Predicative Definition of the Mahlo Universe
inferred← citeshttps://doi.org/10.2178/jsl/1164060450openalex-snapshot
Epsilon substitution method for -FIX
inferred← citeshttps://doi.org/10.4288/jafpos.20.0_29openalex-snapshot
A Sneak Preview of Proof Theory of Ordinals( Infinity in Philosophy and Mathematics)
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.