- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Works by Hartley Rogers
22 found
Order:
- Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
- (2 other versions)Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Mathematical Logic Quarterly 5 (7‐13):117-125.
- (1 other version)Gödel numberings of partial recursive functions.Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (3):331-341.
- The Present Theory of Turing Machine Computability.C. E. M. Yates & Hartley Rogers - 1966 - Journal of Symbolic Logic 31 (3):513.
- Cambridge Summer School in Mathematical Logic.A. R. D. Mathias & Hartley Rogers (eds.) - 1973 - New York,: Springer Verlag.
- (1 other version)Grzegorczyk Andrzej. Undecidability of some topological theories. Fundamenta mathematicae, vol. 38 , pp. 137–152.Hartley Rogers - 1953 - Journal of Symbolic Logic 18 (1):73-74.
- H. B. Enderton. On provable recursive functions. Notre Dame journal of formal logic, vol. 9 no. 1 , pp. 86–88.Hartley Rogers - 1973 - Journal of Symbolic Logic 38 (3):526-527.
- In memoriam.Hartley Rogers - 1976 - Annals of Mathematical Logic 9 (1-2):v.No categories
- Shoenfield J. R.. Open sentences and the induction axiom.Hartley Rogers - 1962 - Journal of Symbolic Logic 27 (1):90-91.
- (1 other version)C. E. M. Yates. Three theorems on the degrees of recursively enumerable sets. Duke mathematical journal, vol. 32 , pp. 461–468. [REVIEW]Hartley Rogers - 1967 - Journal of Symbolic Logic 32 (3):394-395.
- (1 other version)Friedberg R. M.. Two recursively enumerable sets of incomparable degrees of unsolvability . Proceedings of the National Academy of Sciences of the United States of America, vol. 43 , pp. 236–238. [REVIEW]Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (2):225-226.
- Feferman Solomon. Degrees of unsolvability associated with classes of formalized theories. [REVIEW]Hartley Rogers - 1962 - Journal of Symbolic Logic 27 (1):85-86.
- (1 other version)Hermes H. and Scholz H.. Mathematische Logik. Enzyklopädie der mathematischen Wissenschaften, Band I, Algebra und Zahlentheorie, 1. Teil, Heft 1, Teil I, B.G. Teubner, Leipzig 1952, 82 pp. [REVIEW]Hartley Rogers - 1954 - Journal of Symbolic Logic 19 (4):278-282.
- (1 other version)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. [REVIEW]Hartley Rogers - 1970 - Journal of Symbolic Logic 35 (1):152.
- (1 other version)Kleene S. C. and Post Emil L.. The upper semi-lattice of degrees of recursive unsolvability. Annals of mathematics, ser. 2 vol. 59 , pp. 379–407. [REVIEW]Hartley Rogers - 1956 - Journal of Symbolic Logic 21 (4):407-408.
- (1 other version)Lacombe Daniel. 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 , vol. 239 , pp. 1108–1109. [REVIEW]Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (2):226-226.
- (1 other version)Mučnik A. A.. Nérazréšimost′ problémy svodimosti téorii algoritmov . Doklady Akadéimii Nauk SSSR, vol. 108 , pp. 194–197. [REVIEW]Hartley Rogers - 1957 - Journal of Symbolic Logic 22 (2):218-219.
- (1 other version)Mučnik A. A.. Réšénié problémy svodimosti Posta i nékotoryh drugih problém téorii algorifmou. I. Trudy Moskovskogo Matématičéskogo Obščéstva, vol. 7 , pp. 391–405. [REVIEW]Hartley Rogers - 1965 - Journal of Symbolic Logic 30 (1):90-90.
- Martin Davis, Hilary Putnam, and Julia Robinson. The decision problem for exponential diophantine equations. Annals of mathematics, second series vol. 74 , pp. 425–436. [REVIEW]Hartley Rogers - 1970 - Journal of Symbolic Logic 35 (1):151-152.
- Review: C. E. M. Yates, Recursively Enumerable Sets and Retracting Functions. [REVIEW]Hartley Rogers - 1967 - Journal of Symbolic Logic 32 (3):394-394.
- (1 other version)Review: Clifford Spector, Measure-Theoretic Construction of Incomparable Hyperdegrees. [REVIEW]Hartley Rogers - 1962 - Journal of Symbolic Logic 27 (2):242-242.
- (1 other version)Review: Heinrich Scholz, Vorlesungen uber Grundzuge der Mathematischen Logik. Vol. 1; Heinrich Scholz, Vorlesungen uber Grundzuge der Mathematischen Logik. Vol. 2. [REVIEW]Hartley Rogers - 1954 - Journal of Symbolic Logic 19 (2):115-118.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-5d8df9484f-tnf22 uwo