10 results
Model completions and omitting types
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 2 / June 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 654-672
- Print publication:
- June 1995
-
- Article
- Export citation
Finite extensions and the number of countable models
-
- Journal:
- The Journal of Symbolic Logic / Volume 54 / Issue 1 / March 1989
- Published online by Cambridge University Press:
- 12 March 2014, pp. 264-270
- Print publication:
- March 1989
-
- Article
- Export citation
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 (1984), pp. 425–436.
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 2 / June 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 562-563
- Print publication:
- June 1987
-
- Article
- Export citation
Recursive categoricity and persistence
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 2 / June 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 430-434
- Print publication:
- June 1986
-
- Article
- Export citation
Prime models and almost decidability
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 2 / June 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 412-420
- Print publication:
- June 1986
-
- Article
- Export citation
Meeting of the Association for Symbolic Logic, Milwaukee, 1981
-
- Journal:
- The Journal of Symbolic Logic / Volume 48 / Issue 2 / June 1983
- Published online by Cambridge University Press:
- 12 March 2014, pp. 514-518
- Print publication:
- June 1983
-
- Article
- Export citation
Omitting types, type spectrums, and decidability1
-
- Journal:
- The Journal of Symbolic Logic / Volume 48 / Issue 1 / March 1983
- Published online by Cambridge University Press:
- 12 March 2014, pp. 171-181
- Print publication:
- March 1983
-
- Article
- Export citation
A. H. Lachlan. 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 Patrick Suppes 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. - Daniel Lascar. Ranks and definability in superstable theories. Israel journal of mathematics, vol. 23 (1976), pp. 53–87.
-
- Journal:
- The Journal of Symbolic Logic / Volume 47 / Issue 1 / March 1982
- Published online by Cambridge University Press:
- 12 March 2014, pp. 215-217
- Print publication:
- March 1982
-
- Article
- Export citation
Vaught's theorem recursively revisited1
-
- Journal:
- The Journal of Symbolic Logic / Volume 46 / Issue 2 / June 1981
- Published online by Cambridge University Press:
- 12 March 2014, pp. 397-411
- Print publication:
- June 1981
-
- Article
- Export citation
A complete, decidable theory with two decidable models1
-
- Journal:
- The Journal of Symbolic Logic / Volume 44 / Issue 3 / September 1979
- Published online by Cambridge University Press:
- 12 March 2014, pp. 307-312
- Print publication:
- September 1979
-
- Article
- Export citation