On the public citation graph
Built-up systems of fundamental sequences and hierarchies of number-theoretic functions
0 signed · 35 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.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.2307/2269866openalex-snapshot
Systems of predicative analysis, II: Representations of ordinals
inferredcites →https://doi.org/10.2307/2272541openalex-snapshot
-arithmetic and transfinite induction
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.19840302504openalex-snapshot
A SECOND NORMAL FORM FOR FUNCTIONS OF THE SYSTEM EP
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/978-3-030-51466-2_14openalex-snapshot
Ackermannian Goodstein Sequences of Intermediate Growth
inferred← citeshttps://doi.org/10.1007/978-3-031-64309-5_26openalex-snapshot
Fundamental Sequences Based on Localization
inferred← citeshttps://doi.org/10.1007/978-3-031-86319-6_9openalex-snapshot
Automatic Structures and the Problem of Natural Well-orderings
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/bf02007266openalex-snapshot
Postscript to “built-up systems of fundamental sequences and hierarchies of number-theoretic functions”
inferred← citeshttps://doi.org/10.1007/bfb0083668openalex-snapshot
Elementary properties of a system of fundamental sequences for Γo
inferred← citeshttps://doi.org/10.1007/bfb0099482openalex-snapshot
Subrecursive hierarchies via direct limits
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90346-4openalex-snapshot
Fast growing functions based on Ramsey theorems
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90078-9openalex-snapshot
An independence result for (II11-CA)+BI
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90031-8openalex-snapshot
Subsystems of true arithmetic and hierarchies of functions
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90071-xopenalex-snapshot
On bimodal logics of provability
inferred← citeshttps://doi.org/10.1016/j.apal.2025.103658openalex-snapshot
Fundamental sequences based on localization
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104758openalex-snapshot
Deducibility and independence in Beklemishev's autonomous provability calculus
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80018-9openalex-snapshot
Hierarchies of Provably Recursive Functions
inferred← citeshttps://doi.org/10.1137/0220011openalex-snapshot
More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case
inferred← citeshttps://doi.org/10.2307/2274857openalex-snapshot
Undecidable complexity statements in -arithmetic
inferred← citeshttps://doi.org/10.4064/fm-141-1-1-20openalex-snapshot
Arithmetical transfinite induction and hierarchies of functions
inferred← citeshttps://doi.org/10.48550/arxiv.1512.05036openalex-snapshot
Ordinal Notations in Caucal Hierarchy
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.