Carl Jockusch | Academic Influence

Carl Jockusch's AcademicInfluence.com Rankings

Carl Jockusch

Mathematics

#5113

World Rank

#7228

Historical Rank

#1707

USA Rank

Group Theory

#166

World Rank

#197

Historical Rank

#35

USA Rank

Algebra

#423

World Rank

#577

Historical Rank

#82

USA Rank

Measure Theory

#2664

World Rank

#3186

Historical Rank

#768

USA Rank

mathematics Degrees

Download Badge

Mathematics

Carl Jockusch's Degrees

PhD Mathematics University of California, Berkeley

Why Is Carl Jockusch Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Carl Groos Jockusch Jr. is an American mathematician. He graduated from Alamo Heights High School in 1959, attended Vanderbilt University in Nashville, Tennessee, and transferred to Swarthmore College, Pennsylvania in 1960, where he received his B.A. in 1963 with Highest Honors. He then enrolled at the Massachusetts Institute of Technology. He is a member of Phi Beta Kappa and Sigma Xi. In 2014, he became a Fellow of the American Mathematical Society. He is a professor emeritus at the University of Illinois at Urbana–Champaign.

(See a Problem?)

Carl Jockusch'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

Π⁰₁ classes and degrees of theories (1972) (351)
Semirecursive sets and positive reducibility (1968) (248)
On the strength of Ramsey's theorem for pairs (2001) (218)
Ramsey's theorem and recursion theory (1972) (214)
An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees (1984) (118)
Degrees of members of Π10 classes (1972) (107)
Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers (1984) (106)
Array nonrecursive sets and multiple permitting arguments (1990) (89)
Every low Boolean algebra is isomorphic to a recursive one (1994) (83)
Degrees of Functions with no Fixed Points (1989) (81)
Double jumps of minimal degrees (1978) (73)
Array nonrecursive degrees and genericity (1996) (70)
Pseudojump operators. I. The r.e. case (1983) (69)
A Cohesive Set which is not High (1993) (69)
Degrees in Which the Recursive Sets are Uniformly Recursive (1972) (68)
Degrees of Orderings Not Isomorphic to Recursive Linear Orderings (1991) (64)
Jumps of orderings (1990) (61)
Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion (1989) (58)
Degrees of generic sets (1980) (52)
Generic computability, Turing degrees, and asymptotic density (2010) (51)
A degree-theoretic definition of the ramified analytical hierarchy (1976) (51)
Relationships between reducibilities (1969) (49)
On notions of computability-theoretic reduction between Π21 principles (2016) (49)
Ramsey's theorem and cone avoidance (2009) (46)
T-degrees, jump classes, and strong reducibilities (1987) (45)
The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs (2014) (38)
Asymptotic density and computably Enumerable Sets (2013) (35)
Uniformly introreducible sets (1969) (35)
Minimal covers and arithmetical sets (1970) (34)
Upward closure and cohesive degrees (1973) (34)
Countable retracing functions and $\Pi_2{}^0$ predicates. (1969) (34)
Simple Proofs of Some Theorems on High Degrees of Unsolvability (1977) (33)
Boolean algebras, Stone spaces, and the iterated Turing jump (1994) (32)
The degrees of bi-immune sets (1969) (31)
University of Illinois at Urbana-Champaign, June 3–7, 2000 (2000) (28)
First order topology (1977) (25)
Reducibilities in recursive function theory. (1966) (25)
Review: A. H. Lachlan, Lower Bounds for Pairs of Recursively Enumerable Degrees (1972) (23)
Countable Thin Pi01 Classes (1993) (22)
Decidability and undecidability of theories with a predicate for the primes (1993) (21)
Fixed points of jump preserving automorphisms of degrees (1977) (19)
Corrigendum to: “On the strength of Ramsey's Theorem for pairs” (2009) (19)
Automorphism bases for degrees of unsolvability (1981) (19)
The degrees of hyperhyperimmune sets (1969) (19)
Π10 classes and Boolean combinations of recursively enumerable sets (1974) (18)
Asymptotic density and the coarse computability bound (2015) (18)
Three easy constructions of recursively enumerable sets (1981) (18)
Effectiveness of Hindman's Theorem for Bounded Sums (2016) (16)
A minimal pair of Π10 classes (1971) (15)
Π01-classes and Rado's selection principle (1991) (15)
Diagonally Non-Computable Functions and Bi-Immunity (2013) (15)
Π10 classes and strong degree spectra of relations (2007) (14)
Asymptotic density, computable traceability, and 1-randomness (2016) (14)
COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS (2015) (14)
COUNTABLE RETRACING FUNCTIONS AND HI PREDICATES (2012) (13)
Correction to “A Cohesive Set which is not High” (1997) (13)
Binary subtrees with few labeled paths (2009) (12)
a join theorem for the computably enumerable degrees (2004) (12)
Asymptotic density and the Ershov hierarchy (2013) (12)
Minimal degrees and 1-generic sets below 0′ (1984) (12)
Weakly semirecursive sets (1990) (12)
On the Σ2-theory of the upper semilattice of Turing degrees (1993) (12)
An application of Σ40 determinacy to the degrees of unsolvability (1973) (11)
Asymptotic Density and the Theory of Computability: A Partial Survey (2016) (10)
Generalized cohesiveness (1997) (10)
Recursiveness of initial segments of Kleene's O (1975) (9)
Completing pseudojump operators (2005) (9)
Embedding the diamond lattice in the recursively enumerable truth-table degrees (1985) (8)
Effective presentability of Boolean algebras of Cantor-Bendixson rank 1 (1999) (8)
Post's problem and his hypersimple set (1973) (8)
The reverse mathematics of Hindman's Theorem for sums of exactly two elements (2018) (8)
Completely Autoreducible Degrees (1976) (8)
Upward Closure of bi‐Immune Degrees (1972) (7)
Stability and posets (2009) (7)
Chains and antichains in partial orderings (2009) (6)
Ramsey's theorem for computably enumerable colorings (2001) (6)
Weak presentations of computable fields (1995) (5)
DEGREES OF MEMBERS OF Π\ CLASSES (2012) (5)
Fine Degrees of Word Problems of Cancellation Semigroups (1980) (5)
Encodability of Kleene's O (1973) (4)
On self-embeddings of computable linear orderings (2006) (4)
A lattice property of post's simple set (1975) (4)
Difference sets and inverting the difference operator (1996) (3)
Abstract complexity theory and the degrees of unsolvability (1998) (3)
Pi01-Classes and Rado's Selection Principle (1991) (3)
Recursively enumerable sets and van der Waerden’s theorem on arithmetic progressions (1984) (3)
Meeting of the Association for Symbolic Logic, Chicago, 1977 (1976) (3)
Pi01 Classes and Boolean Combinations of Recursively Enumerable Sets (1974) (2)
Generalized r-cohesiveness and the arithmetical hierarchy: a correction to “Generalized cohesiveness” (2002) (2)
Supplement to Boone's “Algebraic Systems” (1968) (1)
Review: A. H. Lachlan, Some Notions of Reducibility and Productiveness (1970) (1)
Restricted jump interpolation in the d.c.e. degrees (2006) (1)
Shore Richard A. and Slaman Theodore A.. Defining the Turing jump. Mathematical research letters , vol. 6 (1999), pp. 711–722. (2001) (1)
Coarse computability, the density metric, hausdorff distances between turing degrees, perfect trees, and reverse mathematics (2021) (1)
A Minimal Pair of pi01 Classes (1971) (1)
Review: Manuel Lerman, Degrees of Unsolvability. Local and Global Theory (1985) (1)
2000 Annual Meeting of the Association for Symbolic Logic (2000) (1)
Weak Presentation of Computable Fields (1995) (0)
Difference Sets and Computability Theory (1998) (0)
REVIEWS-Defining the Turing jump (2001) (0)
RELATIONSHIPS BETWEEN REDUCIBILITTESO (2010) (0)
2001 annual meeting of the association for symbolic logic (2001) (0)
MINIMAL COVERS AND ARITHMETICAL SETS1 (2010) (0)
An Application of sigma04 Determinancy to the Degrees of Unsolvability (1973) (0)
Annual Meeting of the Association for Symbolic Logic, Pittsburgh, 1991 (1992) (0)
On the Sigma2-Theory of the Upper Semilattice of Turing Degrees (1993) (0)
Annual Meeting of the Association for Symbolic Logic (1965) (0)
Annual meeting of the Association for Symbolic Logic, New York City, December 1987 (1988) (0)
Notices (1990) (0)
In Memoriam: Joseph R. Shoenfield 1927–2000 (2001) (0)
Elementary Problems: E3269-E3275 (1988) (0)
Meeting of the Association for Symbolic Logic, St. Louis 1972 (1972) (0)
Diierence Sets and Computability Theory Zoltt an F Uredi (1996) (0)
Herrmann's Beautiful Theorem on Computable Partial Orderings (2017) (0)
Annual Meeting of the Association for Symbolic Logic Denver, 1983 (1984) (0)

This paper list is powered by the following services:

Other Resources About Carl Jockusch

en.wikipedia.org

What Schools Are Affiliated With Carl Jockusch?

Carl Jockusch is affiliated with the following schools:

Image Attributions

Image Source for Carl Jockusch