Reviews
Heinrich Behmann. Ein logischer Abakus. Archiv für mathematische Logik und Grundlagenforschung, vol. 4 (1958), pp. 42–52.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 450
-
- Article
- Export citation
Georg Kreisel, Daniel Lacombe, and Joseph R. Shoenfield. Fonctionnelles récursivement définissables et fonctionnelles récursives. Comptes rendus hebdomadaires des séances de l'Académie des Sciences (Paris), vol. 245 (1957), pp. 399–402.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 48
-
- Article
- Export citation
Paul R. Halmos. Polyadic Boolean algebras. Proceedings of the National Academy of Sciences of the United States of America, vol. 40 (1954), pp. 296–301.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 223
-
- Article
- Export citation
Carl G. Hempel. A logical appraisal of operationism. The scientific monthly, vol. 79 (1954), pp. 215–220.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 354-356
-
- Article
- Export citation
Thomas Storer. An analysis of logical positivism. Methodos, vol. 3 (1951), pp. 245–272. - Ferruccio Rossi-Landi. Discussion. Methodos, vol. 3 (1951), pp. 273–274.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 356-357
-
- Article
- Export citation
H. G. Rice. On completely recursively enumerable classes and their key arrays. The journal of symbolic logic, vol. 21 (1956), pp. 304–308.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 48
-
- Article
- Export citation
Paul R. Halmos. The basic concepts of algebraic logic. The American mathematical monthly, vol. 63 (1956), pp. 363–387.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 223
-
- Article
- Export citation
Mens rea and murder by torture in California. Stanford law review, vol. 10 no. 4 (1958), pp. 672–693.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 450-451
-
- Article
- Export citation
Annibale Pastore. Dei vantaggi che possono trarre gli economisti dagli studi di logics moderna. L'industria, Rivista di economia politico, fasc. 4 (1951), pp. 489–502. - F. di Fenizio. Che può la logistica per le scienze sociali?L'industria, Rivista di economia politico, fasc. 4 (1951), p. 598; ristampato in Che può la logistica per le scienze sociali?, Editrice L'industria, Milano 1951, p. 3. - O. Morgenstern. Logistica e scienze sociali. L'industria, Rivista di economia politico, fasc. 4 (1951), pp. 599–606; ristampato Che può la logistica per le scienze sociali?, Editrice L'industria, Milano 1951, p. 4—11. - K. Menger. Una teoria esatta dei gruppi e delle relazioni sociali. L'industria, Rivista di economia politico, fasc. 4 (1951), pp. 607–614; ristampato Che può la logistica per le scienze sociali?, Editrice L'industria, Milano 1951, pp. 12–19.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 451-455
-
- Article
- Export citation
Jan Berg. A note on dispositional concepts. Philosophy and phenomenological research, vol. 16 no. 1 (1956), pp. 121–123. - Jan Berg. A note on reduction sentences. Theoria (Lund), vol. 24 (1958), pp. 1–8.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 357
-
- Article
- Export citation
N. D. Gautam. The validity of equations of complex algebras. Archiv für mathematische Logik und Grundlagenforschung, vol. 3 (1957), pp. 117–124.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 224
-
- Article
- Export citation
W. Markwald. Zur Eigenschaft primitiv-rekursiver Funktionen, unendlich viele Werte anzunehmen. Fundamerita mathematicae, vol. 42 (1955), pp. 166–167.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 48
-
- Article
- Export citation
Norman Shapiro. Degrees of computability. Transactions of the American Mathematical Society, vol. 82 (1956), pp. 281–299.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 48-49
-
- Article
- Export citation
Evert Willem Beth. La sémantique et sa portée philosophique. Semantica – Archivio di jilosofia, 1955 no. 3, Fratelli Bocca Editori, Rome 1955, pp. 41–62.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 357-358
-
- Article
- Export citation
Michael O. Rabin. Effective computability of winning strategies. Contributions to the theory of games, Volume III, Annals of Mathematics studies number 39, Princeton University Press, Princeton, New Jersey, 1957, pp. 147–157.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 224
-
- Article
- Export citation
Meeting Report
Twenty-Third Annual Meeting of the Association for Symbolic Logic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 456-461
-
- Article
- Export citation
Reviews
A. A. Mučnik. Ob otdélimosti rékursivno-péréčislimyh množestv (On separability of recursively enumerable sets). Doklady Akadémii Nauk SSSR, vol. 109 (1956), pp. 29–32.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 224-225
-
- Article
- Export citation
Roger Martin. Raisonnement mathématique et récurrence. Les études philosophiques, n.s. vol. 11 (1956), pp. 242–262.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 358-359
-
- Article
- Export citation
V. A. Uspénskij. Vyčislimyé opéracii i ponátié programmy (Calculable operations and the notion of a program). Uspéhi matématičéskih nauk, vol. 11 no. 4 (1956), pp. 172–176.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 49
-
- Article
- Export citation
Other
The Association for Symbolic Logic
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 461
-
- Article
- Export citation