Theories with three countable models

Theory of Recursive Functions and Effective Computability.

Solomon Feferman, Hartley Rogers · American Mathematical Monthly · 1969 · 2.8K citations

Computing, Computer Science, Mathematics +14

Theory of Recursive Functions and Effective Computability

D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text

Computing, Computer Science, Mathematics +14

Denumerable models of complete theories

Robert L. Vaught · CO-PUBLISHED WITH SINGAPORE UNIVERSITY PRESS eBooks · 2003 · 138 citations

Computing, Computer Science, Mathematics +9

Constructivizability of superatomic Boolean algebras

Algebra and Logic · 1973 · 39 citations

Natural Sciences, Computer Science, Mathematics +11

On complete theories with a finite number of denumerable models

M. G. Peretyat’kin · Algebra and Logic · 1973 · 38 citations

Natural Sciences, Mathematics, Set Theory +5