Contents
Reviews
W. A. Pogorzelski. Structural completeness of the propositional calculus. English with Russian summary. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 19 (1971), pp. 349–351.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 604-605
-
- Article
- Export citation
Witold A. Pogorzelski. The deduction theorem for Łukasiewicz many-valued propositional calculi. English with Polish and Russian summaries. Studio logica, vol. 15 (1964), pp. 7–23.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 605-606
-
- Article
- Export citation
Witold A. Pogorzelski. On the scope of the classical deduction theorem. The journal of symbolic logic, vol. 33 (1968), pp. 77–81.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 606
-
- Article
- Export citation
Timothy Smiley. Syllogism and quantification. The journal of symbolic logic, vol. 27 no. 1 (for 1962, pub. 1963), pp. 58–72. - William Tuthill Parry. Quantification of the predicate and many-sorted logic. Philosophy and phenomenological research, vol. 26 no. 3 (1966), pp. 342–360.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 606-607
-
- Article
- Export citation
Alice Ambrose and Morris Lazerowitz. Fundamentals of symbolic logic. Revised edition of XIV 191. Holt, Rinehart and Winston, Inc., New York 1962, 328 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 607-608
-
- Article
- Export citation
David Makinson. Remarks on the concept of distribution in traditional logic. Noûs, vol. 3 (1969), pp. 103–108.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 608-609
-
- Article
- Export citation
Ernst Schröder. Vorlesungen über die Algebra der Logik (exacte Logik). Second edition, Volume I. A reprint of 427 with Schroder's corrections. Chelsea Publishing Company, Bronx 1966, IX + 721 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 609-614
-
- Article
- Export citation
F. D. Parker. Boolean matrices and logic. Mathematics magazine, vol. 37 (1964), pp. 33–38. - Hugh G. Campbell. Linear algebra with applications including linear programming. Appleton-Century-Crofts, Educational Division, Meredith Corporation, New York 1971, xiii + 396 + A45 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 614-615
-
- Article
- Export citation
Frederic B. Fitch. Algebraic simplification of redundant sequential circuits. Synthese, vol. 15 (1963), pp. 155–166. Reprinted in Form and strategy in science, Dordrecht 1964, pp. 191-202.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 615
-
- Article
- Export citation
Dana Scott. Some definitional suggestions for automata theory. Journal of computer and system sciences, vol. 1 (1967), pp. 187–212.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 615-616
-
- Article
- Export citation
Patrick C. Fischer, Albert R. Meyer, and Arnold L. Rosenberg. Time-restricted sequence generation. Journal of computer and system sciences, vol. 4 (1970), pp. 50–73.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 616-617
-
- Article
- Export citation
Shen Lin and Tibor Rado. Computer studies of Turing machine problems. Journal of the Association for Computing Machinery, vol. 12 (1965), pp. 196–212. - Allen H. Brady. The conjectured highest scoring machines for Rado's Σ(k) for the value k = 4. IEEE transactions on electronic computers, vol. EC-15 (1966), pp. 802–803. - Milton W. Green. A lower bound on Rado's sigma function for binary Turing machines. Switching circuit theory and logical design, Proceedings of the Fifth Annual Symposium, Princeton University, Princeton, N.J., November 11-13, 1964, The Institute of Electrical and Electronics Engineers, Inc., New York 1964, pp. 91–94.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 617
-
- Article
- Export citation
Richard M. Karp. Reducibility among combinatorial problems. Complexity of computer computations, Proceedings of a Symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Center, Yorktown Heights, New York, edited by Raymond E. Miller and James W. Thatcher, Plenum Press, New York and London 1972, pp. 85–103.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 618-619
-
- Article
- Export citation
Ann Yasuhara. Recursive function theory and logic. Academic Press, New York and London 1971, xv + 338 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 619-620
-
- Article
- Export citation
Rózsa Péter. Über die Verallgemeinerung der Theorie der rekursiven Funktionen für abstrakte Mengen geeigneter Struktur ah Definitionsbereiche. Acta mathematica Academiae Scientiarum Hungaricae, vol. 12 (1961), pp. 271–314, and vol. 13 (1962), pp. 1-24.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 620-621
-
- Article
- Export citation
Frieder Schwenkel. Rekursive Wortfunktionen über unendlichen Alphabeten. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 (1965), pp. 133–147.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 621-622
-
- Article
- Export citation
Rósza Péter. Zum Beitrag von F. Schwenkel “Rekursive Wortfunktionen uber unendlichen Alphabeten.” Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 (1965), pp. 377–378. - F. Schwenkel. Entgegnung. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 (1965), pp. 379–380.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 622
-
- Article
- Export citation
Michael O. Rabin. Weakly definable relations and special automata. Mathematical logic and foundations of set theory, Proceedings of an international colloquium held under the auspices of the Israel Academy of Sciences and Humanities, Jerusalem, 11-14 November 1968, edited by Yehoshua Bar-Hillel, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam and London 1970, pp. 1–23.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 622-623
-
- Article
- Export citation
Michael O. Rabin. Automata on infinite objects and Church's problem. Conference Board of the Mathematical Sciences, Regional conference series in mathematics, no. 13. American Mathematical Society, Providence 1972, 22 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 623
-
- Article
- Export citation
Michael O. Rabin. Decidability and definability in second-order theories. Actes du Congrès International des Mathématiciens 1970, Gauthier-Villars, Paris 1971, Vol. 1, pp. 239–244.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 623
-
- Article
- Export citation