Contents
Reviews
J. W. Lloyd. Foundations of logic programming. Symbolic computation. Artifical intelligence. Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1984, x + 124 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 288-289
-
- Article
- Export citation
Moshe Jarden. The elementary theory of ω-free Ax fields. Inventiones mathematicae, vol. 38 no. 2 (1976), pp. 187–206.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 567-568
-
- Article
- Export citation
Other
Notices
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1143-1144
-
- Article
- Export citation
Meeting Report
Open days in set theory and arithmetic, Jachranka, Poland, 1986
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 888-894
-
- Article
- Export citation
Front matter
JSL volume 52 issue 4 Cover and Front matter
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. f1-f2
-
- Article
-
- You have access
- Export citation
Reviews
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.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 289-291
-
- Article
- Export citation
Other
Notices
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 895-896
-
- Article
- Export citation
Reviews
Gregory Cherlin, Lou van den Dries, and Angus Macintyre. Decidability and undecidability theorems for PAC-fields. Bulletin of the American Mathematical Society, n.s. vol. 4 (1981), pp. 101–104.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 568
-
- Article
- Export citation
Front matter
JSL volume 52 issue 3 Cover and Front matter
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. f1-f2
-
- Article
-
- You have access
- Export citation
Reviews
Michael Hallett. Cantorian set theory and limitation of size. Oxford logic guidelines, no. 10. Clarendon Press, Oxford University Press, Oxford and New York1984, xxiii + 343 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 568-570
-
- Article
- Export citation
Nigel Cutland. Computabitity. An introduction to recursive function theory. Cambridge University Press, Cambridge etc. 1980, x + 251 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 292-293
-
- Article
- Export citation
Back matter
JSL volume 52 issue 4 Cover and Back matter and Errata
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. b1-b8
-
- Article
-
- You have access
- Export citation
Reviews
Martin D. Davis and Elaine J. Weyuker. Comparability, complexity, and languages. Fundamentals of theoretical computer science. Computer science and applied mathematics. Academic Press, New York etc. 1983, xix + 425 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 293-294
-
- Article
- Export citation
Back matter
JSL volume 52 issue 3 Cover and Back matter
-
- Published online by Cambridge University Press:
- 12 March 2014, p. b1
-
- Article
-
- You have access
- Export citation
Reviews
Kenneth McAloon. On the sequence of models HODn. Fundamenta mathematicae, vol. 82 (1974), pp. 85–93. - Thomas J. Jech. Forcing with trees and ordinal definability. Annals of mathematical logic, vol. 7 no. 4 (1975), pp. 387–409. - Włodzimierz Zadrożny. Iterating ordinal definability. Annals of pure and applied logic, vol. 24 (1983), pp. 263–310.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 570-571
-
- Article
- Export citation
Richard Laver. On Fraïssé's order type conjecture. Annals of mathematics, ser. 2 vol. 93 (1971), pp. 89–111. - Richard Laver. An order type decomposition theorem. Annals of mathematics, ser. 2 vol. 98 (1973) pp. 96–119. - Richard Laver. Better-quasi-orderings and a class of trees. Studies in foundations and combinatorics, edited by Gian-Carlo Rota, Advances in mathematics supplementary studies, vol. 1, Academic Press, New York, San Francisco, and London, 1978, pp. 31–48. - Saharon Shelah. Better quasi-orders for uncountable cardinals. Israel journal of mathematics, vol. 42 (1982), pp. 177–226.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 571-574
-
- Article
- Export citation
Other
Notices
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 575-576
-
- Article
- Export citation
Meeting Report
European Summer Meeting of the Association for Symbolic Logic, Paris, 1985
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 295-349
-
- Article
- Export citation
Other
Notices
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 351-352
-
- Article
- Export citation
Front matter
JSL volume 52 issue 2 Cover and Front matter
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. f1-f2
-
- Article
-
- You have access
- Export citation