On the public citation graph
Introduction to ?2 1 -logic
0 signed · 20 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.1016/0003-4843(81)90016-4openalex-snapshot
Π12-logic, Part 1: Dilators
inferredcites →https://doi.org/10.1016/s0049-237x(08)71881-0openalex-snapshot
Introducing Homogeneous Trees
inferredcites →https://doi.org/10.1016/s0049-237x(08)71889-5openalex-snapshot
Bounding Generalized Recursive Functions of Ordinals by Effective Functors; A Complement to the Girard Theorem
inferredcites →https://doi.org/10.1016/s0049-237x(08)71891-3openalex-snapshot
Number Theory and the Bachmann/Howard Ordinal
inferredcites →https://doi.org/10.1016/s0049-237x(08)71893-7openalex-snapshot
Recursive Dilators and Generalized Recursions
inferredcites →https://doi.org/10.1016/s0049-237x(08)71894-9openalex-snapshot
Functors and Ordinal Notations III - Dilators and Gardens
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.19930390131openalex-snapshot
A simplified functorial construction of the veblen hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-030-77799-9_4openalex-snapshot
Well-Ordering Principles in Proof Theory and Reverse Mathematics
inferred← citeshttps://doi.org/10.1007/bf01625834openalex-snapshot
Induktive Definitionen und Dilatoren
inferred← citeshttps://doi.org/10.1007/bfb0023786openalex-snapshot
Proving termination for term rewriting systems
inferred← citeshttps://doi.org/10.1007/s00029-023-00879-2openalex-snapshot
Well ordering principles for iterated $$\Pi ^1_1$$-comprehension
inferred← citeshttps://doi.org/10.1016/j.aim.2019.106767openalex-snapshot
Π11 -comprehension as a well-ordering principle
inferred← citeshttps://doi.org/10.1016/j.aim.2022.108265openalex-snapshot
Minimal bad sequences are necessary for a uniform Kruskal theorem
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102890openalex-snapshot
Derivatives of normal functions in reverse mathematics
inferred← citeshttps://doi.org/10.1016/j.apal.2026.103740openalex-snapshot
Induction on dilators and Bachmann-Howard fixed points
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80041-8openalex-snapshot
Admissible proof theory and beyond
inferred← citeshttps://doi.org/10.1017/jsl.2025.10089openalex-snapshot
REVERSE MATHEMATICS OF A UNIFORM KRUSKAL–FRIEDMAN THEOREM
inferred← citeshttps://doi.org/10.1090/proc/15103openalex-snapshot
Set-theoretic reflection is equivalent to induction over well-founded classes
inferred← citeshttps://doi.org/10.2307/421132openalex-snapshot
Recent Advances in Ordinal Analysis: Π12— CA and Related Systems
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.