Contents
Reviews
A. Robinson. Model theory and non-standard arithmetic. Infinitistic methods, Proceedings of the Symposium on Foundations of Mathematics, Warsaw, 2–9 September 1959, Państwowe Wydawnictwo Naukowe, Warsaw, and Pergamon Press, Oxford-London-New York-Paris, 1961, pp. 265–302.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 149
-
- Article
- Export citation
R. V. Fréjvald. Funkcional′naá polnota dlá né vsúdu oprédélénnyh funkcij algébry logiki (Functional completeness for incompletely specified logic functions). Diskrétnyj analiz (Novosibirsk), no. 8 (1966), pp. 55–68.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 592-593
-
- Article
- Export citation
A. Włodzimierz Mostowski. On the decidability of some problems in special classes of groups. Fundamenta mathematicae, vol. 59 (1966), pp. 123–135. - A. Włodzimierz Mostowski. Computational algorithms for deciding some problems for nilpotent groups. Fundamenta mathematicae, vol. 59 (1966), pp. 137–152.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 476-477
-
- Article
- Export citation
Manley Thompson. Categories. The encyclopedia of philosophy, edited by Paul Edwards, The Macmillan Company & The Free Press, New York, and Collier-Macmillan Limited, London, 1967, Vol. 2, pp. 46–55.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 303
-
- Article
- Export citation
Donald J. Collins. Recursively enumerable degrees and the conjugacy problem. Acta mathematica, vol. 122 no. 1–2 (1969), pp. 115–160.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 477
-
- Article
- Export citation
Alan R. White. Coherence theory of truth. The encyclopedia of philosophy, edited by Paul Edwards, The Macmillan Company & The Free Press, New York, and Collier-Macmillan Limited, London, 1967, Vol. 2, pp. 130–133.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 303
-
- Article
- Export citation
H. A. Pogorzelski. Nonconcatenative abstract Skolem arithmetics. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, Bd. 11 (1965), S. 89–92, 249–252, 373–376.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 150
-
- Article
- Export citation
V. V. Vojtišék. Ob odnom podhodé к klassifikacii bulévyh funkcij (On an approach to the classification of Boolean functions). Diskrétnyj analiz (Novosibirsk), no. 8 (1966), pp. 35–41.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 593
-
- Article
- Export citation
M. H. Löb. Concatenation as basis for a complete system of arithmetic. The journal of symbolic logic, vol. 18 (1953), pp. 1–6. - M. H. Löb. Formal systems of constructive mathematics. The journal of symbolic logic, vol. 21 (1956), pp. 63–75.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 150
-
- Article
- Export citation
O. B. Lupanov. Ob odnom métodé sintéza shém (On a method of circuit synthesis). Izvéstiá vysših učébnyh zavédénij, Radiofizika, no. 1 (1958), pp. 120–140.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 593-594
-
- Article
- Export citation
R. S. Walters. Contrary-to-fact conditional. The encyclopedia of philosophy, edited by Paul Edwards, The Macmillan Company & The Free Press, New York, and Collier-Macmillan Limited, London, 1967, Vol. 2, pp. 212–216.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 303-304
-
- Article
- Export citation
Paul R. Young. An effective operator, continuous but not partial recursive. Proceedings of the American Mathematical Society, vol. 19 (1968), pp. 103–108.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 477-478
-
- Article
- Export citation
A. N. Prior. Correspondence theory of truth. The encyclopedia of philosophy, edited by Paul Edwards, The Macmillan Company & The Free Press, New York, and Collier-Macmillan Limited, London, 1967, Vol. 2, pp. 223–232.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 304
-
- Article
- Export citation
Martin Davis, Hilary Putnam, and Julia Robinson. The decision problem for exponential diophantine equations. Annals of mathematics, second series vol. 74 (1961), pp. 425–436.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 151-152
-
- Article
- Export citation
Patrick C. Fischer. A note on bounded-truth-table reducibility. Proceedings of the American Mathematical Society, vol. 14 (1963), pp. 875–877.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 478
-
- Article
- Export citation
Erwin Engeler. Formal languages: Automata and structures. Markham Publishing Company, Chicago1968, vii + 81 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 594-595
-
- Article
- Export citation
Max Black. Craig's theorem. The encyclopedia of philosophy, edited by Paul Edwards, The Macmillan Company & The Free Press, New York, and Collier-Macmillan Limited, London, 1967, Vol. 2, pp. 249–251.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 304
-
- Article
- Export citation
A. H. Lachlan. Some notions of reducibility and productiveness. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 (1965), pp. 17–44.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 478
-
- Article
- Export citation
James R. Slagle. Automatic theorem proving with renamable and semantic resolution. Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 687–697.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 595-596
-
- Article
- Export citation
Julia Robinson. The undecidability of exponential Diophantine equations. Logic, methodology and philosophy of science, Proceedings of the 1960 International Congress, edited by Ernest Nagel, Patrick Suppes, and Alfred Tarski, Stanford University Press, Stanford, Calif., 1962, pp. 12–13.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 152
-
- Article
- Export citation