On the public citation graph

Subrecursive hierarchies via direct limits

https://doi.org/10.1007/bfb0099482
0 signed · 19 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.1002/malq.19710170113openalex-snapshot
Eine Klassifikation der ε0‐Rekursiven Funktionen
inferredcites →https://doi.org/10.1007/bf01967649openalex-snapshot
Hierarchies of number-theoretic functions. I
inferredcites →https://doi.org/10.1007/bf01973616openalex-snapshot
Hierarchies of number-theoretic functions II
inferredcites →https://doi.org/10.1007/bf01973619openalex-snapshot
A classification of the ordinal recursive functions
inferredcites →https://doi.org/10.1007/bf02007256openalex-snapshot
Built-up systems of fundamental sequences and hierarchies of number-theoretic functions
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.2307/2273557openalex-snapshot
The slow-growing and the Graegorczyk hierarchies

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.19900360409openalex-snapshot
Some extensions of built‐upness on systems of fundamental sequences
inferred← citeshttps://doi.org/10.1002/malq.19930390125openalex-snapshot
On Wainer's notation for a minimal subrecursive inaccessible ordinal
inferred← citeshttps://doi.org/10.1002/malq.19940400212openalex-snapshot
A Uniform Approach to Fundamental Sequences and Hierarchies
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_68openalex-snapshot
Trees, ordinals and termination
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_40openalex-snapshot
An ordinal calculus for proving termination in term rewriting
inferred← citeshttps://doi.org/10.1007/bf01387511openalex-snapshot
Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
inferred← citeshttps://doi.org/10.1007/bf02017491openalex-snapshot
Natural well-orderings
inferred← citeshttps://doi.org/10.1007/bfb0076232openalex-snapshot
Subrecursive ordinals
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90068-xopenalex-snapshot
Equational derivation vs. computation
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90027-dopenalex-snapshot
Ordinal complexity of recursive definitions
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00009-1openalex-snapshot
Ordinal recursive bounds for Higman's theorem
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.