On the public citation graph

Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM

https://doi.org/10.1007/bf01275469
0 signed · 45 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.1002/malq.19930390107openalex-snapshot
How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals
inferredcites →https://doi.org/10.1007/978-3-642-66473-1openalex-snapshot
Proof Theory
inferredcites →https://doi.org/10.1007/978-3-662-11035-5openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1007/bf01621474openalex-snapshot
Proof theory and ordinal analysis
inferredcites →https://doi.org/10.1007/bf01621475openalex-snapshot
Proof-theoretic analysis of KPM
inferredcites →https://doi.org/10.1007/bf01625829openalex-snapshot
Ein Wohlordnungsbeweis für das OrdinalzahlensystemT(J)
inferredcites →https://doi.org/10.1007/bf01651328openalex-snapshot
Ordinal notations based on a weakly Mahlo cardinal
inferredcites →https://doi.org/10.1007/bf02007140openalex-snapshot
ϱ-inaccessible ordinals, collapsing functions and a recursive notation system
inferredcites →https://doi.org/10.1016/0168-0072(86)90052-7openalex-snapshot
A new system of proof-theoretic ordinal functions
inferredcites →https://doi.org/10.1016/0168-0072(87)90079-0openalex-snapshot
Ordinal notations based on a hierarchy of inaccessible cardinals
inferredcites →https://doi.org/10.1016/0168-0072(94)90074-4openalex-snapshot
Proof theory of reflection
inferredcites →https://doi.org/10.1016/s0049-237x(08)70763-8openalex-snapshot
Regular Ordinals and Normal Forms
inferredcites →https://doi.org/10.1017/9781316717196openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1017/cbo9780511896262.006openalex-snapshot
A simplified version of local predicativity
inferredcites →https://doi.org/10.1017/cbo9780511896262.011openalex-snapshot
Fragments of Kripke-Platek set theory with infinity
inferredcites →https://doi.org/10.2307/2271954openalex-snapshot
Provable wellorderings of formal theories for transfinitely iterated inductive definitions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.19960420106openalex-snapshot
The Recursively Mahlo Property in Second Order Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-030-15655-8_11openalex-snapshot
A New Foundational Crisis in Mathematics, Is It Really Happening?
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_65openalex-snapshot
Theories and Ordinals: Ordinal Analysis
inferred← citeshttps://doi.org/10.1007/978-3-662-22108-2_16openalex-snapshot
The Higher Infinite in Proof Theory
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/978-94-007-4435-6_15openalex-snapshot
Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions
inferred← citeshttps://doi.org/10.1007/s00153-004-0226-2openalex-snapshot
An ordinal analysis of stability
inferred← citeshttps://doi.org/10.1007/s00153-004-0232-4openalex-snapshot
An ordinal analysis of parameter free ?12-comprehension
inferred← citeshttps://doi.org/10.1007/s001530050140openalex-snapshot
Extending Martin-Löf Type Theory by one Mahlo-universe
inferred← citeshttps://doi.org/10.1007/s001530050153openalex-snapshot
Ordinal diagrams for recursively Mahlo universes
inferred← citeshttps://doi.org/10.1007/s11229-004-6297-0openalex-snapshot
Theories and Ordinals in Proof Theory
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90074-4openalex-snapshot
Proof theory of reflection
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.1016/s0168-0072(01)00076-8openalex-snapshot
Extending the system T0 of explicit mathematics: the limit and Mahlo axioms
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00065-9openalex-snapshot
Realization of constructive set theory into explicit mathematics: a lower bound for impredicative Mahlo universe
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00096-9openalex-snapshot
Induction–recursion and initial algebras
inferred← citeshttps://doi.org/10.1017/9781316716830.019openalex-snapshot
The Higher Infinite in Proof Theory
inferred← citeshttps://doi.org/10.1023/a:1005152527817openalex-snapshot
A Uniform Approach for Characterizing the Provably Total Number-Theoretic Functions of KPM and (Some of) its Subsystems
inferred← citeshttps://doi.org/10.1093/logcom/exaa020openalex-snapshot
Power Kripke–Platek set theory and the axiom of choice
inferred← citeshttps://doi.org/10.1515/9783110324907.315openalex-snapshot
An Extended Predicative Definition of the Mahlo Universe
inferred← citeshttps://doi.org/10.2178/jsl/1190150043openalex-snapshot
Wellordering proofs for metapredicative Mahlo
inferred← citeshttps://doi.org/10.2307/2695054openalex-snapshot
Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory
inferred← citeshttps://doi.org/10.2307/2695093openalex-snapshot
First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo
inferred← citeshttps://doi.org/10.2307/421108openalex-snapshot
Pure Proof Theory Aims, Methods and Results: Extended Version of Talks Given at Oberwolfach and Haifa
inferred← citeshttps://doi.org/10.2307/421132openalex-snapshot
Recent Advances in Ordinal Analysis: Π12— CA and Related Systems
inferred← citeshttps://doi.org/10.4171/022-2/3openalex-snapshot
The art of ordinal analysis
inferred← citeshttps://doi.org/10.4288/jafpos.20.0_29openalex-snapshot
A Sneak Preview of Proof Theory of Ordinals( Infinity in Philosophy and Mathematics)
inferred← citeshttps://doi.org/10.48550/arxiv.1102.0596openalex-snapshot
A sneak preview of proof theory of ordinals
inferred← citeshttps://doi.org/10.48550/arxiv.1610.02194openalex-snapshot
Classifying the provably total set functions of KP and KP(P)
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.