On the public citation graph
Autostability of models and Abelian groups
0 signed · 89 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/bf01463352openalex-snapshot
Strong and weak constructivization and computable families
inferredcites →https://doi.org/10.1007/bf01668470openalex-snapshot
Autostability and computable families of constructivizations
inferredcites →https://doi.org/10.1007/bf01669456openalex-snapshot
The quantity of nonautoequivalent constructivizations
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_14openalex-snapshot
Algorithmic Stability of Models
inferred← citeshttps://doi.org/10.1007/978-3-031-64309-5_15openalex-snapshot
Structures of Finite Punctual Dimension $$n>2$$
inferred← citeshttps://doi.org/10.1007/978-3-031-64309-5_32openalex-snapshot
On the Group of Computable Automorphisms of the Linear Order of the Reals
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_21openalex-snapshot
On Constructive Nilpotent Groups
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_15openalex-snapshot
Computable Categoricity of Graphs with Finite Components
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_37openalex-snapshot
0″-Categorical Completely Decomposable Torsion-Free Abelian Groups
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_36openalex-snapshot
Computable Ordered Abelian Groups and Fields
inferred← citeshttps://doi.org/10.1007/bf00739415openalex-snapshot
Computable classes of constructivizations for models of infinite algorithmic dimension
inferred← citeshttps://doi.org/10.1007/bf00739993openalex-snapshot
Constructive models of regularly infinite algorithmic dimension
inferred← citeshttps://doi.org/10.1007/bf00739994openalex-snapshot
Discrete families of recursive functions and index sets
inferred← citeshttps://doi.org/10.1007/bf00971397openalex-snapshot
Computable classes of constructivizations for models of finite computability type
inferred← citeshttps://doi.org/10.1007/bf01979674openalex-snapshot
Complexity of the index set of a constructive model
inferred← citeshttps://doi.org/10.1007/bf01980749openalex-snapshot
Constructivizations of direct products of algebraic systems
inferred← citeshttps://doi.org/10.1007/bf01988314openalex-snapshot
Nonuniform autostability of models
inferred← citeshttps://doi.org/10.1007/bf02104947openalex-snapshot
Conditions of effective infinity for the set of computable indexings of a class of constructive models
inferred← citeshttps://doi.org/10.1007/bf02259824openalex-snapshot
Criteria of autostability for 1-decidable models
inferred← citeshttps://doi.org/10.1007/bf02259949openalex-snapshot
Algorithmic dimensions of homomorphic images of models
inferred← citeshttps://doi.org/10.1007/bf02263053openalex-snapshot
Effectively infinite classes of weak constructivizations of models
inferred← citeshttps://doi.org/10.1007/bf02366398openalex-snapshot
Some properties of autostable models
inferred← citeshttps://doi.org/10.1007/s00153-016-0478-7openalex-snapshot
Computable dimension for ordered fields
inferred← citeshttps://doi.org/10.1007/s10469-008-9015-zopenalex-snapshot
The class of projective planes is noncomputable
inferred← citeshttps://doi.org/10.1007/s10469-013-9247-4openalex-snapshot
Computable Numberings of the Class of Boolean Algebras with Distinguished Endomorphisms
inferred← citeshttps://doi.org/10.1007/s10469-015-9329-6openalex-snapshot
The Branching Theorem and Computable Categoricity in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-015-9333-xopenalex-snapshot
Preserving Categoricity and Complexity of Relations
inferred← citeshttps://doi.org/10.1007/s10469-015-9357-2openalex-snapshot
Ash’s Theorem on Δ α 0 -Categorical Structures and a Condition for Infinite Δ α 0 -Dimension
inferred← citeshttps://doi.org/10.1007/s10958-021-05419-xopenalex-snapshot
Categoricity Spectra of Computable Structures
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00036-copenalex-snapshot
A learning-theoretic characterization of classes of recursive functions
inferred← citeshttps://doi.org/10.1016/0168-0072(84)90028-9openalex-snapshot
Recursive linear orders with recursive successivities
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90012-4openalex-snapshot
Recursive unary algebras and trees
inferred← citeshttps://doi.org/10.1016/j.aim.2014.09.022openalex-snapshot
The complexity of computable categoricity
inferred← citeshttps://doi.org/10.1016/j.aim.2017.12.011openalex-snapshot
Computable torsion abelian groups
inferred← citeshttps://doi.org/10.1016/j.apal.2005.10.002openalex-snapshot
Effective categoricity of equivalence structures
inferred← citeshttps://doi.org/10.1016/j.apal.2008.11.003openalex-snapshot
Effective categoricity of Abelian p -groups
inferred← citeshttps://doi.org/10.1016/j.apal.2016.04.016openalex-snapshot
Abelian p-groups and the Halting problem
inferred← citeshttps://doi.org/10.1016/j.apal.2019.01.003openalex-snapshot
Computability-theoretic categoricity and Scott families
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2012.09.020openalex-snapshot
Effectively categorical abelian groups
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2015.06.004openalex-snapshot
Independence in computable algebra
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.041openalex-snapshot
Inductive inference and computable numberings
inferred← citeshttps://doi.org/10.1016/s0001-8708(02)00042-7openalex-snapshot
The computable dimension of ordered abelian groups
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80005-0openalex-snapshot
Chapter 4 Computable classes of constructive models
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/s0049-237x(98)80011-6openalex-snapshot
Chapter 10 Complexity theoretic model theory and algebra
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80012-8openalex-snapshot
Chapter 11 A bibliography of recursive algebra and recursive model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80047-5openalex-snapshot
Chapter 14 Computability theory and linear orderings
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80050-5openalex-snapshot
Chapter 17 Constructive abelian groups
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00035-0openalex-snapshot
Δ20-categoricity in Boolean algebras and linear orderings
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00059-6openalex-snapshot
Computable isomorphisms, degree spectra of relations, and Scott families
inferred← citeshttps://doi.org/10.1017/9781108525749.004openalex-snapshot
Existentially-Atomic Models
inferred← citeshttps://doi.org/10.1017/9781108525749.007openalex-snapshot
Comparing Structures and Classes of Structures
inferred← citeshttps://doi.org/10.1017/9781108525749.008openalex-snapshot
Finite-Injury Constructions
inferred← citeshttps://doi.org/10.1017/cbo9780511565670.009openalex-snapshot
Effective Model Theory: The Number of Models and Their Complexity
inferred← citeshttps://doi.org/10.1017/jsl.2025.10106openalex-snapshot
LATTICE EMBEDDINGS AND PUNCTUAL LINEAR ORDERS
inferred← citeshttps://doi.org/10.1017/s1446788700023302openalex-snapshot
Recursive properties of isomorphism types
inferred← citeshttps://doi.org/10.1023/a:1020927703492openalex-snapshot
Partial Results in Δ03-Categoricity in Linear Orderings and Boolean Algebras
inferred← citeshttps://doi.org/10.1023/b:allo.0000028933.64042.93openalex-snapshot
Constructive Matrix and Orderable Groups
inferred← citeshttps://doi.org/10.1090/proc/15471openalex-snapshot
Relativizing computable categoricity
inferred← citeshttps://doi.org/10.1090/s0002-9947-2014-06115-1openalex-snapshot
Computable completely decomposable groups
inferred← citeshttps://doi.org/10.1090/tran/7355openalex-snapshot
Computable topological groups and Pontryagin duality
inferred← citeshttps://doi.org/10.1093/logcom/exaf044openalex-snapshot
Generically computable Abelian groups and isomorphisms
inferred← citeshttps://doi.org/10.1134/s1995080221040089openalex-snapshot
Punctual Dimension of Algebraic Structures in Certain Classes
inferred← citeshttps://doi.org/10.2307/2695024openalex-snapshot
Degree spectra of intrinsically c.e. relations
inferred← citeshttps://doi.org/10.26686/wgtn.25808320openalex-snapshot
Effective Presentations of Mathematical Structures
inferred← citeshttps://doi.org/10.4064/fm36-12-2015openalex-snapshot
Computable structures and operations on the space of continuous functions
inferred← citeshttps://doi.org/10.48550/arxiv.0805.1887openalex-snapshot
Effective categoricity of equivalence Structures
inferred← citeshttps://doi.org/10.48550/arxiv.0805.1889openalex-snapshot
Effective categoricity of Abelian p-groups
inferred← citeshttps://doi.org/10.48550/arxiv.1409.7747openalex-snapshot
Independence in computable algebra
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.