Carl G. Jockusch Jr.

According to our database, Carl G. Jockusch Jr. authored at least 54 papers between 1968 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2019

The reverse mathematics of Hindman's Theorem for sums of exactly two elements.

Barbara F. Csima, Damir D. Dzhafarov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick

Comput., 2019

2017

Asymptotic Density and the Theory of Computability: A Partial Survey.

Carl G. Jockusch Jr., Paul E. Schupp

Proceedings of the Computability and Complexity, 2017

Herrmann's Beautiful Theorem on Computable Partial Orderings.

Carl G. Jockusch Jr.

Proceedings of the Computability and Complexity, 2017

Effectiveness of Hindman's Theorem for Bounded Sums.

Damir D. Dzhafarov, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick

Proceedings of the Computability and Complexity, 2017

2016

Coarse Reducibility and Algorithmic Randomness.

Denis R. Hirschfeldt, Carl G. Jockusch Jr., Rutger Kuyper, Paul E. Schupp

J. Symb. Log., 2016

On notions of computability-theoretic reduction between Π21 principles.

Denis R. Hirschfeldt, Carl G. Jockusch Jr.

J. Math. Log., 2016

Asymptotic density and the coarse computability bound.

Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp

Comput., 2016

2015

Asymptotic density and the Ershov hierarchy.

Rod Downey, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp

Math. Log. Q., 2015

2013

Diagonally non-computable functions and bi-immunity.

Carl G. Jockusch Jr., Andrew E. M. Lewis

J. Symb. Log., 2013

Asymptotic density and computably Enumerable Sets.

Rodney G. Downey, Carl G. Jockusch Jr., Paul E. Schupp

J. Math. Log., 2013

2012

Generic computability, Turing degrees, and asymptotic density.

Carl G. Jockusch Jr., Paul E. Schupp

J. Lond. Math. Soc., 2012

2011

Binary subtrees with few labeled paths.

Rodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans

Comb., 2011

2009

Stability and posets.

Carl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon

J. Symb. Log., 2009

Ramsey's theorem and cone avoidance.

Damir D. Dzhafarov, Carl G. Jockusch Jr.

J. Symb. Log., 2009

Corrigendum to: "On the strength of Ramsey's Theorem for pairs".

Peter Cholak, Theodore A. Slaman, Carl G. Jockusch Jr.

J. Symb. Log., 2009

Chains and antichains in partial orderings.

Valentina S. Harizanov, Carl G. Jockusch Jr., Julia F. Knight

Arch. Math. Log., 2009

2007

Π₁⁰ classes and strong degree spectra of relations.

John Chisholm, Jennifer Chubb, Valentina S. Harizanov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Sarah Pingrey

J. Symb. Log., 2007

2006

Restricted jump interpolation in the d.c.e. degrees.

Carl G. Jockusch Jr., Angsheng Li

Math. Struct. Comput. Sci., 2006

On self-embeddings of computable linear orderings.

Rodney G. Downey, Carl G. Jockusch Jr., Joseph S. Miller

Ann. Pure Appl. Log., 2006

2005

Completing pseudojump operators.

Richard Coles, Rodney G. Downey, Carl G. Jockusch Jr., Geoffrey LaForte

Ann. Pure Appl. Log., 2005

2002

Generalized R-Cohesiveness and The Arithmetical Hierarchy: A Correction to "Generalized Cohesiveness".

Carl G. Jockusch Jr., Tamara J. Lakins

J. Symb. Log., 2002

2001

Ramsey's Theorem for Computably Enumerable Colorings.

Tamara Lakins Hummel, Carl G. Jockusch Jr.

J. Symb. Log., 2001

On The Strength of Ramsey's Theorem for Pairs.

Peter Cholak, Carl G. Jockusch Jr., Theodore A. Slaman

J. Symb. Log., 2001

1999

Generalized Cohesiveness.

Tamara Lakins Hummel, Carl G. Jockusch Jr.

J. Symb. Log., 1999

Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank 1.

Rodney G. Downey, Carl G. Jockusch Jr.

J. Symb. Log., 1999

1998

Difference Sets and Computability Theory.

Rodney G. Downey, Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel

Ann. Pure Appl. Log., 1998

1997

Correction to "A Cohesive Set which is not High".

Carl G. Jockusch Jr., Frank Stephan

Math. Log. Q., 1997

1996

Difference Sets and Inverting the Difference Operator.

Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel

Comb., 1996

1995

Weak Presentation of Computable Fields.

Carl G. Jockusch Jr., Alexandra Shalpentokh

J. Symb. Log., 1995

1994

Boolean Algebras, Stone Spaces, and the Iterated Turing Jump.

Carl G. Jockusch Jr., Robert I. Soare

J. Symb. Log., 1994

1993

A Cohesive Set which is not High.

Frank Stephan, Carl G. Jockusch Jr.

Math. Log. Q., 1993

On the Sigma₂-Theory of the Upper Semilattice of Turing Degrees.

Carl G. Jockusch Jr., Theodore A. Slaman

J. Symb. Log., 1993

Decidability and Undecidability of Theories with a Predicate for the Primes.

P. T. Bateman, Carl G. Jockusch Jr., Alan R. Woods

J. Symb. Log., 1993

Countable Thin Pi⁰₁ Classes.

Douglas A. Cenzer, Rodney G. Downey, Carl G. Jockusch Jr., Richard A. Shore

Ann. Pure Appl. Log., 1993

1991

Pi⁰₁-Classes and Rado's Selection Principle.

Carl G. Jockusch Jr., Andrew E. M. Lewis, Jeffrey B. Remmel

J. Symb. Log., 1991

Degrees of Orderings Not Isomorphic to Recursive Linear Orderings.

Carl G. Jockusch Jr., Robert I. Soare

Ann. Pure Appl. Log., 1991

1990

Weakly Semirecursive Sets.

Carl G. Jockusch Jr., James C. Owings

J. Symb. Log., 1990

1989

Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion.

Carl G. Jockusch Jr., Manuel Lerman, Robert I. Soare, Robert Solovay

J. Symb. Log., 1989

1988

Annual Meeting of the Association for Symbolic Logic, New York City, December 1987.

Nicolas D. Goodman, Harold T. Hodes, Carl G. Jockusch Jr., Kenneth McAloon

J. Symb. Log., 1988

1984

Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers.

Carl G. Jockusch Jr., Richard A. Shore

J. Symb. Log., 1984

Annual Meeting of the Association for Symbolic Logic: Denver, 1983.

Carl G. Jockusch Jr., Richard Laver, J. Donald Monk, Jan Mycielski, Jon Pearce

J. Symb. Log., 1984

1980

Fine Degrees of Word Problems of Cancellation Semigroups.

Carl G. Jockusch Jr.

Math. Log. Q., 1980

1978

Meeting of the Association for Symbolic Logic: Chicago, 1977.

Carl G. Jockusch Jr., Robert I. Soare, William W. Tait, Gaisi Takeuti

J. Symb. Log., 1978

Double Jumps of Minimal Degrees.

Carl G. Jockusch Jr., David B. Posner

J. Symb. Log., 1978

1976

Completely Autoreducible Degrees.

Carl G. Jockusch Jr., Michael S. Paterson

Math. Log. Q., 1976

1974

Pi⁰₁ Classes and Boolean Combinations of Recursively Enumerable Sets.

Carl G. Jockusch Jr.

J. Symb. Log., 1974

1973

Post's Problem and His Hypersimple Set.

Carl G. Jockusch Jr., Robert I. Soare

J. Symb. Log., 1973

Encodability of Kleene's O.

Carl G. Jockusch Jr., Robert I. Soare

J. Symb. Log., 1973

An Application of sigma⁰₄ Determinancy to the Degrees of Unsolvability.

Carl G. Jockusch Jr.

J. Symb. Log., 1973

1972

Meeting of the Association for Symbolic Logic: St. Louis 1972.

Carl G. Jockusch Jr., Joseph S. Ullian, Robert B. Barrett Jr.

J. Symb. Log., 1972

Ramsey's Theorem and Recursion Theory.

Carl G. Jockusch Jr.

J. Symb. Log., 1972

1971

A Minimal Pair of pi⁰₁ Classes.

Carl G. Jockusch Jr., Robert I. Soare

J. Symb. Log., 1971

1969

The Degrees of Hyperhyperimmune Sets.

Carl G. Jockusch Jr.

J. Symb. Log., 1969

1968

Uniformly Introreducible Sets.

Carl G. Jockusch Jr.

J. Symb. Log., 1968