On the public citation graph
Proving termination for term rewriting systems
0 signed · 30 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-030-30229-0_13openalex-snapshot
Well-Partial Orderings and their Maximal Order Types
inferredcites →https://doi.org/10.1007/bf01625829openalex-snapshot
Ein Wohlordnungsbeweis für das OrdinalzahlensystemT(J)
inferredcites →https://doi.org/10.1007/bf01630809openalex-snapshot
Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees
inferredcites →https://doi.org/10.1016/0168-0072(91)90022-eopenalex-snapshot
What's so special about Kruskal's theorem and the ordinal Γo? A survey of some results in proof theory
inferredcites →https://doi.org/10.1016/1385-7258(77)90067-1openalex-snapshot
Well-partial orderings and hierarchies
inferredcites →https://doi.org/10.1090/conm/065/891255openalex-snapshot
On the theory of quasi-ordinal diagrams
inferredcites →https://doi.org/10.1109/lics.1988.5108openalex-snapshot
Proof-theoretic techniques for term rewriting theory
inferredcites →https://doi.org/10.1109/lics.1990.113752openalex-snapshot
A constructive proof of Higman's lemma
inferredcites →https://doi.org/10.2307/2274960openalex-snapshot
Generalizations 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.201020054openalex-snapshot
Rice and Rice-Shapiro Theorems for transfinite correction grammars
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_90openalex-snapshot
The hierarchy of terminating recursive programs over N
inferred← citeshttps://doi.org/10.1007/978-3-319-40189-8_25openalex-snapshot
Program Size Complexity of Correction Grammars in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-540-72927-3_16openalex-snapshot
Learning Correction Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_50openalex-snapshot
A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
inferred← citeshttps://doi.org/10.1007/s00153-014-0408-5openalex-snapshot
Well-partial-orderings and the big Veblen number
inferred← citeshttps://doi.org/10.1007/s00153-016-0515-6openalex-snapshot
An order-theoretic characterization of the Howard–Bachmann-hierarchy
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90068-xopenalex-snapshot
Equational derivation vs. computation
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80846-6openalex-snapshot
Gap Embedding for Well-Quasi-Orderings
inferred← citeshttps://doi.org/10.1090/proc/17351openalex-snapshot
Maximum linearizations of lower sets in ℕ^{𝕞} with application to monomial ideals
inferred← citeshttps://doi.org/10.1098/rsta.2022.0017openalex-snapshot
Some independence results related to finite trees
inferred← citeshttps://doi.org/10.2307/2275919openalex-snapshot
A functorial property of the Aczel-Buchholz-Feferman function
inferred← citeshttps://doi.org/10.48550/arxiv.1909.06719openalex-snapshot
Maximum linearizations of lower sets in $\mathbb{N}^m$ with application to monomial ideals
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.