Reviews
Alonzo Church. Application of recursive arithmetic to the problem of circuit synthesisSummaries of talks presented at the Summer Institute for Symbolic Logic Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N. J., 1960, pp. 3–50. 3a-45a.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 289-290
-
- Article
- Export citation
Research Article
The system CΔ of combinatory logic1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 87-97
-
- Article
- Export citation
Reviews
R. M. Friedberg. The fine structure of degrees of unsolvability of recursively enumerable sets. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 404–406.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 166
-
- Article
- Export citation
Julio Rey Pastor. Apuntes de teoria de los conjuntos abstractos. Lithographed. Universidad Nacional de Cuyo, Facultad de Ciencias de la Educación, Instituto de Matemáticas, San Luis, Argentina, 1957, 55 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 250-251
-
- Article
- Export citation
S. C. Kleene. Disjunction and existence under implication in elementary intuitionistic formalisms. The Journal of symbolic logic, vol. 27 (for 1962, pub. 1963), pp. 11–18.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 166-167
-
- Article
- Export citation
Gonzalo Zubieta R. Definiciones formales de numerabilidad. Boletin de la Sociedad Matemática Mexicana, ser. 2, vol. 1 no. 1 (1956), pp. 49–56.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 251
-
- Article
- Export citation
Sheldon B. AkersJr., A truth table method for the synthesis of combinational logic. IRE transactions on electronic computers, vol. EC-10 (1961), pp. 604–615.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 290
-
- Article
- Export citation
R. L. Goodstein. Mathematical logic. Leicester University Press, Leicester1957, viii + 104 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 98-99
-
- Article
- Export citation
Michael O. Rabin. On recursively enumerable and arithmetic models of set theory. The Journal of symbolic logic, vol. 23 no. 4 (for 1958, pub. 1959), pp. 408–416.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 167-168
-
- Article
- Export citation
Alan Ross Anderson and Nüel D. BelnapJr., A simple treatment of truth functions. The journal of symbolic logic, vol. 24 no. 4 (for 1959, pub. 1961), pp. 301–302.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 291
-
- Article
- Export citation
Vladeta Vučković. Partially ordered recursive arithmetics. Mathematica Scandinavica, vol. 7 (1959), pp. 305–320. - Vladeta Vučković. Einführung von Σƒ(x) und Πƒ(x) in der rekursiven Gitterpunktarithmetik. German, with Bulgarian and Russian summaries. B′lgarska Akadémia na Naukité, Izvéstiá na Matématičéskiá Institut, vol. 6 (1962), pp. 15–25.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 251-252
-
- Article
- Export citation
J. Richard Büchi. Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 6 (1960), pp. 66–92. - J. Richard Büchi. On a decision method in restricted second order arithmetic. 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. 1–11.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 100-102
-
- Article
- Export citation
S. Mrówka. On the ideals' extension theorem and its equivalence to the axiom of choice. Fundamenta mathematicae vol. 43 (1956), pp. 46–49. - S. Mrówka. Two remarks on my paper: “On the ideals' extension theorem and its equivalence to the axiom of choice.”Fundamenta mathematicae vol. 46 (1958), pp. 165–166. - Bernhard Banaschewski. On some theorems equivalent with the axiom of choice. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 (1961), pp. 279–282.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 168
-
- Article
- Export citation
A. Grzegorczyk. A theory without recursive models. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 10 (1962), pp. 63–69.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 102-103
-
- Article
- Export citation
R. L. Goodstein. Models of propositional calculi in recursive arithmetic. Mathematica Scandinavica, vol. 6 (1958), pp. 293–296.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 291
-
- Article
- Export citation
Robert W. Ritchie. Classes of predictably computable functions. Transactions of the American Mathematical Society, vol. 106 (1963), pp. 139–173.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 252-253
-
- Article
- Export citation
Vladeta Vučkovič. Rekurzivni modeli nekih neklasičnih izkaznih rečuna (Rekursive Modelle einiger nichtklassischen Aussagenkalküle). Filozofija (Belgrade), vol. 4 no. 4 (1960), pp. 69–84.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 291-292
-
- Article
- Export citation
Abraham A. Fraenkel. Abstract set theory. Second, completely revised edition. Studies in logic and the foundations of mathematics. North-Holland Publishing Company, Amsterdam1961, VIII + 295 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 168-169
-
- Article
- Export citation
S. Jaśkowski. Example of a class of systems of ordinary differential equations having no decision method for existence problems. Bulletin de l'Académie Polonaise des Sciences, classe troisième, vol. 2 (1954), pp. 155–157. - S. Jaśkowski. Primér klassa sistém obyknovénnyh différéncial′nyh uravnénij, né iméúščégo algorifma razréšmosti dlá problém o suščéstvovanii. Russian version of the preceding. Búllétén′ Pol′skoj Akadémii Nauk, Otd. 3, vol. 2 (1954), pp. 153–155.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 103
-
- Article
- Export citation
Guido Küng. Bibliography of Soviet work in the field of mathematical logic and the foundations of mathematics, from 1917–1957. Notre Dame journal of formal logic, vol. 3 (1962), pp. 5–40. - I. M. Bocheński. Preface (to the above). Notre Dame journal of formal logic, vol. 3 (1962), pp. 1–4.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 253-254
-
- Article
- Export citation