On the public citation graph

Theories with three countable models

https://doi.org/10.1007/bf01669839
0 signed · 23 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/bf02218589openalex-snapshot
On complete theories with a finite number of denumerable models
inferredcites →https://doi.org/10.1007/bf02218638openalex-snapshot
Constructivizability of superatomic Boolean algebras
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1142/9789812564894_0028openalex-snapshot
Denumerable models of complete theories
inferredcites →https://doi.org/10.2307/2273520openalex-snapshot
Theories with a finite number of countable models
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.4064/fm-81-2-107-119openalex-snapshot
Remarks on countable 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.19980440203openalex-snapshot
On Theories Having Three Countable Models
inferred← citeshttps://doi.org/10.1007/bf01982116openalex-snapshot
Nonessential extensions of complete theories
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-021-09650-yopenalex-snapshot
Algebras of Distributions of Binary Isolating Formulas for Almost ω-Categorical Weakly o-Minimal Theories
inferred← citeshttps://doi.org/10.1007/s10469-025-09789-yopenalex-snapshot
The Number of Countable Models of a Complete Theory and of Its Inessential Extension
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.1134/s0037446621010067openalex-snapshot
Almost $ \omega $-Categorical Weakly $ o $-Minimal Theories of Convexity Rank 1
inferred← citeshttps://doi.org/10.1134/s0037446621060082openalex-snapshot
A Criterion for Binarity of Almost $ \omega $-Categorical Weakly $ o $-Minimal Theories
inferred← citeshttps://doi.org/10.1134/s1995080221040132openalex-snapshot
$${P}^{{*}}$$-Combinations of Almost $${\omega}$$-Categorical Weakly o-Minimal Theories
inferred← citeshttps://doi.org/10.1134/s1995080224600687openalex-snapshot
Non-Essential Expansions of Quite o-Minimal Theories
inferred← citeshttps://doi.org/10.2307/2275029openalex-snapshot
Finite extensions and the number of countable models
inferred← citeshttps://doi.org/10.33048/semi.2020.17.011openalex-snapshot
A. D. Taimanov and model theory in Kazakhstan
inferred← citeshttps://doi.org/10.55452/1998-6688-2022-19-2-20-28openalex-snapshot
ON (p, q)-SPLITTING FORMULAS IN ALMOST OMEGA-CATEGORICAL WEAKLY O-MINIMAL THEORIES
inferred← citeshttps://doi.org/10.55452/1998-6688-2022-19-2-6-12openalex-snapshot
ON DATABASE QUERIES OVER A WEAKLY O-MINIMAL DOMAIN WITH A SMALL COUNTABLE SPECTRUM
inferred← citeshttps://doi.org/10.55452/1998-6688-2023-20-2-49-56openalex-snapshot
PROPERTIES OF HYPERGRAPHS OF MODELS OF WEAKLY O-MINIMAL THEORIES
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.