Contents
Reviews
Richard L. Poss. A note on a lemma of J. W. Addison. Notre Dame journal of formal logic, vol. 11 (1970), pp. 337–339.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 334
-
- Article
- Export citation
David Isles. Regular ordinals and normal forms. Intuitionism and proof theory, Proceedings of the summer conference at Buffalo N. Y. 1968, edited by A. Kino, J. Myhill, and R. E. Vesley, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam and London1970, pp. 339–361.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 334-335
-
- Article
- Export citation
Shaligram Singh. The independence of a strong axiom of choice. The mathematical gazette, vol. 46 (1962), pp. 126–129.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 335
-
- Article
- Export citation
Thomas J. Jech. Two remarks on elementary embeddings of the universe. Pacific journal of mathematics, vol. 39 (1971), pp. 395–400.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 335-336
-
- Article
- Export citation
Dana Scott. On constructing models for 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, and Paris, 1961, pp. 235–255.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 336-337
-
- Article
- Export citation
M. Makkai. On the model theory of denumerably long formulas with finite strings of quantifiers. The journal of symbolic logic, vol. 34 (1969), pp. 437–459.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 337
-
- Article
- Export citation
John Staples. A non-standard representation of Boolean algebras, and applications. The bulletin of the London Mathematical Society, vol. 1 (1969), pp. 315–320.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 337
-
- Article
- Export citation
Aubert Daigneault. Operations in polyadic algebras. Transactions of the American Mathematical Society, vol. 158 (1971), pp. 219–229.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 337-338
-
- Article
- Export citation
S. I. Adjan. Defining relations and algorithmic problems for groups and semigroups. English translation of XXXVIII 357 by M. Greendlinger. Proceedings of the Steklov Institute of Mathematics, no. 85 (for 1966, pub. 1967), American Mathematical Society, Providence1967, iii + 152 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 338-339
-
- Article
- Export citation
John T. Kearns. Combinatory logic with discriminators. The journal of symbolic logic, vol. 34 (1969), pp. 561–575.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 339-340
-
- Article
- Export citation
Hugo Bedau and Paul Oppenheim. Complementarity in quantum mechanics: A logical analysis. Synthese, vol. 13 (1961), pp. 201–232.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 340
-
- Article
- Export citation
Herbert B. Enderton. A mathematical introduction to logic. Academic Press, New York and London1972, xiv + 295 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 340-341
-
- Article
- Export citation
R. Martin. Logique mathématique. Encyclopaedia universalis, Encyclopaedia Universalis France, Éditeur, Paris, vol. 10 (1971), pp. 52–53. - G. Sabbagh. Logique mathématique. 1. Généralités. Encyclopaedia universalis, Encyclopaedia Universalis France, Éditeur, Paris, vol. 10 (1971), pp. 53–56. - I. Reznikoff. Logique mathématique. 2. Théorie lie la démonstration et intuitionnisme. Encyclopaedia universalis, Encyclopaedia Universalis France, Éditeur, Paris, vol. 10 (1971), pp. 57–64. - G. Sabbagh. Logique mathématique. 3. Théorie des modèles. Encyclopaedia universalis, Encyclopaedia Universalis France, Éditeur, Paris, vol. 10 (1971), pp. 65–66. - G. Sabbagh. Logique mathématique. 4. Théorie axiomatique des ensembles. Encyclopaedia universalis, Encyclopaedia Universalis France, Éditeur, Paris, vol. 10 (1971), pp. 66–71. - G. Sabbagh. Logique mathématique. 5. Décidabilité et fonctions récursives. Encyclopaedia universalis, Encyclopaedia Universalis France, Éditeur, Paris, vol. 10 (1971), pp. 71–73.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 341
-
- Article
- Export citation
Ian Hacking. A concise introduction to logic. Random House, New York and Toronto1972, VIII + 339 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 341
-
- Article
- Export citation
James F. Gray. Sets, relations, and functions. Holt, Rinehart and Winston, Inc., New York, Chicago, San Francisco, Toronto, and London, 1962, xii + 143 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 341
-
- Article
- Export citation
Alice Mary Hilton. Logic, computing machines, and automation. Spartan Books, Washington, D.C., and Cleaver-Hume Press, London, 1963, xxi + 427 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 341-342
-
- Article
- Export citation
R. V. Možarov. Ob odnom priznaké polnoty sistémy funkcij algébry logiki (On a sign of completeness of functions system of logic algebra). Avtomatika i téléméhanika, vol. 26, (1965), pp. 1644–1645. - R. V. Mozharov. One method for testing the completeness of systems of logical functions. English translation of the preceding. Automation and remote control, vol. 26 (for 1965, pub. 1966), pp. 1592–1593.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 343
-
- Article
- Export citation
John E. Hopcroft and Jeffrey D. Ullman. Relations between time and tape complexities. Journal of the Association for Computing Machinery, vol. 15 (1968), pp. 414–427.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 343
-
- Article
- Export citation
G. N. Povarov. Matématiko-logičéskoe isslédovanié sintéza kontaktnyh shém s odnim vhodom i k vyhodami (A mathematical theory for the synthesis of contact networks with one input and k outputs). A reprint of XXXV 175 with minor corrections. Logičéskié isslédovaniá, Sbornik statéj, Izdatél′stvo Akadémii Nauk SSSR, Moscow1959, pp. 379–405.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 343-344
-
- Article
- Export citation
Meeting Report
Meeting of the Association for Symbolic Logic, New York 1969
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 348-358
-
- Article
- Export citation