On the public citation graph
Some aspects of generalized computability
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.
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/bf01463146openalex-snapshot
Generalized computations and third-degree arithmetic
inferredcites →https://doi.org/10.1007/bf02219441openalex-snapshot
Generalized computations and second degree arithmetic
inferredcites →https://doi.org/10.1016/s0049-237x(08)71233-3openalex-snapshot
Recursively Mahlo Ordinals and Inductive Definitions
inferredcites →https://doi.org/10.1090/s0002-9947-1959-0102480-9openalex-snapshot
Recursive functionals and quantifiers of finite types. I
inferredcites →https://doi.org/10.2307/2270051openalex-snapshot
Constructively accessible ordinal 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.1007/978-1-4612-0325-4_1openalex-snapshot
The Work of Anil Nerode: A Retrospective
inferred← citeshttps://doi.org/10.1007/bf01668423openalex-snapshot
The halt problem and theory of hierarchies
inferred← citeshttps://doi.org/10.1007/bf01669834openalex-snapshot
A totally transcendental decidable theory without constructivizable homogeneous models
inferred← citeshttps://doi.org/10.1007/bf01979010openalex-snapshot
Algorithmic properties of branching models
inferred← citeshttps://doi.org/10.1007/bf01980232openalex-snapshot
HomogeneousO′-elements in structural pre-orders
inferred← citeshttps://doi.org/10.1007/bf01988314openalex-snapshot
Nonuniform autostability of models
inferred← citeshttps://doi.org/10.1007/bf02104579openalex-snapshot
Computability with two-place oracle
inferred← citeshttps://doi.org/10.1007/bf02218589openalex-snapshot
On complete theories with a finite number of denumerable models
inferred← citeshttps://doi.org/10.1007/bf02261706openalex-snapshot
Generalized computations with binary oracles
inferred← citeshttps://doi.org/10.1007/bfb0076226openalex-snapshot
Generic objects in recursion theory
inferred← citeshttps://doi.org/10.1017/s1079898600003383openalex-snapshot
2004 Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.1134/s0081543811060071openalex-snapshot
Degrees of autostability relative to strong constructivizations
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.