Correction
Errata
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. v-vi
-
- Article
- Export citation
Research Article
A theorem on hyperhypersimple sets
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 273-278
-
- Article
- Export citation
Addendum to early history of the Association for Symbolic Logic
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 279
-
- Article
- Export citation
Persistence and Herbrand expansions1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 280-282
-
- Article
- Export citation
Reviews
Reviews - J. Ritter. Vorwort. Mathesis universalis; Abhandlungen zur Philosophie als strenger Wissenschaft, by Heinrich Scholz, edited by Hans Hermes, Friedrich Kambartel, and Joachim Ritter, Benno Schwabe & Co. Verlag, Basel and Stuttgart1961, pp. 7–16.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 283-288
-
- Article
- Export citation
Hao Wang. The axiomatic method. A survey of mathematical logic, Studies in logic and the foundations of mathematics, Science Press, Peking, and North-Holland Publishing Company, Amsterdam, 1963, pp. 1–33.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 288
-
- Article
- Export citation
Hao Wang. Eighty years of foundational studies. A survey of mathematical logic, Studies in logic and the foundations of mathematics, Science Press, Peking, and North-Holland Publishing Company, Amsterdam, 1963, pp. 34–56. A reprint of XXVIII 173.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 288
-
- Article
- Export citation
Hao Wang. On formalization. A survey of mathematical logic, Studies in logic and the foundations of mathematics, Science Press, Peking, and North-Holland Publishing Company, Amsterdam, 1963, pp. 57–67. A reprint of XXII 292.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 288
-
- Article
- Export citation
Hao Wang. The axiomatization of arithmetic. A survey of mathematical logic, Studies in logic and the foundations of mathematics, Science Press, Peking, and North-Holland Publishing Company, Amsterdam, 1963, pp. 68–81. A reprint of XXVII 77.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 288
-
- Article
- Export citation
Hao Wang. A variant to Turing's theory of computing machines. Journal of the Association for Computing Machinery, vol. 4 (1957), pp. 63–92. Reprinted as A variant to Turing's theory of calculating machines, in A survey of mathematical logic, by Hao Wang, Studies in logic and the foundations of mathematics, Science Press, Peking, and North-Holland Publishing Company, Amsterdam, 1963, pp. 127–159. - Hao Wang. Universal Turing machines: an exercise in coding. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 3 (1957), pp. 69–80. Reprinted in A survey of mathematical logic, by Hao Wang, Studies in logic and the foundations of mathematics. Science Press, Peking, and North-Holland Publishing Company, Amsterdam, 1963, pp. 160–174.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 288-289
-
- Article
- Export citation
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
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
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
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
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
Günter Asser. Funktionen-Algorithmen und Graphschemata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 (1961), pp. 20–27.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 292
-
- Article
- Export citation
William W. Boone. Partial results regarding word problems and recursively enumerable degrees of unsolvability. Bulletin of the American Mathematical Society, vol. 68 (1962), pp. 616–623.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 292
-
- Article
- Export citation
Toshio Nishimura. On a certain system with infinite induction. Journal of the Mathematical Society of Japan, vol. 12 (1960), pp. 392–400.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 293
-
- Article
- Export citation
J. W. Addison. Some consequences of the axiom of constructibility. Fundamenta mathematicae, vol. 46 (1959), pp. 337–357.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 293
-
- Article
- Export citation
Raili Kauppi. Freedom and imperatives. Ajatus, vol. 24 (1962), pp. 67–73.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 294
-
- Article
- Export citation