16 results
H. B. Enderton. On provable recursive functions. Notre Dame journal of formal logic, vol. 9 no. 1 (1968), pp. 86–88.
-
- Journal:
- The Journal of Symbolic Logic / Volume 38 / Issue 3 / September 1973
- Published online by Cambridge University Press:
- 12 March 2014, pp. 526-527
- Print publication:
- September 1973
-
- Article
- Export citation
Julia Robinson. The undecidability of exponential Diophantine equations. Logic, methodology and philosophy of science, Proceedings of the 1960 International Congress, edited by Ernest Nagel, Patrick Suppes, and Alfred Tarski, Stanford University Press, Stanford, Calif., 1962, pp. 12–13.
-
- Journal:
- The Journal of Symbolic Logic / Volume 35 / Issue 1 / March 1970
- Published online by Cambridge University Press:
- 12 March 2014, p. 152
- Print publication:
- March 1970
-
- Article
- Export citation
Martin Davis, Hilary Putnam, and Julia Robinson. The decision problem for exponential diophantine equations. Annals of mathematics, second series vol. 74 (1961), pp. 425–436.
-
- Journal:
- The Journal of Symbolic Logic / Volume 35 / Issue 1 / March 1970
- Published online by Cambridge University Press:
- 12 March 2014, pp. 151-152
- Print publication:
- March 1970
-
- Article
- Export citation
C. E. M. Yates. Recursively enumerable sets and retracing functions. Zeitschrift für mathematische logik und Grundlagen der Mathematik, vol. 8 (1962), pp. 331–345.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 3 / 09 October 1967
- Published online by Cambridge University Press:
- 12 March 2014, p. 394
- Print publication:
- 09 October 1967
-
- Article
- Export citation
C. E. M. Yates. Three theorems on the degrees of recursively enumerable sets. Duke mathematical journal, vol. 32 (1965), pp. 461–468.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 3 / 09 October 1967
- Published online by Cambridge University Press:
- 12 March 2014, pp. 394-395
- Print publication:
- 09 October 1967
-
- Article
- Export citation
A. A. Mučnik. Réšénié problémy svodimosti Posta i nékotoryh drugih problém téorii algorifmou. I. (Solution of Post's reduction problem and of certain other problems in the theory of algorithms. I.) Trudy Moskovskogo Matématičéskogo Obščéstva, vol. 7 (1958), pp. 391–405.
-
- Journal:
- The Journal of Symbolic Logic / Volume 30 / Issue 1 / March 1965
- Published online by Cambridge University Press:
- 12 March 2014, p. 90
- Print publication:
- March 1965
-
- Article
- Export citation
Clifford Spector. Measure-theoretic construction of incomparable hyperdegrees. The journal of symbolic logic, vol. 23 (for 1958, pub. 1959), pp. 280–288.
-
- Journal:
- The Journal of Symbolic Logic / Volume 27 / Issue 2 / June 1962
- Published online by Cambridge University Press:
- 12 March 2014, p. 242
- Print publication:
- June 1962
-
- Article
- Export citation
J. R. Shoenfield. Open sentences and the induction axiom. The journal of symbolic logic, vol. 23 no. 1 (1958), pp. 7–12.
-
- Journal:
- The Journal of Symbolic Logic / Volume 27 / Issue 1 / March 1962
- Published online by Cambridge University Press:
- 12 March 2014, pp. 90-91
- Print publication:
- March 1962
-
- Article
- Export citation
Gödel numberings of partial recursive functions
-
- Journal:
- The Journal of Symbolic Logic / Volume 23 / Issue 3 / September 1958
- Published online by Cambridge University Press:
- 12 March 2014, pp. 331-341
- Print publication:
- September 1958
-
- 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.
-
- Journal:
- The Journal of Symbolic Logic / Volume 23 / Issue 2 / June 1958
- Published online by Cambridge University Press:
- 12 March 2014, p. 226
- Print publication:
- June 1958
-
- Article
- Export citation
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.
-
- Journal:
- The Journal of Symbolic Logic / Volume 23 / Issue 2 / June 1958
- Published online by Cambridge University Press:
- 12 March 2014, pp. 225-226
- Print publication:
- June 1958
-
- Article
- Export citation
A. A. Mučnik. Nérazréšimost′ problémy svodimosti téorii algoritmov (Negative answer to the problem of reducibility of the theory of algorithms). Doklady Akadéimii Nauk SSSR, vol. 108 (1956), pp. 194–197.
-
- Journal:
- The Journal of Symbolic Logic / Volume 22 / Issue 2 / June 1957
- Published online by Cambridge University Press:
- 12 March 2014, pp. 218-219
- Print publication:
- June 1957
-
- Article
- Export citation
S. C. Kleene and Emil L. Post. The upper semi-lattice of degrees of recursive unsolvability. Annals of mathematics, ser. 2 vol. 59 (1954), pp. 379–407.
-
- Journal:
- The Journal of Symbolic Logic / Volume 21 / Issue 4 / December 1956
- Published online by Cambridge University Press:
- 12 March 2014, pp. 407-408
- Print publication:
- December 1956
-
- Article
- Export citation
H. Hermes and H. Scholz. Mathematische Logik. Enzyklopädie der mathematischen Wissenschaften, Band I, Algebra und Zahlentheorie, 1. Teil, Heft 1, Teil I, B.G. Teubner, Leipzig1952, 82 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 19 / Issue 4 / December 1954
- Published online by Cambridge University Press:
- 12 March 2014, pp. 278-282
- Print publication:
- December 1954
-
- Article
- Export citation
Heinrich Scholz. Vorlesungen über Grundzüge der mathematischen Logik. Second, revised edition, vol. 1. Rotaprint. Ausarbeitungen mathematischer und physikalischer Vorlesungen, vol. VI. Aschendorffsche Verlagsbuchhandlung, Münster (Westf.)1950, XIV + 276 pp. - Heinrich Scholz. Vorlesungen über Grundzüge der mathematischen Logik. Second, revised edition, vol. 2. Rotaprint. Ausarbeitungen mathematischer und physikalischer Vorlesungen, vol. VII. Aschendorffsche Verlagsbuchhandlung, Münster (Westf.)1951, VII + 192 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 19 / Issue 2 / June 1954
- Published online by Cambridge University Press:
- 12 March 2014, pp. 115-118
- Print publication:
- June 1954
-
- Article
- Export citation
Andrzej Grzegorczyk. Undecidability of some topological theories. Fundamenta mathematicae, vol. 38 (for 1951, pub. 1952), pp. 137–152.
-
- Journal:
- The Journal of Symbolic Logic / Volume 18 / Issue 1 / March 1953
- Published online by Cambridge University Press:
- 12 March 2014, pp. 73-74
- Print publication:
- March 1953
-
- Article
- Export citation