Search the dblp DataBase
Terrence Millar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Jon Barwise, Robert I. Soare, Terrence Millar
Meeting of the Association for Symbolic Logic: Milwaukee, 1981. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1983, v:48, n:2, pp:514-518 [Journal] - Terrence Millar
A Complete, Decidable Theory with Two Decidable Models. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1979, v:44, n:3, pp:307-312 [Journal] - Terrence Millar
Vaught's Theorem Recursively Revisited. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1981, v:46, n:2, pp:397-411 [Journal] - Terrence Millar
Omitting Types, Type Spectrums, and Decidability. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1983, v:48, n:1, pp:171-181 [Journal] - Terrence Millar
Prime Models and Almost Decidability. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1986, v:51, n:2, pp:412-420 [Journal] - Terrence Millar
Recursive Categoricity and Persistence. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1986, v:51, n:2, pp:430-434 [Journal] - Terrence Millar
Finite Extensions and the Number of Countable Models. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1989, v:54, n:1, pp:264-270 [Journal] - Terrence Millar
Model Completeness and Omitting Types. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1995, v:60, n:2, pp:654-672 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002