Reviews
Anand Pillay, The geometry of forking and groups of finite Morley rank, The journal of symbolic logic, vol. 60 (1995), pp. 1251–1259.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 906
-
- Article
- Export citation
Front matter
JSL volume 64 issue 1 Cover and Front matter
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. f1-f2
-
- Article
-
- You have access
- Export citation
Reviews
Ehud Hrushovski and Boris Zilber. Zariski geometries, Journal of the American Mathematical Society, vol. 9 (1996), pp. 1–56.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 906-908
-
- Article
- Export citation
J. Roger Hindley. Basic simple type theory. Cambridge tracts in theoretical computer science, no. 42. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1997, xi + 186 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1832-1833
-
- Article
- Export citation
Back matter
JSL volume 64 issue 1 Cover and Back matter
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. b1-b2
-
- Article
-
- You have access
- Export citation
Reviews
Ya'acov Peterzil and Sergei Starchenko, A trichotomy theorem for o-minimal structures, Proceedings of the London Mathematical Society, ser. 3 vol. 77 (1998), pp. 481–523.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 908-910
-
- Article
- Export citation
Jean-Pierre Ginisti. La logique combinatoire. Qui sais-je? no. 3205. Presses Universitaires de France, Paris1997, 127 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1833-1834
-
- Article
- Export citation
A. J. Wilkie, Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function, Journal of the American Mathematical Society, vol. 9 (1996), pp. 1051–1094.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 910-913
-
- Article
- Export citation
Bob Carpenter. Type-logical semantics. Language, speech, and communication series. Bradford books. The MIT Press, Cambridge, Mass., and London, 1997, xxi + 575 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1835-1836
-
- Article
- Export citation
Tomoyuki Yamakami. Polynomial games and determinacy, Annals of pure and applied logic, vol. 80 (1996), pp. 1–16.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 913
-
- Article
- Export citation
Jon Barwise and Jerry Seligman. Information flow. The logic of distributed systems. Cambridge tracts in theoretical computer science, no. 44. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1997, xv + 274 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 1836
-
- Article
- Export citation
Fahiem Bacchus. Representing and reasoning with probabilistic knowledge. A logical approach to probabilities. The MIT Press, Cambridge, Mass., and London, 1991 (©1990), xvii + 233 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 1837
-
- Article
- Export citation
Nicholas Pippenger, Theories of computability. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1997, ix + 251 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 913-914
-
- Article
- Export citation
J.-J. Ch. Meyer and W. Van Der Hoek. Epistemic logic for AI and computer science. Cambridge tracts in theoretical computer science, no. 41. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1995, xiii + 354 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1837-1840
-
- Article
- Export citation
Neil D. Jones, Computability and complexity, From a programming perspective, Foundations of computing, The MIT Press, Cambridge, Mass., and London, 1997, xvi + 466 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 914-916
-
- Article
- Export citation
Jon Barwise and John Etchemendy, The language of first-order logic, including the IBM-compatible Windows version of Tarski's world 4.0. Third edition of LVIII 362. CSLI lecture notes.no. 34. Center for the Study of Language and Information, Stanford 1992. also distributed by Cambridge University Press, New York, xiv + 319 pp. + disk.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 916-918
-
- Article
- Export citation
Henry Prakken. Logical tools for modelling legal argument. A study of defeasible reasoning in law. Law and philosophy library, vol. 32. Kluwer Academic Publishers, Dordrecht, Boston, and London, 1997, xiii + 314 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1840-1841
-
- Article
- Export citation
John C. Mitchell. Foundations for programming languages. Foundations of computing. The MIT Press, Cambridge, Mass., and London, 1996, xix + 846 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 918-922
-
- Article
- Export citation
Lambèr M. M. Royakkers. Extending deontic logic for the formalisation of legal rules. Law and philosophy library, vol. 36. Kluwer Academic Publishers, Dordrecht, Boston, and London, 1998, ix + 191 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1841-1842
-
- Article
- Export citation
Shaughan Lavine. Understanding the infinite. Harvard University Press, Cambridge, Mass., and London, 1994, ix + 372 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1843-1845
-
- Article
- Export citation