On the public citation graph
On complete theories with a finite number of denumerable models
0 signed · 39 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/bf02219289openalex-snapshot
Constructive models of complete solvable theories
inferredcites →https://doi.org/10.1007/bf02219296openalex-snapshot
Some aspects of generalized computability
inferredcites →https://doi.org/10.1007/bf02219840openalex-snapshot
Strongly constructive models and numerations of the Boolean algebra of recursive sets
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.202000045openalex-snapshot
Weakly binary expansions of dense meet‐trees
inferred← citeshttps://doi.org/10.1007/978-0-387-69245-6_3openalex-snapshot
Computability and Computable Models
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-94-011-2080-7_5openalex-snapshot
Homogeneous Directed Graphs
inferred← citeshttps://doi.org/10.1007/bf01669839openalex-snapshot
Theories with three countable models
inferred← citeshttps://doi.org/10.1007/bf01674780openalex-snapshot
Criterion for strong constructivizability of a homogeneous model
inferred← citeshttps://doi.org/10.1007/bf02760641openalex-snapshot
Theories with only a finite number of existentially complete models
inferred← citeshttps://doi.org/10.1007/bf02764005openalex-snapshot
Extending partial isomorphisms for the small index property of many ω-categorical structures
inferred← citeshttps://doi.org/10.1007/s00153-005-0323-xopenalex-snapshot
On constants and the strict order property
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-010-0069-9openalex-snapshot
Hypergraphs of prime models and distributions of countable models of small 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.1016/0095-8956(79)90078-9openalex-snapshot
There are four countable ultrahomogeneous graphs without triangles
inferred← citeshttps://doi.org/10.1016/0097-3165(91)90018-copenalex-snapshot
On k-homogeneous posets and graphs
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)90053-oopenalex-snapshot
A decidable Ehrenfeucht theory with exactly two hyperarithmetic 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.1016/s0049-237x(99)80031-7openalex-snapshot
Pure Recursive Model Theory
inferred← citeshttps://doi.org/10.1017/9781316717035openalex-snapshot
Fundamentals of Stability Theory
inferred← citeshttps://doi.org/10.1017/s0022481200051239openalex-snapshot
A note on countable complete theories having three isomorphism types of countable models
inferred← citeshttps://doi.org/10.1070/rm2010v065n05abeh004704openalex-snapshot
On autostability of almost prime models relative to strong constructivizations
inferred← citeshttps://doi.org/10.1093/logcom/exq043openalex-snapshot
On constructive models of theories with linear Rudin-Keisler ordering
inferred← citeshttps://doi.org/10.1215/00294527-3153579openalex-snapshot
Semi-Isolation and the Strict Order Property
inferred← citeshttps://doi.org/10.2298/pim140318001iopenalex-snapshot
Groups with finitely many countable models
inferred← citeshttps://doi.org/10.2307/2273425openalex-snapshot
Decidability and ℵ0-categoricity of theories of partially ordered sets
inferred← citeshttps://doi.org/10.2307/2273520openalex-snapshot
Theories with a finite number of countable models
inferred← citeshttps://doi.org/10.2307/2275003openalex-snapshot
Annual Meeting of the Association for Symbolic Logic, Los Angeles, 1989
inferred← citeshttps://doi.org/10.2307/2275029openalex-snapshot
Finite extensions and the number of countable models
inferred← citeshttps://doi.org/10.4153/cjm-1993-014-0openalex-snapshot
On the Divisibility of Homogeneous Directed Graphs
inferred← citeshttps://doi.org/10.4213/rm9373openalex-snapshot
Об автоустойчивости относительно сильных конструктивизаций почти простых моделей
inferred← citeshttps://doi.org/10.55452/1998-6688-2025-22-2-260-266openalex-snapshot
EXAMPLES OF O-MINIMAL EXPANSIONS OF THE DENSE MEET TREE
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.