On the public citation graph
An autostable 1-decidable model without a computable Scott family of ∃-formulas
0 signed · 46 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/bf01668470openalex-snapshot
Autostability and computable families of constructivizations
inferredcites →https://doi.org/10.1007/bf01877237openalex-snapshot
Enumerations of families of general recursive functions
inferredcites →https://doi.org/10.1007/bf02259824openalex-snapshot
Criteria of autostability for 1-decidable models
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.200310066openalex-snapshot
On the complexity of categoricity in computable structures
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_16openalex-snapshot
Effectively Existentially-Atomic Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_18openalex-snapshot
Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey
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-00940-7openalex-snapshot
Punctually presented structures II: comparing presentations
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-019-09558-8openalex-snapshot
Constructing Decidable Graphs from Decidable Structures
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/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(98)80002-5openalex-snapshot
Chapter 1 Pure computable model theory
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.1023/a:1025971406116openalex-snapshot
Uniformity in Computable Structure Theory
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.2178/bsl/1294186665openalex-snapshot
2010 North American Annual Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2178/jsl/1107298515openalex-snapshot
Computable categoricity of trees of finite height
inferred← citeshttps://doi.org/10.2178/jsl/1191333855openalex-snapshot
Applications of Kolmogorov complexity to computable model theory
inferred← citeshttps://doi.org/10.3103/s1055134420030050openalex-snapshot
On Decidable Categoricity and Almost Prime Models
inferred← citeshttps://doi.org/10.4064/fm221-2-2openalex-snapshot
Computable categoricity versus relative computable categoricity
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
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.