1995 |
8 | | Terrence Millar:
Model Completeness and Omitting Types.
J. Symb. Log. 60(2): 654-672 (1995) |
1989 |
7 | | Terrence Millar:
Finite Extensions and the Number of Countable Models.
J. Symb. Log. 54(1): 264-270 (1989) |
1986 |
6 | | Terrence Millar:
Prime Models and Almost Decidability.
J. Symb. Log. 51(2): 412-420 (1986) |
5 | | Terrence Millar:
Recursive Categoricity and Persistence.
J. Symb. Log. 51(2): 430-434 (1986) |
1983 |
4 | | Terrence Millar:
Omitting Types, Type Spectrums, and Decidability.
J. Symb. Log. 48(1): 171-181 (1983) |
3 | | Jon Barwise,
Robert I. Soare,
Terrence Millar:
Meeting of the Association for Symbolic Logic: Milwaukee, 1981.
J. Symb. Log. 48(2): 514-518 (1983) |
1981 |
2 | | Terrence Millar:
Vaught's Theorem Recursively Revisited.
J. Symb. Log. 46(2): 397-411 (1981) |
1979 |
1 | | Terrence Millar:
A Complete, Decidable Theory with Two Decidable Models.
J. Symb. Log. 44(3): 307-312 (1979) |