On the public citation graph
Autostability of models
0 signed · 123 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/bf00967504openalex-snapshot
Some properties of the constructivization of Boolean algebras
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.1002/malq.202100016openalex-snapshot
On the effective universality of mereological theories
inferred← citeshttps://doi.org/10.1007/978-0-387-69245-6_3openalex-snapshot
Computability and Computable Models
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/978-1-4612-0325-4_14openalex-snapshot
Algorithmic Stability of Models
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_24openalex-snapshot
Polynomial Time Categoricity and Linear Orderings
inferred← citeshttps://doi.org/10.1007/978-1-4612-3466-1_18openalex-snapshot
When is every recursive linear ordering of type μ recursively isomorphic to a polynomial time linear ordering over the natural numbers in binary form?
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_4openalex-snapshot
Some Questions in Computable Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_7openalex-snapshot
A Note on Effective Categoricity for Linear Orderings
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/978-981-95-4839-2_7openalex-snapshot
On a Computability-Theoretic Approach to Boolean-Valued Models
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/bf00971397openalex-snapshot
Computable classes of constructivizations for models of finite computability type
inferred← citeshttps://doi.org/10.1007/bf01669101openalex-snapshot
Autostability of models and Abelian groups
inferred← citeshttps://doi.org/10.1007/bf01979010openalex-snapshot
Algorithmic properties of branching models
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/bf02259824openalex-snapshot
Criteria of autostability for 1-decidable models
inferred← citeshttps://doi.org/10.1007/bf02259845openalex-snapshot
Effective choice for relations and reducibilities in classes of constructive and positive models
inferred← citeshttps://doi.org/10.1007/bf02259853openalex-snapshot
Effective choice of constructivizations and recursive consistency of problems on constructive 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/bf02671950openalex-snapshot
A description of autostable models
inferred← citeshttps://doi.org/10.1007/bf02672914openalex-snapshot
Autostability of boolean algebras with distinguished ideal
inferred← citeshttps://doi.org/10.1007/s00153-008-0110-6openalex-snapshot
Degree spectra of the successor relation of computable linear orderings
inferred← citeshttps://doi.org/10.1007/s00153-008-0112-4openalex-snapshot
Linear orders with distinguished function symbol
inferred← citeshttps://doi.org/10.1007/s00153-016-0478-7openalex-snapshot
Computable dimension for ordered fields
inferred← citeshttps://doi.org/10.1007/s10469-013-9224-yopenalex-snapshot
Computable categoricity of the Boolean algebra $ \mathfrak{B}\left( \omega \right) $ with a distinguished automorphism
inferred← citeshttps://doi.org/10.1007/s10469-013-9233-xopenalex-snapshot
Degrees of categoricity for superatomic Boolean algebras
inferred← citeshttps://doi.org/10.1007/s10469-013-9241-xopenalex-snapshot
Abelian p-groups and autostability relative to an oracle
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/s10469-015-9362-5openalex-snapshot
Effective Categoricity of Computable Linear Orderings
inferred← citeshttps://doi.org/10.1007/s10469-016-9381-xopenalex-snapshot
Degrees of Autostability Relative to Strong Constructivizations for Boolean Algebras
inferred← citeshttps://doi.org/10.1007/s10469-016-9395-4openalex-snapshot
Degrees of Autostability for Linear Orders and Linearly Ordered Abelian Groups
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.1007/s10469-018-9483-8openalex-snapshot
Degrees of Autostability for Prime Boolean Algebras
inferred← citeshttps://doi.org/10.1007/s10469-018-9498-1openalex-snapshot
Categoricity for Primitive Recursive and Polynomial Boolean Algebras
inferred← citeshttps://doi.org/10.1007/s10469-018-9511-8openalex-snapshot
Computable Bi-Embeddable Categoricity
inferred← citeshttps://doi.org/10.1007/s10469-023-09698-yopenalex-snapshot
Boolean Algebras Autostable Relative to n-Decidable Presentations
inferred← citeshttps://doi.org/10.1007/s10849-022-09371-0openalex-snapshot
Computable Heyting Algebras with Distinguished Atoms and Coatoms
inferred← citeshttps://doi.org/10.1007/s10958-014-2032-7openalex-snapshot
Hyperarithmetical Categoricity of Boolean Algebras of Type B $$ \mathfrak{B} $$ (ω α × η)
inferred← citeshttps://doi.org/10.1007/s10958-014-2148-9openalex-snapshot
Δ 2 0 -Categoricity of Boolean Algebras
inferred← citeshttps://doi.org/10.1007/s10958-014-2149-8openalex-snapshot
Arithmetical Isomorphisms of Abelian p-Groups
inferred← citeshttps://doi.org/10.1007/s10958-015-2629-5openalex-snapshot
2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms
inferred← citeshttps://doi.org/10.1007/s10958-021-05419-xopenalex-snapshot
Categoricity Spectra of Computable Structures
inferred← citeshttps://doi.org/10.1007/s10958-021-05424-0openalex-snapshot
Degree Spectra of Structures
inferred← citeshttps://doi.org/10.1007/s11225-012-9411-1openalex-snapshot
Computable Isomorphisms of Boolean Algebras with Operators
inferred← citeshttps://doi.org/10.1007/s11225-016-9667-yopenalex-snapshot
Categoricity Spectra for Polymodal Algebras
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(86)90049-7openalex-snapshot
Recursion theory and ordered groups
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.apal.2005.10.002openalex-snapshot
Effective categoricity of equivalence structures
inferred← citeshttps://doi.org/10.1016/j.apal.2008.06.010openalex-snapshot
Computable categoricity and the Ershov hierarchy
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.2011.06.007openalex-snapshot
Computably categorical Boolean algebras enriched by ideals and atoms
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.apal.2025.103612openalex-snapshot
Generically computable linear orderings
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.02.004openalex-snapshot
Graphs are not universal for online computability
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103821openalex-snapshot
On computability-theoretic universality of Boolean-valued models
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)80002-5openalex-snapshot
Chapter 1 Pure computable model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80003-7openalex-snapshot
Chapter 2 Elementary theories and their 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)80009-8openalex-snapshot
Chapter 8 Groups of computable automorphisms
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/s0168-0072(01)00087-2openalex-snapshot
Degree spectra and computable dimensions in algebraic structures
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/bsl.2021.62openalex-snapshot
AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS
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/cbo9781139028592.005openalex-snapshot
Computable structure theory using admissible recursion theory on ω1 using admissibility
inferred← citeshttps://doi.org/10.1017/jsl.2014.68openalex-snapshot
COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY
inferred← citeshttps://doi.org/10.1017/jsl.2016.43openalex-snapshot
DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS
inferred← citeshttps://doi.org/10.1017/jsl.2017.50openalex-snapshot
A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
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.0000044278.96526.5dopenalex-snapshot
Autostable I-Algebras
inferred← citeshttps://doi.org/10.1023/b:allo.0000048828.44523.94openalex-snapshot
The Computable Dimension of I-Trees of Infinite Height
inferred← citeshttps://doi.org/10.1090/s0002-9947-2014-06093-5openalex-snapshot
Computable categoricity for algebraic fields with splitting algorithms
inferred← citeshttps://doi.org/10.1134/s003744661503012xopenalex-snapshot
Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals
inferred← citeshttps://doi.org/10.1134/s0037446617060052openalex-snapshot
Computability of Distributive Lattices
inferred← citeshttps://doi.org/10.1134/s0037446619010038openalex-snapshot
Primitively Recursively Categorical Linear Orderings
inferred← citeshttps://doi.org/10.1134/s0037446621060033openalex-snapshot
Primitively Recursive Categoricity for Unars and Equivalence Structures
inferred← citeshttps://doi.org/10.1134/s1064562410040071openalex-snapshot
Autostable atomic-ideal enrichments of computable Boolean algebras
inferred← citeshttps://doi.org/10.1134/s1995080221040089openalex-snapshot
Punctual Dimension of Algebraic Structures in Certain Classes
inferred← citeshttps://doi.org/10.1142/s0218216518410122openalex-snapshot
Computable isomorphisms for certain classes of infinite graphs
inferred← citeshttps://doi.org/10.1142/s0219061310000924openalex-snapshot
ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS
inferred← citeshttps://doi.org/10.2178/bsl/1146620059openalex-snapshot
Classification from a Computable Viewpoint
inferred← citeshttps://doi.org/10.2178/jsl/1107298513openalex-snapshot
The computable dimension of trees of infinite height
inferred← citeshttps://doi.org/10.2178/jsl/1107298515openalex-snapshot
Computable categoricity of trees of finite height
inferred← citeshttps://doi.org/10.2178/jsl/1254748694openalex-snapshot
d-computable categoricity for algebraic fields
inferred← citeshttps://doi.org/10.2178/jsl/1309952534openalex-snapshot
Low5 Boolean Subalgebras and Computable Copies
inferred← citeshttps://doi.org/10.2307/421207openalex-snapshot
Degree Spectra of Relations on Computable Structures
inferred← citeshttps://doi.org/10.3103/s1066369x16060025openalex-snapshot
Initial segments of computable linear orders with computable natural relations
inferred← citeshttps://doi.org/10.3233/com-13017openalex-snapshot
Computably Categorical Fields via Fermat’s Last Theorem
inferred← citeshttps://doi.org/10.3233/com-170070openalex-snapshot
Computability and categoricity of weakly ultrahomogeneous structures
inferred← citeshttps://doi.org/10.33048/semi.2020.17.076openalex-snapshot
A note on decidable categoricity and index sets
inferred← citeshttps://doi.org/10.33048/semi.2021.18.070openalex-snapshot
HKSS-completeness of modal algebras
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.1506.03066openalex-snapshot
Degrees of categoricity on a cone
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.