Other Versions
No versions found
(no proxy)My notes
Similar books and articles
Jon Barwise and John Schlipf. On recursively saturated models of arithmetic. Model theory and algebra, A memorial tribute to Abraham Robinson, edited by D. H. Saracino and V. B. Weispfenning, Lecture notes in mathematics, vol. 498, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 42–55. - Patrick Cegielski, Kenneth McAloon, and George Wilmers. Modèles récursivement saturés de l'addition et de la multiplication des entiers naturels. Logic Colloquium '80, Papers intended for the European summer meeting of the Association for Symbolic Logic, edited by D. van Dalen, D. Lascar, and T. J. Smiley, Studies in logic and the foundations of mathematics, vol. 108, North-Holland Publishing Company, Amsterdam, New York, and London, 1982, pp. 57–68. - Julia F. Knight. Theories whose resplendent models are homogeneous. Israel journal of mathematics, vol. 42 , pp. 151–161. - Julia Knight and Mark Nadel. Expansions of models and Turing degrees. The journal of symbolic logic, vol. 47 , pp. 58. [REVIEW]J. -P. Ressayre -1987 -Journal of Symbolic Logic 52 (1):279-284.
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.
Haim Gaifman. Models and types of Peano's arithmetic. Annals of mathematical logic, vol. 9, pp. 223–306. - Julia F. Knight. Omitting types in set theory and arithmetic. The journal of symbolic logic, vol. 41 , pp. 25–32. - Julia F. Knight. Hanf numbers for omitting types over particular theories. The journal of symbolic logic, vol. 41 , pp. 583–588. - Fred G. Abramson and Leo A. Harrington. Models without indiscernibles. The journal of symbolic logic, vol. 41 , vol. 43 , pp. 572–600. [REVIEW]J. P. Ressayre -1983 -Journal of Symbolic Logic 48 (2):484-485.
Chris Ash, Julia Knight, Mark Manasse, and Theodore Slaman. Generic copies of countable structures. Annals of pure and applied logic, vol. 42 , pp. 195–205. [REVIEW]Ivan N. Soskov -1993 -Journal of Symbolic Logic 58 (3):1078-1079.
Local initial segments of the Turing degrees.Bjørn Kjos-Hanssen -2003 -Bulletin of Symbolic Logic 9 (1):26-36.
Jump embeddings in the Turing degrees.Peter G. Hinman &Theodore A. Slaman -1991 -Journal of Symbolic Logic 56 (2):563-591.
Amenable equivalence relations and Turing degrees.Alexander S. Kechris -1991 -Journal of Symbolic Logic 56 (1):182-194.
On the $\Sigma_2$-Theory of the Upper Semilattice of Turing Degrees.Carl G. Jockusch &Theodore A. Slaman -1993 -Journal of Symbolic Logic 58 (1):193-204.
Uniform Upper Bounds on Ideals of Turing Degrees.Harold T. Hodes -1978 -Journal of Symbolic Logic 43 (3):601-612.
Corrigendum: ``Contiguity and distributivity in the enumerable Turing degrees''.Rodney G. Downey &Steffen Lempp -2002 -Journal of Symbolic Logic 67 (4):1579-1580.
Analytics
Added to PP
2009-01-28
Downloads
52 (#462,852)
6 months
4 (#1,002,927)
2009-01-28
Downloads
52 (#462,852)
6 months
4 (#1,002,927)
Historical graph of downloads
How can I increase my downloads?Citations of this work
Which set existence axioms are needed to prove the separable Hahn-Banach theorem?Douglas K. Brown &Stephen G. Simpson -1986 -Annals of Pure and Applied Logic 31:123-144.
A standard model of Peano Arithmetic with no conservative elementary extension.Ali Enayat -2008 -Annals of Pure and Applied Logic 156 (2):308-318.
The Borel Complexity of Isomorphism for Theories with Many Types.David Marker -2007 -Notre Dame Journal of Formal Logic 48 (1):93-97.
Representing Scott sets in algebraic settings.Alf Dolich,Julia F. Knight,Karen Lange &David Marker -2015 -Archive for Mathematical Logic 54 (5-6):631-637.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers -1971 -Journal of Symbolic Logic 36 (1):141-146.
Home |New books and articles |Bibliographies |Philosophy journals |About PhilPapers |API |Contact us |Code of conduct
PhilPapers logo byAndrea Andrews andMeghan Driscoll.
This site uses cookies and Google Analytics (see ourterms & conditions for details regarding the privacy implications).Use of this site is subject toterms & conditions.
All rights reserved byThe PhilPapers Foundation
Server: philpapers-web-54b44b69b7-72j75 uwo