13629 results in The Journal of Symbolic Logic
Comparing notions of similarity for uncountable models
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1153-1167
- Print publication:
- December 1995
-
- Article
- Export citation
Minimal readability of intuitionistic arithmetic and elementary analysis
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1208-1241
- Print publication:
- December 1995
-
- Article
- Export citation
Raymond M. Smullyan. Recursion theory for metamathematics. Oxford logic guides, no. 22. Oxford University Press, New York and Oxford1993, xiv + 163 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1324-1326
- Print publication:
- December 1995
-
- Article
- Export citation
Analytic equivalence relations and Ulm-type classifications
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1273-1300
- Print publication:
- December 1995
-
- Article
- Export citation
The syntax and semantics of entailment in duality theory
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1087-1114
- Print publication:
- December 1995
-
- Article
- Export citation
Raymond M. Smullyan. Gödel's incompleteness theorems. Oxford logic guides, no. 19. Oxford University Press, New York and Oxford1992, xiii + 139 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1320-1324
- Print publication:
- December 1995
-
- Article
- Export citation
Index of reviews
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1331-1336
- Print publication:
- December 1995
-
- Article
- Export citation
A dichotomy for the definable universe
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1199-1207
- Print publication:
- December 1995
-
- Article
- Export citation
Embeddability and the word problem
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1194-1198
- Print publication:
- December 1995
-
- Article
- Export citation
Vladimir A. Uspensky. Godel's incompleteness theorem. A reprint of LV 889 with minor corrections. Theoretical computer science, vol. 130 (1994), pp. 239–319.
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, p. 1320
- Print publication:
- December 1995
-
- Article
- Export citation
Daniel J. Velleman. How to prove it. A structured approach. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1994, x + 309 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1329-1330
- Print publication:
- December 1995
-
- Article
- Export citation
Zohar Manna and Richard Waldinger. The logical basis for computer programming. Volume I. Deductive reasoning. Addison-Wesley series in computer science. Addison-Wesley Publishing Company, Reading, Mass., etc., 1985, xii + 618 pp. - Zohar Manna and Richard Waldinger. The logical basis for computer programming. Volume II. Deductive systems. Addison-Wesley series in computer science. Addison-Wesley Publishing Company, Reading, Mass., etc., 1990, xiii + 642 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1326-1327
- Print publication:
- December 1995
-
- Article
- Export citation
JSL Volume 60 issue 4 Cover and Front matter
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. f1-f2
- Print publication:
- December 1995
-
- Article
-
- You have access
- Export citation
A reflection principle and its applications to nonstandard models
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1137-1152
- Print publication:
- December 1995
-
- Article
- Export citation
Logic programming languages, constraints, functions, and objects, edited by K. R. Apt, J. W. de Bakker, and J. J. M. M. Rutten, Logic programming, The MIT Press, Cambridge, Mass., and London, 1993, xiv + 204 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1327-1328
- Print publication:
- December 1995
-
- Article
- Export citation
The undecidability of the Π4-theory for the r.e. wtt and Turing degrees
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1118-1136
- Print publication:
- December 1995
-
- Article
- Export citation
Jody Azzouni. Metaphysical myths, mathematical practice. The ontology and epistemology of the exact sciences. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1994, ix + 249 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 4 / December 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1312-1314
- Print publication:
- December 1995
-
- Article
- Export citation
Logic from computer science, Proceedings of a workshop held November 13–17, 1989, edited by Y. N. Moschovakis, Mathematical Sciences Research Institute publications, vol. 21, Springer-Verlag, New York etc. 1992, xi + 608 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 3 / September 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1021-1022
- Print publication:
- September 1995
-
- Article
- Export citation
Tailoring recursion for complexity
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 3 / September 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 952-969
- Print publication:
- September 1995
-
- Article
- Export citation
Arithmetic, proof theory, and computational complexity, edited by Peter Clote and Krajíček Jan, Oxford logic guides, no. 23, Clarendon Press, Oxford University Press, Oxford and New York1993, xiii + 428 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 3 / September 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1014-1017
- Print publication:
- September 1995
-
- Article
- Export citation