Hartley Rogers Jr.

Hartley Rogers Jr.'s AcademicInfluence.com Rankings

Hartley Rogers Jr.

Mathematics

#6723

World Rank

#9262

Historical Rank

#1980

USA Rank

Measure Theory

#3528

World Rank

#4164

Historical Rank

#1020

USA Rank

mathematics Degrees

Download Badge

Mathematics

Hartley Rogers Jr.'s Degrees

PhD Mathematics Princeton University

Why Is Hartley Rogers Jr. Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Hartley Rogers Jr. was an American mathematician who worked in computability theory, and was a professor in the Mathematics Department of the Massachusetts Institute of Technology. Biography Born in 1926 in Buffalo, New York, he studied under Alonzo Church at Princeton, and received his Ph.D. there in 1952. He served on the MIT faculty from 1956 until his death, July 17, 2015. He is survived by his wife, Dr. Adrianne E. Rogers, by his three children, Hartley R. Rogers, Campbell D.K. Rogers, and Caroline R. Broderick, and by his 10 grandchildren.

(See a Problem?)

Hartley Rogers Jr.'s Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Gödel numberings of partial recursive functions (1958) (250)
Gödel's Proof (1961) (235)
Cambridge Summer School in Mathematical Logic (1973) (149)
Reducibility and Completeness for Sets of Integers (1959) (130)
Some Problems of Definability in Recursive Function Theory (1967) (41)
Certain Logical Reduction and Decision Problems (1956) (36)
Descriptive Set Theory in L ω 1 ω (1982) (32)
Theory of recursive functions and effective computability (Reprint from 1967) (1987) (29)
Constructive versions of ordinal number classes (1961) (16)
Review: S. C. Kleene, Emil L. Post, The Upper Semi-Lattice of Degrees of Recursive Unsolvability (1956) (13)
Computing degrees of unsolvability (1959) (13)
An Example in Mathematical Logic (1963) (10)
On universal functions (1965) (8)
Multivariable calculus with vectors (1998) (6)
Recursive functions over well ordered partial orderings (1959) (6)
A General Education Course in Pure Mathematics (1956) (3)
Review: Andrzej Grzegorczyk, Undecidability of Some Topological Theories (1953) (3)
Review: R. M. Friedberg, Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability (Solution of Post's Problem, 1944) (1958) (3)
A note on the law of large numbers (1957) (2)
Cambridge Summer School in Mathematical Logic Held in Cambridge/England, August 1-21, 1971 (1973) (1)
THE ANNUAL MEETING IN ST. LOUIS The fifty-ninth Annual Meeting of the American Mathematical Society was held at Washington University, St. Louis, Missouri, Saturday through Monday, December 27-29, 1952, in conjunction with meetings of the American Association for the Advancement (2007) (1)
The Euclidean Algorithm as a Means of Simplifying Fractions. (1970) (1)
The Decision Problem for Exponential Diophantine Equations. (1970) (1)
The Future of the University in Mathematics Education (1975) (1)
Mučnik A. A.. 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. (1965) (0)
Physics and Mathematics (1981) (0)
Review: Julia Robinson, The Undecidability of Exponential Diophantine Equations (1970) (0)
Friedberg R. M.. 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. (1958) (0)
Davis Martin, Putnam Hilary, and Robinson Julia. The decision problem for exponential diophantine equations. Annals of mathematics , second series vol. 74 (1961), pp. 425–436. (1970) (0)
Review: Martin Davis, Hilary Putnam, Julia Robinson, The Decision Problem for Exponential Diophantine Equations (1970) (0)
Robinson Julia. The undecidability of exponential Diophantine equations. Logic, methodology and philosophy of science, Proceedings of the 1960 International Congress, edited by Nagel Ernest, Suppes Patrick, and Tarski Alfred, Stanford University Press, Stanford, Calif., 1962, pp. 12–13. (1970) (0)
Review: R. L. Goodstein, Mathematical logic (1958) (0)
18.022 Calculus, Fall 2005 (2005) (0)
List of officers and members of the Association for Symbolic Logic (1962) (0)
List of officers and members of the Association for Symbolic Logic (1962) (0)
Review: C. E. M. Yates, Recursively Enumerable Sets and Retracting Functions (1967) (0)
RECURSIVE FUNCTIONS OVER WELL ORDERED PARTIAL ORDERINGS 1 (2010) (0)
Review: Clifford Spector, Measure-Theoretic Construction of Incomparable Hyperdegrees (1962) (0)
Review: J. R. Shoenfield, Open Sentences and the Inducation Axiom (1962) (0)
Review: A. A. Mucnik, Solution of Post's Reduction Problem and of Certain Other Problems in the Theory of Algorithms. I (1965) (0)
Review: H. B. Enderton, On Provable Recursive Functions (1973) (0)
Spector Clifford. Measure-theoretic construction of incomparable hyperdegrees. The journal of symbolic logic, vol. 23 (for 1958, pub. 1959), pp. 280–288. (1962) (0)
Andrzej Grzegorczyk. Undecidability of some topological theories. Fundamenta mathematicae , vol. 38 (for 1951, pub. 1952), pp. 137–152. (1953) (0)
C. E. M. Yates. Three theorems on the degrees of recursively enumerable sets. Duke mathematical journal , vol. 32 (1965), pp. 461–468. (1967) (0)
List of officers and members of the Association for Symbolic Logic (1964) (0)
Mučnik A. A.. 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. (1957) (0)
Training in Managerial Economics (1972) (0)
Review: Solomon Feferman, Degrees of Unsolvability Associated with Classes of Formalized Theories; J. R. Shoenfield, Degrees of Formal Systems (1962) (0)
Review: C. E. M. Yates, Three Theorems on the Degrees of Recursively Enumerable Sets (1967) (0)

This paper list is powered by the following services:

Other Resources About Hartley Rogers Jr.

en.wikipedia.org

What Schools Are Affiliated With Hartley Rogers Jr.?

Hartley Rogers Jr. is affiliated with the following schools:

Hartley Rogers Jr.'s Academic­Influence.com Rankings