On the public citation graph

Encoding the hydra battle as a rewrite system

https://doi.org/10.1007/bfb0055776
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.
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.1006/jsco.1994.1059openalex-snapshot
Complexity Bounds for Some Finite Forms of Kruskal's Theorem
inferredcites →https://doi.org/10.1007/3-540-56868-9_17openalex-snapshot
Total Termination of Term Rewriting
inferredcites →https://doi.org/10.1016/0304-3975(92)90289-ropenalex-snapshot
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
inferredcites →https://doi.org/10.1016/0304-3975(94)00135-6openalex-snapshot
Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferredcites →https://doi.org/10.1090/s0002-9939-1983-0687646-0openalex-snapshot
A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
inferredcites →https://doi.org/10.1111/j.1439-0507.1970.tb01233.xopenalex-snapshot
Habilitationsschrift
inferredcites →https://doi.org/10.1112/blms/14.4.285openalex-snapshot
Accessible Independence Results for Peano Arithmetic
inferredcites →https://doi.org/10.2307/2272973openalex-snapshot
Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.2002.3160openalex-snapshot
A Characterisation of Multiply Recursive Functions with Higman's Lemma
inferred← citeshttps://doi.org/10.1007/3-540-44881-0_21openalex-snapshot
Relating Derivation Lengths with the Slow-Growing Hierarchy Directly
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_13openalex-snapshot
A Characterisation of Multiply Recursive Functions with Higman’s Lemma
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_10openalex-snapshot
Lexicographic Combination of Reduction Pairs
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_28openalex-snapshot
On the Computational Content of Termination Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-73147-4_1openalex-snapshot
The Hydra Battle Revisited
inferred← citeshttps://doi.org/10.1007/bfb0055753openalex-snapshot
Mathematical Foundations of Computer Science 1998
inferred← citeshttps://doi.org/10.1007/s00153-003-0190-2openalex-snapshot
Simply terminating rewrite systems with long derivations
inferred← citeshttps://doi.org/10.1007/s00200-009-0094-4openalex-snapshot
The Hydra battle and Cichon’s principle
inferred← citeshttps://doi.org/10.1007/s002000100061openalex-snapshot
The Termination Hierarchy for Term Rewriting
inferred← citeshttps://doi.org/10.1016/j.jsc.2014.09.033openalex-snapshot
Beyond polynomials and Peano arithmetic—automation of elementary and ordinal interpretations
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00008-7openalex-snapshot
An upper bound on the derivational complexity of Knuth–Bendix orderings
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.004openalex-snapshot
Brief introduction to unprovability
inferred← citeshttps://doi.org/10.1017/s1755020310000286openalex-snapshot
ON THE TERMINATION OF RUSSELL’S DESCRIPTION ELIMINATION ALGORITHM
inferred← citeshttps://doi.org/10.1070/sm2015v206n09abeh004493openalex-snapshot
On some slowly terminating term rewriting systems
inferred← citeshttps://doi.org/10.23638/lmcs-17(2:20)2021openalex-snapshot
Star Games and Hydras
inferred← citeshttps://doi.org/10.4171/owr/2006/52openalex-snapshot
Mini-workshop: Logic, Combinatorics and Independence Results
inferred← citeshttps://doi.org/10.4204/eptcs.313.4openalex-snapshot
Tools in Term Rewriting for Education
inferred← citeshttps://doi.org/10.4213/sm8519openalex-snapshot
О некоторых медленно сходящихся системах преобразований термов
inferred← citeshttps://doi.org/10.4230/lipics.rta.2013.335openalex-snapshot
Beyond Peano Arithmetic – Automatically Proving Termination of the Goodstein Sequence
inferred← citeshttps://doi.org/10.48550/arxiv.0907.5527openalex-snapshot
Proof Theory at Work: Complexity Analysis of Term Rewrite 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.