On the public citation graph
Decidable models
0 signed · 51 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/bf02218589openalex-snapshot
On complete theories with a finite number of denumerable models
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-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-3-642-39053-1_23openalex-snapshot
On Decidable and Computable Models of Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-39053-1_41openalex-snapshot
The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated Models
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/bf01669502openalex-snapshot
A theory with two strongly constructivizable models
inferred← citeshttps://doi.org/10.1007/bf01674776openalex-snapshot
Strong constructivizability of homogeneous models
inferred← citeshttps://doi.org/10.1007/bf01674780openalex-snapshot
Criterion for strong constructivizability of a homogeneous model
inferred← citeshttps://doi.org/10.1007/s10469-007-0014-2openalex-snapshot
Spectra of computable models for Ehrenfeucht theories
inferred← citeshttps://doi.org/10.1007/s10469-009-9072-yopenalex-snapshot
autostability of prime models under strong constructivizations
inferred← citeshttps://doi.org/10.1007/s10469-019-09546-yopenalex-snapshot
Turing Degrees of Complete Formulas of Almost Prime Models
inferred← citeshttps://doi.org/10.1007/s10469-025-09779-0openalex-snapshot
Decidable Models of Ehrenfeucht Theories
inferred← citeshttps://doi.org/10.1007/s10469-026-09823-7openalex-snapshot
Limit Models of Ehrenfeucht Theories
inferred← citeshttps://doi.org/10.1007/s10958-022-06153-8openalex-snapshot
Arithmetical Decidability of Homogeneous and Almost Prime Countable Models of Ehrenfeucht Theories with Arithmetical Types
inferred← citeshttps://doi.org/10.1007/s10958-024-07328-1openalex-snapshot
Computable Boolean Algebras and Complexity of the Fréchet Ideal
inferred← citeshttps://doi.org/10.1016/0003-4843(78)90030-xopenalex-snapshot
Foundations of recursive model theory
inferred← citeshttps://doi.org/10.1016/0168-0072(83)90012-xopenalex-snapshot
Countable algebra and set existence axioms11Research partially supported by NSF grants MCS-79-23743, MCS-78-02558, and MCS 8107867. Simpson's research was also supported by an Alfred P. Sloan Research Fellowship.
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(91)90032-hopenalex-snapshot
Generalizing classical and effective model theory in theories of operations and classes
inferred← citeshttps://doi.org/10.1016/j.apal.2015.04.001openalex-snapshot
WKL0 and induction principles in model theory
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/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)80012-8openalex-snapshot
Chapter 11 A bibliography of recursive algebra and recursive model theory
inferred← citeshttps://doi.org/10.1017/bsl.2021.57openalex-snapshot
IN MEMORIAM: MICHAEL MORLEY, 1930–2020
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.1070/rm2010v065n05abeh004704openalex-snapshot
On autostability of almost prime models relative to strong constructivizations
inferred← citeshttps://doi.org/10.1090/memo/1187openalex-snapshot
Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
inferred← citeshttps://doi.org/10.1090/s0002-9947-1984-0732105-5openalex-snapshot
Degrees of Recursively Saturated Models
inferred← citeshttps://doi.org/10.1093/logcom/ext042openalex-snapshot
Classes of structures with universe a subset of 1
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/s0081543811060071openalex-snapshot
Degrees of autostability relative to strong constructivizations
inferred← citeshttps://doi.org/10.1305/ndjfl/1039724885openalex-snapshot
Computable Models of Theories with Few Models
inferred← citeshttps://doi.org/10.1305/ndjfl/1172787551openalex-snapshot
Computability of Homogeneous Models
inferred← citeshttps://doi.org/10.2140/pjm.1980.91.407openalex-snapshot
Homogeneous models and decidability
inferred← citeshttps://doi.org/10.2178/bsl/1182353917openalex-snapshot
Computability-Theoretic Complexity of Countable Structures
inferred← citeshttps://doi.org/10.2178/jsl/1230396762openalex-snapshot
The degree spectra of homogeneous models
inferred← citeshttps://doi.org/10.2178/jsl/1268917501openalex-snapshot
A computable ℵ0-categorical structure whose theory computes true arithmetic
inferred← citeshttps://doi.org/10.2307/421198openalex-snapshot
1995 European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.33048/semi.2020.17.076openalex-snapshot
A note on decidable categoricity and index sets
inferred← citeshttps://doi.org/10.4213/rm9373openalex-snapshot
Об автоустойчивости относительно сильных конструктивизаций почти простых моделей
inferred← citeshttps://doi.org/10.70675/30f2222azcdbez4074z8e9cz191560d41624openalex-snapshot
Affiner la déobfuscation symbolique et concrète de programmes protégés par des prédicats opaques
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.