On the public citation graph
Generalizations of the Kruskal-Friedman theorems
0 signed · 22 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/bf02007558openalex-snapshot
Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
inferredcites →https://doi.org/10.1007/bfb0091894openalex-snapshot
Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies
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)90078-9openalex-snapshot
An independence result for (II11-CA)+BI
inferredcites →https://doi.org/10.1016/0168-0072(88)90055-3openalex-snapshot
Proof-theoretical analysis: weak systems of functions and classes
inferredcites →https://doi.org/10.1016/1385-7258(77)90067-1openalex-snapshot
Well-partial orderings and hierarchies
inferredcites →https://doi.org/10.1016/s0049-237x(09)70156-9openalex-snapshot
Nonprovability of Certain Combinatorial Properties of Finite Trees
inferredcites →https://doi.org/10.1090/s0002-9947-1960-0111704-1openalex-snapshot
Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
inferredcites →https://doi.org/10.1112/plms/s3-2.1.326openalex-snapshot
Ordering by Divisibility in Abstract Algebras
inferredcites →https://doi.org/10.2307/2275019openalex-snapshot
Generalizations of the one-dimensional version of the Kruskal-Friedman theorems
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.19900360204openalex-snapshot
A theorem on labelled trees and the limits of its provability
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_36openalex-snapshot
How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems
inferred← citeshttps://doi.org/10.1007/bf01630809openalex-snapshot
Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees
inferred← citeshttps://doi.org/10.1007/bfb0023786openalex-snapshot
Proving termination for term rewriting systems
inferred← citeshttps://doi.org/10.1007/s00153-011-0258-3openalex-snapshot
Phase transitions of iterated Higman-style well-partial-orderings
inferred← citeshttps://doi.org/10.1007/s00153-014-0408-5openalex-snapshot
Well-partial-orderings and the big Veblen number
inferred← citeshttps://doi.org/10.1017/9781316755983.004openalex-snapshot
Internal finite tree embeddings
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.004openalex-snapshot
Brief introduction to unprovability
inferred← citeshttps://doi.org/10.1017/jsl.2025.10089openalex-snapshot
REVERSE MATHEMATICS OF A UNIFORM KRUSKAL–FRIEDMAN THEOREM
inferred← citeshttps://doi.org/10.1017/s0960129520000298openalex-snapshot
From Kruskal’s theorem to Friedman’s gap condition
inferred← citeshttps://doi.org/10.46298/dmtcs.2771openalex-snapshot
Phase transitions in Proof Theory
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.