13629 results in The Journal of Symbolic Logic
C. T. Chong. Techniques of admissible recursion theory. Lecture notes in mathematics, vol. 1106. Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1984, ix + 214 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 285-287
- Print publication:
- March 1987
-
- Article
- Export citation
Definability in number fields
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 152-155
- Print publication:
- March 1987
-
- Article
- Export citation
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 (1982), pp. 151–161. - Julia Knight and Mark Nadel. Expansions of models and Turing degrees. The journal of symbolic logic, vol. 47 (1982), pp. 587–604. - Julia Knight and Mark Nadel. Models of arithmetic and closed ideals. The journal of symbolic logic, vol. 47 no. 4 (for 1982, pub. 1983), pp. 833–840. - Henryk Kotlarski. On elementary cuts in models of arithmetic. Fundamenta mathematicae, vol. 115 (1983), pp. 27–31. - H. Kotlarski, S. Krajewski, and A. H. Lachlan. Construction of satisfaction classes for nonstandard models. Canadian mathematical bulletin—Bulletin canadien de mathématiques, vol. 24 (1981), pp. 283–293. - A. H. Lachlan. Full satisfaction classes and recursive saturation. Canadian mathematical bulletin—Bulletin canadien de mathématiques, pp. 295–297. - Leonard Lipshitz and Mark Nadel. The additive structure of models of arithmetic. Proceedings of the American Mathematical Society, vol. 68 (1978), pp. 331–336. - Mark Nadel. On a problem of MacDowell and Specker. The journal of symbolic logic, vol. 45 (1980), pp. 612–622. - C. Smoryński. Back-and-forth inside a recursively saturated model of arithmetic. 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. 273–278. - C. Smoryński and J. Stavi. Cofinal extension preserves recursive saturation. Model theory of algebra and arithmetic, Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic held at Karpacz, Poland, September 1–7,1979, edited by L. Pacholski, J. Wierzejewski, and A. J. Wilkie, Lecture notes in mathematics, vol. 834, Springer-Verlag, Berlin, Heidelberg, and New York, 1980, pp. 338–345. - George Wilmers. Minimally saturated models. Model theory of algebra and arithmetic, Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic held at Karpacz, Poland, September 1–7, 1979, edited by L. Pacholski, J. Wierzejewski, and A. J. Wilkie, Lecture notes in mathematics, vol. 834, Springer-Verlag, Berlin, Heidelberg, and New York, 1980, pp. 370–380.
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 279-284
- Print publication:
- March 1987
-
- Article
- Export citation
Concerning ultrafilters on ultrapowers
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 149-151
- Print publication:
- March 1987
-
- Article
- Export citation
Harvey M. Friedman, Stephen G. Simpson, and Rick L. Smith. Countable algebra and set existence axioms. Annals of pure and applied logic, vol. 25 (1983), pp. 141–181. - Harvey M. Friedman, Stephen G. Simpson, and Rick L. Smith. Addendum to “Countable algebra and set existence axioms.” Annals of pure and applied logic, vol. 28 (1985), pp. 319–320.
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 276-278
- Print publication:
- March 1987
-
- Article
- Export citation
Notices
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 351-352
- Print publication:
- March 1987
-
- Article
- Export citation
Monadic second order definable relations on the binary tree
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 219-226
- Print publication:
- March 1987
-
- Article
- Export citation
JSL volume 52 issue 1 Cover and Front matter
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. f1-f2
- Print publication:
- March 1987
-
- Article
-
- You have access
- Export citation
Remarks on weak notions of saturation in models of Peano arithmetic
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 129-148
- Print publication:
- March 1987
-
- Article
- Export citation
Simple r. e. degree structures
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 208-213
- Print publication:
- March 1987
-
- Article
- Export citation
A. J. Kfoury, Robert N. Moll, and Michael A. Arbib. A programming approach to computability. The AKM series in theoretical computer science. Springer-Verlag, New York, Heidelberg, and Berlin, 1982, viii + 251 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 289-291
- Print publication:
- March 1987
-
- Article
- Export citation
Elimination of quantifiers for ordered valuation rings
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 116-128
- Print publication:
- March 1987
-
- Article
- Export citation
European Summer Meeting of the Association for Symbolic Logic, Paris, 1985
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 295-349
- Print publication:
- March 1987
-
- Article
- Export citation
A note on a proof of Hilbert's second ε-theorem
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 214-215
- Print publication:
- March 1987
-
- Article
- Export citation
Sequential discreteness and clopen-I-Boolean classes
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 232-242
- Print publication:
- March 1987
-
- Article
- Export citation
Elementary axioms for canonical points of toposes
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 202-204
- Print publication:
- March 1987
-
- Article
- Export citation
A constructive interpretation of the full set theory
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 172-201
- Print publication:
- March 1987
-
- Article
- Export citation
Modules of existentially closed algebras
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 54-63
- Print publication:
- March 1987
-
- Article
- Export citation
Nigel Cutland. Computabitity. An introduction to recursive function theory. Cambridge University Press, Cambridge etc. 1980, x + 251 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 292-293
- Print publication:
- March 1987
-
- Article
- Export citation
Completeness of transfinite evaluation in an extension of the lambda calculus
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 243-275
- Print publication:
- March 1987
-
- Article
- Export citation