Contents
Reviews
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
Other
List of Officers and Members of the Association for Symbolic Logic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 462-474
-
- Article
- Export citation
Reviews
John G. Kemeny. Undecidable problems of elementary number theory. Mathematische Annalen, vol. 135 (1958), pp. 160–169.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 359-360
-
- Article
- Export citation
V. A. Uspénskij. Ob algoritmičéskoj svodimosti (On algorithmic reducibility). Trudy Trétégo Vsésoúznogo Matématičéskogo Sézda, Moskva, iún′−iúl′ 1956, vol. 2, Izdatél′stvo Akadémii Nauk SSSR, Moscow1956, pp. 66–69.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 225
-
- Article
- Export citation
J. Łoś. On the categoricity in power of elementary deductive systems and some related problems. Colloquium mathematicum, vol. 3 no. 1 (1954), pp. 58–62.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 360-361
-
- Article
- Export citation
Front matter
JSL volume 23 issue 4 Cover and Front matter
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. f1-f2
-
- Article
-
- You have access
- Export citation
Reviews
R. M. Friedberg. Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post's problem, 1944). Proceedings of the National Academy of Sciences of the United States of America, vol. 43 (1957), pp. 236–238.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 225-226
-
- 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. Jordan. Zur Axiomatik der Verknüpfungsbereiche. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol. 16 (1949), pp. 54–70.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 361
-
- 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
Daniel Lacombe. Sur le semi-réseau constitué par les degrés d'indécidabilité récursive. Comptes rendus hebdomadaires des séances de l'Académie des Sciences (Paris), vol. 239 (1954), pp. 1108–1109.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 226
-
- Article
- Export citation
Back matter
JSL volume 23 issue 4 Cover and Back matter
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. b1-b3
-
- Article
-
- You have access
- Export citation
Reviews
Maurice L'Abbé. Systems of transfinite types involving λ-conversion. The journal of symbolic logic, vol. 18 (1953), pp. 209–224.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 361-362
-
- Article
- Export citation
László Kalmár. Über ein Problem, betreffend die Definition des Begriffes der allgemein-rekursiven Funktion. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 1 (1955), pp. 93–96.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 227
-
- 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
R. L. Goodstein. Recursive number theory. A development of recursive arithmetic in a logic-free equation calculus. Studies in logic and the foundations of mathematics. North-Holland Publishing Company, Amsterdam1957, XII + 190 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 227-228
-
- 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
Kurt Bing. On the axioms of order and succession. The journal of symbolic logic, vol. 22 (1957), pp. 141–144.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 362
-
- Article
- Export citation
Jan Kalicki and Dana Scott. Equational completeness of abstract algebras. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A, vol. 58 (1955), pp. 650–659; also Indagationes mathematicae, vol. 17 (1955), pp. 650–659.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 56-57
-
- Article
- Export citation
Alonzo Church. Introduction to mathematical logic. Volume I. Second printing. Princeton University Press, Princeton1958, x + 378 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 362
-
- Article
- Export citation