Rózsa Péter | Academic Influence

Rózsa Péter's AcademicInfluence.com Rankings

Rózsa Péter

Mathematics

#594

Historical Rank

Measure Theory

#3687

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Rózsa Péter's Degrees

PhD Mathematics Eötvös Loránd University

Why Is Rózsa Péter Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Rózsa Péter, born Rózsa Politzer, was a Hungarian mathematician and logician. She is best known as the "founding mother of recursion theory". Early life and education Péter was born in Budapest, Hungary, as Rózsa Politzer . She attended Pázmány Péter University , originally studying chemistry but later switching to mathematics. She attended lectures by Lipót Fejér and József Kürschák. While at university, she met László Kalmár; they would collaborate in future years and Kalmár encouraged her to pursue her love of mathematics.

(See a Problem?)

Rózsa Péter'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

λ-Definability and Recursiveness. (1937) (137)
Review: Andrzej Grzegorczyk, Some Classes of Recursive Functions (1955) (50)
General Recursive Functions of Natural Numbers. (1937) (39)
Review: S. C. Kleene, On Notation for Ordinal Numbers (1939) (22)
Review: S. C. Kleene, General Recursive Functions of Natural Numbers (1937) (21)
Review: S. C. Kleene, A Symmetric Form of Godel's Theorem (1951) (20)
Review: Leon Henkin, Completeness in the Theory of Types (1951) (18)
Robinson Raphael M.. Undecidable—rings. Transactions of the American Mathematical Society , Bd. 70 (1951), S.137–159. (1952) (13)
Kleene S. C.. A symmetric form of Gödel's theorem. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings of the section of sciences, Bd. 53 (1950), S. 800–802; auch Indagationes mathematicae, Bd. 12 (1950), S. 244–246. (1951) (6)
Playing with infinity : mathematical explorations and excursions (1976) (5)
Tait W. W.. Nested recursion. Mathematische Annalen, Bd. 143 (1961), S. 236–250. (1963) (5)
Review: M. D. Gladstone, A Reduction of the Recursion Scheme (1970) (3)
Kleene S. C.. General recursive functions of natural numbers. Mathematische Annalen, Bd. 112 (1935–1936), S. 727–742. (1937) (2)
Review: Raphael M. Robinson, Primitive Recursive Functions. II (1948) (2)
Kleene S. C.. λ-definability and recursiveness. Duke mathematical journal, Bd. 2 (1936), S. 340–353. (1937) (1)
Gladstone M. D.. A reduction of the recursion scheme. The journal of symbolic logic, Bd. 32 (für 1967, veröff. 1968), S. 505–508. (1970) (1)
Smielew W.. Decision problem in group theory. Ebd., Sonderabdruck 1948, S. 373–376. (1949) (0)
Henkin Leon. Completeness in the theory of types. The journal of symbolic logic , vol. 15 (1950), S. 81–91. (1951) (0)
Review: Antoni Janiczak, A Remark Concerning Decidability of Complete Theories (1951) (0)
Review: S. C. Kleene, $\lambda$-Definability and Recursiveness (1937) (0)
Review: Raphael M. Robinson, Recursion and Double Recursion (1949) (0)
Review: P. Lorenzen, Die Definition Durch Vollstandige Induktion (1940) (0)
Quine W. V.. Completeness of the propositional calculus. The journal of symbolic logic, Bd. 3 (1938), S. 37–40. (1938) (0)
Skolem Th.. Einfacher Beweis der Unmöglichkeit eines allgemeinen Lösungsverfahrens für arithmetische Probleme. Det Kongelige Norske Videnskabers Selskab, Forhandlinger , Bd. 13 (1940), S. 1–4. (1944) (0)
Janiczak Antoni. A remark concerning decidability of complete theories. The journal of symbolic logic, vol. 15 (1950), 277–279. (1951) (0)
Review: A. Janiczak, On the Reducibility of Decision Problems (1956) (0)
A. M. Turing. Computability and λ-definability. The journal of symbolic logic , Bd. 2 (1937), S. 153–163. (1938) (0)
Review: Raphael M. Robinson, Arithmetical Definitions in the Ring of Integers (1952) (0)
Kleene S. C.. On notation for ordinal numbers. The journal of symbolic logic , Bd. 3 (1938), S. 150–155. (1939) (0)
Feferman Solomon. Classifications of recursive functions by means of hierarchies. Transactions of the American Mathematical Society , Bd. 104 (1962), S. 101–122. (1965) (0)
Review: W. V. Quine, On Derivability (1938) (0)
Review: Th. Skolem, A Version of the Proof of Equivalence Between Complete Induction and the Uniqueness of Primitive Recursion (1959) (0)
Review: Raphael M. Robinson, Arithmetical Definability of Field Elements (1952) (0)
Review: W. W. Tait, Nested Recursion (1963) (0)
Axt Paul. On a subrecursive hierarchy and primitive recursive degrees. Transactions of the American Mathematical Society, Bd. 92 (1959), S. 85–105. (1960) (0)
Mostowski A.. A lemma concerning recursive functions and its applications. Bulletin de l'Académie Polonaise des Sciences, Classe III, Bd. 1 (1953), S. 277–280. (1954) (0)
Review: Paul Axt, Enumeration and the Grzegorczyk Hierarchy (1965) (0)
Review: H. B. Curry, A Note on the Reduction of Gentzen's Calculus LJ (1939) (0)
Julia Robinson. A note on primitive recursive functions . Ebd., S. 667–670. (1957) (0)
Review: Julia Robinson, A Note on Primitive Recursive Functions (1957) (0)
Review: A. Janiczak, Some Remarks on Partially Recursive Functions (1956) (0)
Review: A. M. Turing, Computability and $\lambda$-Definability (1938) (0)
Review: Akos Pauler, Logikai Alapelv es Mathematikai Axioma (1940) (0)
Robinson Raphael M.. Arithmetical definability of field elements. The journal of symbolic logic , Bd. 16 (1951), S.125–126. (1952) (0)
Review: Raphael M. Robinson, Undecidable-Rings (1952) (0)
Goodstein R. L.. Logic-free formalisations of recursive arithmetic. Mathematica Scandinavica , Bd. 2 (1954), S. 247–261. (1959) (0)
Review: W. V. Quine, Completeness of the Propositional Calculus (1938) (0)
Robinson Raphael M.. Recursion and double recursion. Bulletin of the American Mathematical Society, Bd. 54 (1948), S. 987–993. (1949) (0)
Review: Laszlo Kalmar, Reduction of the Decision Problem to the Satisfiability Question of Logical Formulae on a Finite Set (1955) (0)
Curry H. B.. A note on the reduction of Gentzen's calculus LJ. Bulletin of the American Mathematical Society, Bd. 45 (1939), S. 288–293. (1939) (0)
Robinson Raphael M.. Primitive recursive functions. II. Proceedings of the American Mathematical Society , Bd. 6 (1955), S. 663–666. (1957) (0)
Review: W. Smielew, Decision Problem in Group Theory (1949) (0)
Skolem Th.. A version of the proof of equivalence between complete induction and the uniqueness of primitive recursion. Det Kongelige Norske Videnskabers Selskabs, ForhandUnger , Bd. 29 Heft 3 (1956), S. 10–15. (1959) (0)
Review: Paul Axt, Note on the 3-Recursive Functions (1964) (0)
Quine W. V.. On derivabiliiy. The journal of symbolic logic, Bd. 2 (1937), S. 113–119. (1938) (0)
Ernst Specker. Nicht konstruktiv beweisbare Sätze der Analysis. The journal of symbolic logic , Bd. 14 (1949), S. 145–158. (1950) (0)

This paper list is powered by the following services:

Other Resources About Rózsa Péter

en.wikipedia.org

What Schools Are Affiliated With Rózsa Péter?

Rózsa Péter is affiliated with the following schools:

Image Attributions

Image Source for Rózsa Péter