On the public citation graph

Algorithmic degree of unars

https://doi.org/10.1007/bf01978402

0 signed · 15 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/bf01669101openalex-snapshot

Autostability of models and Abelian groups

inferredcites →https://doi.org/10.1007/bf01669102openalex-snapshot

Autostability of models

inferredcites →https://doi.org/10.1007/bf01669323openalex-snapshot

Problem of the number of non-self-equivalent constructivizations

inferredcites →https://doi.org/10.1007/bf01669607openalex-snapshot

Computable single-valued numerations

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_14openalex-snapshot

Algorithmic Stability of Models

inferred← citeshttps://doi.org/10.1007/bf01792984openalex-snapshot

Some applications of computable one-one numberings

inferred← citeshttps://doi.org/10.1007/bf02259949openalex-snapshot

Algorithmic dimensions of homomorphic images of models

inferred← citeshttps://doi.org/10.1007/s00153-008-0112-4openalex-snapshot

Linear orders with distinguished function symbol

inferred← citeshttps://doi.org/10.1007/s10469-016-9377-6openalex-snapshot

Existence and Uniqueness of Structures Computable in Polynomial Time

inferred← citeshttps://doi.org/10.1007/s10469-017-9416-yopenalex-snapshot

Structures Computable in Polynomial Time. I

inferred← citeshttps://doi.org/10.1007/s10469-018-9465-xopenalex-snapshot

Structures Computable in Polynomial Time. II

inferred← citeshttps://doi.org/10.1016/0168-0072(94)90012-4openalex-snapshot

Recursive unary algebras and trees

inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80002-5openalex-snapshot

Chapter 1 Pure computable model theory

inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80007-4openalex-snapshot

Chapter 6 Autostable models and algorithmic dimensions

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00272-3openalex-snapshot

Learning algebraic structures from text

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.