Contents
Reviews
Yiannis N. Moschovakis. Many-one degrees of the predicates Ha(x). Pacific journal of mathematics, vol. 18 (1966), pp. 329–342.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 529-530
-
- Article
- Export citation
Miguel Sánchez-Mazas. Sobre la estructura de la lógica modal. Episteme, Anuario de filosofia (Caracas), for 1961–63, pub. 1965, pp. 347–361.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 399-400
-
- Article
- Export citation
Hao Wang. The mechanization of mathematical arguments. Experimental arithmetic, high speed computing and mathematics, Proceedings of symposia in applied mathematics, vol. 15, American Mathematical Society, Providence 1963, pp. 31–40.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 120
-
- Article
- Export citation
Robert McNaughton. Unate truth functions. IRE transactions on electronic computers, vol. EC-10 (1961), pp. 1–6.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 263
-
- Article
- Export citation
A. Ehrenfeucht and S. Feferman. Representability of recursively enumerable sets informal theories. Archiv für mathematische Logik und Grundlagenforschung, vol. 5 no. 1–2 (1959), pp. 37–41.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 530
-
- Article
- Export citation
Richard Montague. Logical necessity, physical necessity, ethics, and quantifiers. Inquiry (Oslo), vol. 3 (1960), pp. 259–269.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 400-401
-
- Article
- Export citation
E. J. McCluskeyJr., Minimal sums for Boolean functions having many unspecified fundamental products. Switching circuit theory and logical design, Proceedings of the Second Annual Symposium, Detroit, Mich., October 17–20,1961, and papers from the First Annual Symposium, Chicago, III., October 9–14,1960, American Institute of Electrical Engineers, New York1961, pp. 10–17; also Transactions of the American Institute of Electrical Engineers, vol. 81 part 1 (1962), pp. 387–392.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 263-264
-
- Article
- Export citation
J. Hartmanis and R. E. Stearns. On the computational complexity of algorithms. Transactions of the American Mathematical Society, vol. 117 (1965), pp. 285–306.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 120-121
-
- Article
- Export citation
Solomon Feferman. Transfinite recursive progressions of axiomatic theories. The journal of symbolic logic, vol. 27 no. 3 (for 1962, pub. 1963), pp. 259–316.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 530-531
-
- Article
- Export citation
J. Hartmanis and R. E. Stearns. Computational complexity of recursive sequences. 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 York1964, pp. 82–90.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 121-122
-
- Article
- Export citation
Timothy Smiley. Relative necessity. The journal of symbolic logic, vol. 28 no. 2 (for 1963, pub. 1964), pp. 113–134. - T. J. Smiley. The logical basis of ethics. Proceedings of a Colloquium on Modal and Many-valued Logics, Helsinki, 23–26 August, 1962, Acta Philosophica Fennica, no. 16, Helsinki1963, pp. 237–246.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 401
-
- Article
- Export citation
R. W. House and T. Rado. On a computer program for obtaining irreducible representations for two-level multiple input-output logical systems. Journal of the Association for Computing Machinery, vol. 10 (1963), pp. 48–77. (See Erratum, ibid., p. 256.)
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 264-265
-
- Article
- Export citation
R. W. House and T. Rado. A generalization of Nelson's algorithm for obtaining prime implicants. The journal of symbolic logic, vol. 30 (1965), pp. 8–12.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 265
-
- Article
- Export citation
Keith Lehrer and Richard Taylor. Time, truth and modalities. Mind, n.s. vol. 74 (1965), pp. 390–398.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 401-402
-
- Article
- Export citation
S. Feferman and C. Spector. Incompleteness along paths in progressions of theories. The journal of symbolic logic, vol. 27 no. 4 (for 1962, pub. 1963), pp. 383–390.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 531
-
- Article
- Export citation
J. C. Shepherdson und H. E. Sturgis. Computability of recursive functions. Journal of the Association for Computing Machinery, Bd. 10 (1963), S. 217–255.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 122-123
-
- Article
- Export citation
J. W. Swanson. A reduction theorem for normal algorithms. The journal of symbolic logic, vol. 31 (1966), pp. 86–97.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 123
-
- Article
- Export citation
Jaakko Hintikka. Aristotle and the “Master Argument” of Diodorus. American philosophical quarterly, vol. 1 (1964), pp. 101–114.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 402
-
- Article
- Export citation
B. Dunham, R. Fridshal, and G. L. Sward. A non-heuristic program for proving elementary logical theorems. English, with French, German, Russian, and Spanish summaries. Information processing, Proceedings of the International Conference on Information Processing, Unesco, Paris 15–20 June 1959, Unesco, Paris, R. Oldenbourg, Munich, and Butterworths, London, 1960, pp. 282–285. - B. Dunham, R. Fridshal, and J. H. North. Exploratory mathematics by machine. Recent developments in information and decision processes, edited by Robert E. Machol and Paul Gray, The Macmillan Company, New York1962, pp. 149–160. - B. Dunham and J. H. North. Theorem testing by computer. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N. Y., April 24, 25, 26, 1962, Microwave Research Symposia series vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, pp. 173–177.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 266
-
- Article
- Export citation
Daniel Lacombe. Sur la méthode extensive en métamathématique. La revue scientifique, vol. 85 (1947), pp. 515–518.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 531
-
- Article
- Export citation