On the public citation graph

Autostability and computable families of constructivizations

https://doi.org/10.1007/bf01668470
0 signed · 83 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/bf01463352openalex-snapshot
Strong and weak constructivization and computable families
inferredcites →https://doi.org/10.1070/rm1961v016n03abeh001120openalex-snapshot
CONSTRUCTIVE ALGEBRAS I
inferredcites →https://doi.org/10.4064/fm-84-3-265-270openalex-snapshot
The number of countable generic models for finite forcing

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.200310022openalex-snapshot
Effective embeddings into strong degree structures
inferred← citeshttps://doi.org/10.1002/malq.200310066openalex-snapshot
On the complexity of categoricity in computable structures
inferred← citeshttps://doi.org/10.1006/inco.1997.2676openalex-snapshot
Complexity and Categoricity
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_91openalex-snapshot
Feasibly categorical models
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-4899-3791-9_6openalex-snapshot
R
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_27openalex-snapshot
A Note on the Computable Categoricity of $$\ell ^p$$ ℓ p Spaces
inferred← citeshttps://doi.org/10.1007/978-94-015-1235-0_1openalex-snapshot
R
inferred← citeshttps://doi.org/10.1007/bf00968890openalex-snapshot
Examples of nonautostable systems
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/bf01669323openalex-snapshot
Problem of the number of non-self-equivalent constructivizations
inferred← citeshttps://doi.org/10.1007/bf01669456openalex-snapshot
The quantity of nonautoequivalent constructivizations
inferred← citeshttps://doi.org/10.1007/bf01978849openalex-snapshot
Strong Δ 2 0 categoricity
inferred← citeshttps://doi.org/10.1007/bf02259824openalex-snapshot
Criteria of autostability for 1-decidable 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/bf02367027openalex-snapshot
An autostable 1-decidable model without a computable Scott family of ∃-formulas
inferred← citeshttps://doi.org/10.1007/bf02671735openalex-snapshot
Computable classes of constructivizations of 2-constructivizable models
inferred← citeshttps://doi.org/10.1007/bf02671950openalex-snapshot
A description of autostable models
inferred← citeshttps://doi.org/10.1007/s00153-005-0326-7openalex-snapshot
A computably stable structure with no Scott family of finitary formulas
inferred← citeshttps://doi.org/10.1007/s00153-024-00934-5openalex-snapshot
On categoricity of scattered linear orders of constructive ranks
inferred← citeshttps://doi.org/10.1007/s10469-015-9353-6openalex-snapshot
Index Sets for n-Decidable Structures Categorical Relative to m-Decidable Presentations
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-9361-6openalex-snapshot
Categoricity and Complexity of Relations Over Algebraic Structures
inferred← citeshttps://doi.org/10.1007/s10469-015-9362-5openalex-snapshot
Effective Categoricity of Computable Linear Orderings
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-019-09558-8openalex-snapshot
Constructing Decidable Graphs from Decidable Structures
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-021-05419-xopenalex-snapshot
Categoricity Spectra of Computable Structures
inferred← citeshttps://doi.org/10.1007/s11202-007-0112-3openalex-snapshot
An autostable 2 nilpotent group with no Scott family of finitary formulas
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90048-5openalex-snapshot
Stability of recursive structures in arithmetical degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90070-9openalex-snapshot
Recursive categoricity and recursive stability
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90038-8openalex-snapshot
Categoricity in hyperarithmetical degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90049-ropenalex-snapshot
Uncountable degree spectra
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90097-6openalex-snapshot
Some effects of Ash–Nerode and other decidability conditions on degree spectra
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90231-2openalex-snapshot
Stability among r.e. quotient algebras
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.2019.01.003openalex-snapshot
Computability-theoretic categoricity and Scott families
inferred← citeshttps://doi.org/10.1016/s0049-237x(00)80022-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80001-3openalex-snapshot
Introduction to the handbook of Recursive Mathematics
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)80004-9openalex-snapshot
Chapter 3 Isomorphic recursive structures
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)80045-1openalex-snapshot
Introduction to the handbook of recursive mathematics
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/cbo9780511565670.009openalex-snapshot
Effective Model Theory: The Number of Models and Their Complexity
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.006openalex-snapshot
Computable model theory
inferred← citeshttps://doi.org/10.1017/jsl.2016.43openalex-snapshot
DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS
inferred← citeshttps://doi.org/10.1017/s0004972700021675openalex-snapshot
Recursive properties of isomorphism types
inferred← citeshttps://doi.org/10.1017/s0022481200031297openalex-snapshot
Recursive categoricity and persistence
inferred← citeshttps://doi.org/10.1017/s1446788700023302openalex-snapshot
Recursive properties of isomorphism types
inferred← citeshttps://doi.org/10.1023/a:1012553802244openalex-snapshot
Universal Numbering for Constructive I-Algebras
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/a:1021758312697openalex-snapshot
Computable Structure and Non-Structure Theorems
inferred← citeshttps://doi.org/10.1071/hr9981210083openalex-snapshot
Cristopher John Ash 1945-1995
inferred← citeshttps://doi.org/10.1090/proc/17329openalex-snapshot
A pathological punctually 1-decidable structure
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.1090/s0002-9947-2014-06094-7openalex-snapshot
Categoricity properties for computable algebraic fields
inferred← citeshttps://doi.org/10.1215/00294527-2025-0013openalex-snapshot
Computable Categoricity Relative to a C.E. Degree
inferred← citeshttps://doi.org/10.2178/bsl/1294186665openalex-snapshot
2010 North American Annual Meeting of the Association for Symbolic Logic
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.3233/com-13017openalex-snapshot
Computably Categorical Fields via Fermat’s Last Theorem
inferred← citeshttps://doi.org/10.33048/semi.2020.17.011openalex-snapshot
A. D. Taimanov and model theory in Kazakhstan
inferred← citeshttps://doi.org/10.4064/fm-145-2-153-169openalex-snapshot
Recursive expansions
inferred← citeshttps://doi.org/10.4064/fm221-2-2openalex-snapshot
Computable categoricity versus relative computable categoricity
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.1111.1205openalex-snapshot
Computable Categoricity for Algebraic Fields with Splitting Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1212.6751openalex-snapshot
Computably Categorical Fields via Fermat's Last Theorem
inferred← citeshttps://doi.org/10.48550/arxiv.1412.2288openalex-snapshot
A note on the computable categoricity of l^p spaces
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.