Order: Listing date First author Impact Pub year Relevance Downloads Order
Omitting Types, Type Spectrums, and Decidability. Terrence Millar 1983 - Journal of Symbolic Logic 48 (1):171-181. details Recursive Categoricity and Persistence. Terrence Millar 1986 - Journal of Symbolic Logic 51 (2):430-434. details Prime Models and Almost Decidability. Terrence Millar 1986 - Journal of Symbolic Logic 51 (2):412-420. details David Marker. Degrees of Models of True Arithmetic. Proceedings of the Herbrand Symposium, Logic Colloquium '81, Proceedings of the Herbrand Symposium Held in Marseilles, France, July 1981, Edited by J. Stern, Studies in Logic and the Foundations of Mathematics, Vol. 107, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1982, Pp. 233–242. - Julia Knight, Alistair H. Lachlan, and Robert I. Soare. Two Theorems on Degrees of Models of True Arithmetic. The Journal of Symbolic Logic, Vol. 49 , Pp. 425–436. [REVIEW] Terrence S. Millar 1987 - Journal of Symbolic Logic 52 (2):562-563. details Meeting of the Association for Symbolic Logic: Milwaukee, 1981. Jon Barwise Robert Soare Terrence Millar 1983 - Journal of Symbolic Logic 48 (2):514-518. details Lachlan A. H.. On the Number of Countable Models of a Countable Superstable Theory. Logic Methodology and Philosophy of Science IV, Proceedings of the Fourth International Congress for Logic, Methodology and Philosophy of Science, Bucharest, 1971, Edited by Suppes Patrick Et Al., Studies in Logic and the Foundations of Mathematics, Vol. 74, North-Holland Publishing Company, Amsterdam and London, and American Elsevier Publishing Company, New York, 1973, Pp. 45–56.Lascar Daniel. Ranks and Definability in Superstable Theories. Israel Journal of Mathematics, Vol. 23 , Pp. 53–87. [REVIEW] Terrence Millar 1982 - Journal of Symbolic Logic 47 (1):215-217. details Decidability and the Number of Countable Models. Terrence Millar 1984 - Annals of Pure and Applied Logic 27 (2):137-153. details Model Completions and Omitting Types. Terrence Millar 1995 - Journal of Symbolic Logic 60 (2):654-672. details A Complete, Decidable Theory with Two Decidable Models. Terrence S. Millar 1979 - Journal of Symbolic Logic 44 (3):307-312. details Finite Extensions and the Number of Countable Models. Terrence Millar 1989 - Journal of Symbolic Logic 54 (1):264-270. details Review: A. H. Lachlan, Patrick Suppes, On the Number of Countable Models of a Countable Superstable Theory; Daniel Lascar, Ranks and Definability in Superstable Theories. [REVIEW] Terrence Millar 1982 - Journal of Symbolic Logic 47 (1):215-217. details Review: David Marker, J. Stern, Degrees of Models of True Arithmetic; Julia Knight, Alistair H. Lachlan, Robert I. Soare, Two Theorems on Degrees of Models of True Arithmetic. [REVIEW] Terrence S. Millar 1987 - Journal of Symbolic Logic 52 (2):562-563. details Vaught's Theorem Recursively Revisited. Terrence Millar 1981 - Journal of Symbolic Logic 46 (2):397-411. details
Off-campus access
Using PhilPapers from home?
Create an account to enable off-campus access through your institution's proxy server.
Monitor this page
Be alerted of all new items appearing on this page. Choose how you want to monitor it:
Email
RSS feed
