A Complete, Decidable Theory with Two Decidable Models. - Terrence Millar (J. Symb. Log., 1979)

Vaught's Theorem Recursively Revisited. - Terrence Millar (J. Symb. Log., 1981)

Meeting of the Association for Symbolic Logic: Milwaukee, 1981. - Jon Barwise; Robert I. Soare; Terrence Millar (J. Symb. Log., 1983)

Omitting Types, Type Spectrums, and Decidability. - Terrence Millar (J. Symb. Log., 1983)

Decidability and the number of countable models. - Terrence Millar (Ann. Pure Appl. Log., 1984)

Prime Models and Almost Decidability. - Terrence Millar (J. Symb. Log., 1986)

Recursive Categoricity and Persistence. - Terrence Millar (J. Symb. Log., 1986)

Finite Extensions and the Number of Countable Models. - Terrence Millar (J. Symb. Log., 1989)

Model Completeness and Omitting Types. - Terrence Millar (J. Symb. Log., 1995)

Pure Recursive Model Theory. - Terrence Millar (Handbook of Computability Theory, 1999)