On the public citation graph
Cut-elimination for impredicative infinitary systems part I. Ordinal-analysis for ID1
0 signed · 35 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.1007/978-3-662-11035-5openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1007/bf02007261openalex-snapshot
Über Teilsysteme von $$\bar \Theta $$ ({g})
inferredcites →https://doi.org/10.1007/bfb0066745openalex-snapshot
Iterated inductive definitions, trees and ordinals
inferredcites →https://doi.org/10.1007/bfb0079544openalex-snapshot
Normalfunktionen und Konstruktive Systeme von Ordinalzahlen
inferredcites →https://doi.org/10.1007/bfb0079558openalex-snapshot
An upper bound for the provability of transfinite induction in systems with N-times iterated inductive definitions
inferredcites →https://doi.org/10.1007/bfb0079679openalex-snapshot
The Syntax and Semantics of Infinitary Languages
inferredcites →https://doi.org/10.1016/s0049-237x(08)70761-4openalex-snapshot
Formal Theories for Transfinite Iterations of Generalized Inductive Definitions and Some Subsystems of Analysis
inferredcites →https://doi.org/10.1016/s0049-237x(08)70770-5openalex-snapshot
Assignment of Ordinals to Terms for Primitive Recursive Functionals of Finite Type
inferredcites →https://doi.org/10.1016/s0049-237x(08)70772-9openalex-snapshot
Applications of the Cut Elimination Theorem to Some Subsystems of Classical Analysis
inferredcites →https://doi.org/10.1016/s0049-237x(08)71514-3openalex-snapshot
Disjunction and Existence in Formalized Intuitionistic Analysis
inferredcites →https://doi.org/10.2307/1970691openalex-snapshot
Consistency Proofs of Subsystems of Classical Analysis
inferredcites →https://doi.org/10.2307/2271479openalex-snapshot
J. R. Moschovakis. Disjunction and existence in formalized intuitionistic analysis. Sets, models and recursion theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by John N. Crossley, Studies in logic and the…
inferredcites →https://doi.org/10.2307/2271898openalex-snapshot
A simplification of the Bachmann method for generating large countable ordinals
inferredcites →https://doi.org/10.2307/2271954openalex-snapshot
Provable wellorderings of formal theories for transfinitely iterated inductive definitions
inferredcites →https://doi.org/10.2307/2272816openalex-snapshot
Ordinals connected with formal theories for transfinitely iterated inductive definitions
inferredcites →https://doi.org/10.2307/2272979openalex-snapshot
A system of abstract constructive ordinals
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.19860322511openalex-snapshot
Countable Admissible Ordinals and Dilators
inferred← citeshttps://doi.org/10.1007/978-3-030-77799-9_2openalex-snapshot
Simplified Cut Elimination for Kripke-Platek Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-29198-7_9openalex-snapshot
From Subsystems of Analysis to Subsystems of Set Theory
inferred← citeshttps://doi.org/10.1007/bf02297652openalex-snapshot
Zur Beweistheorie Der Kripke-Platek-Mengenlehre Über Den Natürlichen Zahlen
inferred← citeshttps://doi.org/10.1007/s00153-017-0590-3openalex-snapshot
Epsilon substitution for $$\textit{ID}_1$$ ID 1 via cut-elimination
inferred← citeshttps://doi.org/10.1016/j.apal.2005.05.012openalex-snapshot
Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
inferred← citeshttps://doi.org/10.1016/j.apal.2008.06.014openalex-snapshot
Ordinal analysis of non-monotone Π10 -definable inductive definitions
inferred← citeshttps://doi.org/10.1016/j.apal.2008.09.011openalex-snapshot
Ordinal analysis by transformations
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103425openalex-snapshot
Admissible extensions of subtheories of second order arithmetic
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103455openalex-snapshot
Fundamental sequences and fast-growing hierarchies for the Bachmann-Howard ordinal
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70553-1openalex-snapshot
Some Proof-Theoretic Contributions to Theories of Sets
inferred← citeshttps://doi.org/10.1017/cbo9780511896262.006openalex-snapshot
A simplified version of local predicativity
inferred← citeshttps://doi.org/10.1093/logcom/exad006openalex-snapshot
Tame and full strict-Π11 reflection: A proof-theoretic approach
inferred← citeshttps://doi.org/10.2307/421132openalex-snapshot
Recent Advances in Ordinal Analysis: Π12— CA and Related Systems
inferred← citeshttps://doi.org/10.4288/kisoron.39.2_93openalex-snapshot
Proof Theory as an Analysis of Impredicativity( New Developments in Logic: Proof-Theoretic Ordinals and Set-Theoretic Ordinals)
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.