Leo Harrington | Academic Influence

Leo Harrington's AcademicInfluence.com Rankings

Leo Harrington

Mathematics

#1062

World Rank

#1816

Historical Rank

#463

USA Rank

Group Theory

#144

World Rank

#174

Historical Rank

#31

USA Rank

Number Theory

#272

World Rank

#343

Historical Rank

#47

USA Rank

Algebra

#269

World Rank

#385

Historical Rank

#58

USA Rank

mathematics Degrees

Download Badge

Mathematics

Leo Harrington's Degrees

PhD Mathematics Princeton University
Masters Mathematics Stanford University

Why Is Leo Harrington Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Leo Anthony Harrington is a professor of mathematics at the University of California, Berkeley who works in recursion theory, model theory, and set theory. Having retired from being a Mathematician, Professor Leo Harrington is now a Philosopher.

(See a Problem?)

Leo Harrington'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

Trees, automata, and games (1982) (377)
A Glimm-Effros dichotomy for Borel equivalence relations (1990) (349)
Analytic determinacy and 0# (1978) (165)
Harvey Friedman's Research on the Foundations of Mathematics (1985) (142)
Models Without Indiscernibles (1978) (136)
Some exact equiconsistency results in set theory (1985) (122)
aleph0-Categorical, aleph0-stable structures (1985) (112)
Recursively presentable prime models (1974) (88)
The d.r.e. Degrees are Not Dense (1991) (85)
The undecidability of the recursively enumerable degrees (1982) (74)
Adding a closed unbounded set (1976) (70)
ℵ 0 -Categorical, ℵ 0 -stable structures (1985) (63)
A proof of vaught’s conjecture forω-stable theories (1984) (62)
Post's program and incomplete recursively enumerable sets. (1991) (61)
Long projective wellorderings (1977) (56)
On the determinacy of games on ordinals (1981) (54)
Fundamentals of forking (1984) (51)
Counting Equivalence Classes For Co-κ-Souslin Equivalence Relations (1982) (46)
Counting Equivalence Classes For Co-κ-Souslin Equivalence Relations (1982) (46)
An exposition of Shelah's "main gap": counting uncountable models of ω-stable and superstable theories (1985) (38)
Games in Recursion Theory and Continuity Properties of Capping Degrees (1992) (30)
Flipping properties: A unifying thread in the theory of large cardinals (1977) (29)
The Δ₃⁰-automorphism method and noninvariant classes of degrees (1996) (28)
Equivalence Relations, Projective and Beyond (1979) (24)
A Basis Result for Σ^0_3 Sets of Reals with an Application to Minimal Covers (1975) (23)
Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets (1996) (22)
On the Definability of the double jump in the computably Enumerable Sets (2002) (21)
Codable sets and orbits of computably enumerable sets (1998) (19)
Coding in the Partial Order of Enumerable Sets (1998) (19)
The Superjump and the First Recursively Mahlo Ordinal (1974) (17)
Selection in abstract recursion theory (1976) (16)
Definable Properties of the Computably Enumerable Sets (1998) (13)
Isomorphisms of splits of computably enumerable sets (2003) (13)
Dynamic properties of computably enumerable sets (1996) (12)
Definable Encodings in the Computably Enumerable Sets (2000) (11)
Trivial pursuit: Remarks on the main gap (1987) (11)
A combinatorial study of communication, storage and traceability in broadcast encryption systems (1997) (10)
On monotone vs. nonmonotone induction (1976) (10)
Extension theorems, orbits, and automorphisms of the computably enumerable sets (2004) (10)
There is No Fat Orbit (1996) (10)
On the orbits of computably enumerable sets (2006) (9)
On characterizing Spector classes (1975) (9)
Contributions to recursion theory on higher types (or, a proof of Harrington's conjecture), (1973) (8)
Definable degrees and automorphisms of $\mathcal {D}$ (1981) (8)
Ordinal Games and Their Applications (1982) (7)
Ordinal Games and Their Applications (1982) (7)
$Π^1_2$ singletons and $O^#$ (1977) (6)
On the Orbits of Computable Enumerable Sets (2006) (5)
Extensions of countable infinitary logic which preserve most of its nice properties (1980) (4)
Upper and lower bounds for recursive fourier sampling (2008) (4)
Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151] (2017) (4)
Π 1 2 Sets and Π 1 2 Singletons (1975) (4)
The Complexity of Orbits of Computably Enumerable Sets (2008) (3)
Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1 (2017) (2)
University of Illinois at Chicago, Chicago, IL, June 1–4, 2003 (2004) (2)
Characterizing C 3 (The Largest Countable Π 1 3 Set) (1976) (1)
DEFINABLE DEGREES AND AUTOMORPHISMS OF V BY (2007) (1)
On Σ1 well-orderings of the universe (1976) (1)
A generalized Kleene-Moschovakis theorem (1978) (1)
The Work of Harvey Friedman1) (1985) (1)
Π₂¹ sets and Π₂¹ singletons (1975) (1)
Characterizing ₃ (the largest countable Π¹₃ set) (1976) (1)
Index of Reviews (1978) (0)
Counting the Number of Equivalence Classes of Borel and Coanalytic Equivalence Relations.Equivalences Generated by Families of Borel Sets.A Reflection Phenomenon in Descriptive Set Theory.Equivalence Relations, Projective and Beyond.Counting Equivalence Classes for co-κ-Souslin Equivalence Relations (1987) (0)
Review of Peter Cholak, “Automorphisms of the Lattice of Recursively Enumerable Sets ” Memoirs of the American Math. Soc. (1995) viii+151 pp and (2005) (0)
$\Pi \sb{2}\sp{1}$ sets and $\Pi \sb{2}\sp{1}$ singletons (1975) (0)
Characterizing $E\sb{3}$ (the largest countable $\Pi \sp{1}\sb{3}$\ set) (1976) (0)
ON Lω2,ω MODELS OF SIZE ω2 (2019) (0)
Automata, Trees, and Games (2017) (0)
Meeting of the Association for Symbolic Logic, Reno, 1976 (1977) (0)
II * SETS AND II * SINGLETONS (2010) (0)
BAILEY, C. and DOWNEY, R., Tabular degrees in (Y-recursion theory BALDWIN, JT and SHELAH, S., The primal framework II: Smoothness BERARDUCCI, A. and INTRIGILA, B., Combinatorial (1992) (0)
Recursion theoretic papers. Introduction to Part VI (2016) (0)
Ju l 2 00 6 ON THE ORBITS OF COMPUTABLE ENUMERABLE SETS (2006) (0)
Counting the Number of Equivalence Classes of Borel and Coanalytic Equivalence Relations.Equivalences Generated by Families of Borel Sets.A Reflection Phenomenon in Descriptive Set Theory.Equivalence Relations, Projective and Beyond.Counting Equivalence Classes for co-κ-Souslin Equivalence Relations (1987) (0)

This paper list is powered by the following services:

Other Resources About Leo Harrington

en.wikipedia.org

What Schools Are Affiliated With Leo Harrington?

Leo Harrington is affiliated with the following schools:

Image Attributions

Image Source for Leo Harrington