On the public citation graph

A finite hierarchy of the recursively enumerable real numbers

https://doi.org/10.1007/bfb0055831
0 signed · 34 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.1007/978-3-0348-9259-9_2openalex-snapshot
Nicht Konstruktiv Beweisbare Sätze der Analysis
inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/978-3-662-21717-7openalex-snapshot
Computability in Analysis and Physics
inferredcites →https://doi.org/10.1007/bf01744572openalex-snapshot
On the definitions of some complexity classes of real numbers
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1090/s0002-9939-1954-0063328-5openalex-snapshot
Recursive Real Numbers
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0242667-4openalex-snapshot
Recursive theory and Dedekind cuts
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2140/pjm.1969.31.215openalex-snapshot
Cohesive sets and recursively enumerable Dedekind cuts
inferredcites →https://doi.org/10.2307/1995137openalex-snapshot
Recursion Theory and Dedekind Cuts
inferredcites →https://doi.org/10.2307/2266321openalex-snapshot
Criteria of constructibility for real numbers
inferredcites →https://doi.org/10.2307/2267043openalex-snapshot
Nicht konstruktiv beweisbare Sätze der Analysis
inferredcites →https://doi.org/10.2307/2267933openalex-snapshot
Rekursive Funktionen
inferredcites →https://doi.org/10.2307/2271331openalex-snapshot
Recursive real numbers
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/1521-3870(200204)48:3<459::aid-malq459>3.0.co;2-9openalex-snapshot
Monotonically Computable Real Numbers
inferred← citeshttps://doi.org/10.1002/1521-3870(200210)48:1+<131::aid-malq131>3.0.co;2-#openalex-snapshot
Recursive Approximability of Real Numbers
inferred← citeshttps://doi.org/10.1002/malq.19990450407openalex-snapshot
Approaches to Effective Semi‐Continuity of Real Functions
inferred← citeshttps://doi.org/10.1002/malq.200310015openalex-snapshot
A transfinite hierarchy of reals
inferred← citeshttps://doi.org/10.1007/11780342_60openalex-snapshot
A Computability Theory of Real Numbers
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_65openalex-snapshot
Weakly Computable Real Numbers and Total Computable Real Functions
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_55openalex-snapshot
Hierarchy of Monotonically Computable Real Numbers
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_17openalex-snapshot
Closure Properties of Real Number Classes under Limits and Computable Operators
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_7openalex-snapshot
Computable Real Functions of Bounded Variation and Semi-computable Real Numbers
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_3openalex-snapshot
The Arithmetical Hierarchy of Real Numbers
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_30openalex-snapshot
Binary Enumerability of Real Numbers (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-1-4471-0717-0_16openalex-snapshot
Monotonically Computable Real Numbers
inferred← citeshttps://doi.org/10.1007/bfb0055753openalex-snapshot
Mathematical Foundations of Computer Science 1998
inferred← citeshttps://doi.org/10.1007/s00224-004-1159-1openalex-snapshot
Closure Properties of Real Number Classes under CBV Functions
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00107-4openalex-snapshot
The closure properties on real numbers under limits and computable operators
inferred← citeshttps://doi.org/10.1016/s0885-064x(03)00066-9openalex-snapshot
On the hierarchy and extension of monotonically computable real numbers
inferred← citeshttps://doi.org/10.1051/ita:2007008openalex-snapshot
On the hierarchies of Δ20-real numbers
inferred← citeshttps://doi.org/10.1093/logcom/13.2.159openalex-snapshot
On the Turing Degrees of Weakly Computable Real Numbers
inferred← citeshttps://doi.org/10.1109/icc59461.2026.11587812openalex-snapshot
Shannon’s sampling series has the highest possible arithmetic complexity
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.