Reviews
Steven Orey. On ω-consistency and related properties. The journal of symbolic logic, vol. 21 (1956), pp. 246–252.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 40-41
-
- Article
- Export citation
Jean Porte. Un système de postulats pour le calcul des prédicats. Comptes rendus hebdomadaires des séances de l'Académie des Sciences (Paris), vol. 245 (1957), pp. 817–819.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 41
-
- Article
- Export citation
Steven Orey. Formal development of ordinal number theory. The journal of symbolic logic, vol. 20 (1955), pp. 95–104. - Steven Orey. On the relative consistency of set theory. The journal of symbolic logic, vol. 21 (1956), pp. 280–290.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 41-42
-
- Article
- Export citation
George E. Collins. Distributivity and an axiom of choice. The journal of symbolic logic, vol. 19 (1954), pp. 275–277.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 42
-
- Article
- Export citation
Elliott Mendelson. Some proofs of independence in axiomatic set theory. The journal of symbolic logic, vol. 21 (1956), pp. 291–303. - Elliott Mendelson. The independence of a weak axiom of choice. The journal of symbolic logic, pp. 350–366.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 42-44
-
- Article
- Export citation
Andrzej Mostowski. Development and applications of the “projective” classification of sets of integers. Proceedings of the International Congress of Mathematicians 1954, Amsterdam September 2-September 9, Volume III, 1956, Erven P. Noordhoff N.V., Groningen, und North-Holland Publishing Co., Amsterdam, S. 280–288.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 44-45
-
- Article
- Export citation
A. Mostowski. On a system of axioms which has no recursively enumerable arithmetic model. Fundamenta mathematicae, Bd. 40 (1953), S. 56–61. - A. Mostowski. A formula with no recursively enumerable model. Ebd., Bd. 42 (1955), S. 125–140.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 45
-
- Article
- Export citation
A. Mostowski. On recursive models of formalised arithmetic. Bulletin de l'Académie Polonaise des Sciences, Classe III, vol. 5 (1957), pp. 705–710.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 45-46
-
- Article
- Export citation
A. Grzegorczyk. Some proofs of undecidability of arithmetic. Fundamenta mathematicae, vol. 43 (1956), pp. 166–177.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 46-47
-
- Article
- Export citation
J. W. Addison and S. C. Kleene. A note on function quantification. Proceedings of the American Mathematical Society, vol. 8 (1957), pp. 1002–1006.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 47-48
-
- 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
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
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
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
V. A. Uspénskij. Néskol'ko zaméčanij o péréčislimyh množéstvah (Some notes on recursively enumerable sets). Russian, with brief English summary. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 3 (1957), pp. 157–170.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 49-50
-
- Article
- Export citation
P. S. Novikov. Ob algoritmičéskoj nérazréšimosti problémy toždéstva slov v téorii grupp (Algorithmic unsolvability of the word problem in group theory). Trudy Matématičéskogo Instituta iméni V. A. Stéklova, vol. 44. Izdatél'stvo Akadémii Nauk SSSR, Moscow1955, 143 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 50-52
-
- Article
- Export citation
P. S. Novikov. Nérazréšmost' problémy soprázénnosti v térii grupp (Unsolvability of the conjugacy problem in group theory). Izvéstiá Akadémii Nauk SSSR, Séria mat., vol. 18 (1954), pp. 485–524.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 52-54
-
- Article
- Export citation
S. I. Adán. Algoritmičéskaá nérazréšmost' problém raspoznavaniá nékotoryh svojstv grupp (The algorithmic unsolvability of the problem of checking certain properties of groups). Doklady Akadémii Nauk SSSR, vol. 103 (1955), pp. 533–535. - S. I. Adán. Konéčnooprédélénnyé gruppy i algoritmy (Finitely generated groups and algorithms). Uspéhi matématičiskih nauk, vol. 12 no. 3 (1957), pp. 248–249.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 54
-
- Article
- Export citation
Michael O. Rabin. Recursive unsolvability of group theoretic problems. Annals of mathematics, ser. 2 vol. 67 (1958), pp. 172–194.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 55-56
-
- Article
- Export citation