Carl G. Jockusch Jr.

J. Math. Log., August, 2024

2019

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

[BibT_eX]

[DOI]

Comput., 2019

2017

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

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity, 2017

Herrmann's Beautiful Theorem on Computable Partial Orderings.

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity, 2017

Effectiveness of Hindman's Theorem for Bounded Sums.

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity, 2017

2016

Coarse Reducibility and Algorithmic Randomness.

[BibT_eX]

[DOI]

J. Symb. Log., 2016

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

[BibT_eX]

[DOI]

Denis R. Hirschfeldt

J. Math. Log., 2016

Asymptotic density and the coarse computability bound.

[BibT_eX]

[DOI]

Comput., 2016

2015

Asymptotic density and the Ershov hierarchy.

[BibT_eX]

[DOI]

Math. Log. Q., 2015

2013

Diagonally non-computable functions and bi-immunity.

[BibT_eX]

[DOI]

Andrew E. M. Lewis

J. Symb. Log., 2013

Asymptotic density and computably Enumerable Sets.

[BibT_eX]

[DOI]

Rodney G. Downey

J. Math. Log., 2013

2012

Generic computability, Turing degrees, and asymptotic density.

[BibT_eX]

[DOI]

J. Lond. Math. Soc., 2012

2011

Binary subtrees with few labeled paths.

[BibT_eX]

[DOI]

Comb., 2011

2009

Stability and posets.

[BibT_eX]

[DOI]

J. Symb. Log., 2009

Ramsey's theorem and cone avoidance.

[BibT_eX]

[DOI]

Damir D. Dzhafarov

J. Symb. Log., 2009

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

[BibT_eX]

[DOI]

Peter Cholak

Theodore A. Slaman

J. Symb. Log., 2009

Chains and antichains in partial orderings.

[BibT_eX]

[DOI]

Valentina S. Harizanov

Julia F. Knight

Arch. Math. Log., 2009

2007

Π10 classes and strong degree spectra of relations.

[BibT_eX]

[DOI]

John Chisholm

Jennifer Chubb

Valentina S. Harizanov

J. Symb. Log., 2007

2006

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

[BibT_eX]

[DOI]

Angsheng Li

Math. Struct. Comput. Sci., 2006

On self-embeddings of computable linear orderings.

[BibT_eX]

[DOI]

Rodney G. Downey

Joseph S. Miller

Ann. Pure Appl. Log., 2006

2005

Completing pseudojump operators.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2005

2002

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

[BibT_eX]

[DOI]

Tamara J. Lakins

J. Symb. Log., 2002

2001

Ramsey's Theorem for Computably Enumerable Colorings.

[BibT_eX]

[DOI]

Tamara Lakins Hummel

J. Symb. Log., 2001

On The Strength of Ramsey's Theorem for Pairs.

[BibT_eX]

[DOI]

Peter Cholak

Theodore A. Slaman

J. Symb. Log., 2001

1999

Generalized Cohesiveness.

[BibT_eX]

[DOI]

Tamara Lakins Hummel

J. Symb. Log., 1999

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

[BibT_eX]

[DOI]

Rodney G. Downey

J. Symb. Log., 1999

1998

Difference Sets and Computability Theory.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1998

1997

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

[BibT_eX]

[DOI]

Frank Stephan

Math. Log. Q., 1997

1996

Difference Sets and Inverting the Difference Operator.

[BibT_eX]

[DOI]

Zoltán Füredi

Lee A. Rubel

Comb., 1996

1995

Weak Presentation of Computable Fields.

[BibT_eX]

[DOI]

Alexandra Shalpentokh

J. Symb. Log., 1995

1994

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

[BibT_eX]

[DOI]

J. Symb. Log., 1994

1993

A Cohesive Set which is not High.

[BibT_eX]

[DOI]

Frank Stephan

Math. Log. Q., 1993

On the Sigma2-Theory of the Upper Semilattice of Turing Degrees.

[BibT_eX]

[DOI]

Theodore A. Slaman

J. Symb. Log., 1993

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

[BibT_eX]

[DOI]

P. T. Bateman

Alan R. Woods

J. Symb. Log., 1993

Countable Thin Pi01 Classes.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1993

1991

Pi01-Classes and Rado's Selection Principle.

[BibT_eX]

[DOI]

Andrew E. M. Lewis

Jeffrey B. Remmel

J. Symb. Log., 1991

Degrees of Orderings Not Isomorphic to Recursive Linear Orderings.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1991

1990

Weakly Semirecursive Sets.

[BibT_eX]

[DOI]

James C. Owings

J. Symb. Log., 1990

1989

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

[BibT_eX]

[DOI]

J. Symb. Log., 1989

1988

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

[BibT_eX]

[DOI]

J. Symb. Log., 1988

1984

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

[BibT_eX]

[DOI]

Richard A. Shore

J. Symb. Log., 1984

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

[BibT_eX]

[DOI]

J. Symb. Log., 1984

1980

Fine Degrees of Word Problems of Cancellation Semigroups.

[BibT_eX]

[DOI]

Math. Log. Q., 1980

1978

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

[BibT_eX]

[DOI]

J. Symb. Log., 1978

Double Jumps of Minimal Degrees.

[BibT_eX]

[DOI]

David B. Posner

J. Symb. Log., 1978

1976

Completely Autoreducible Degrees.

[BibT_eX]

[DOI]

Michael S. Paterson

Math. Log. Q., 1976

1974

Pi01 Classes and Boolean Combinations of Recursively Enumerable Sets.

[BibT_eX]

[DOI]

J. Symb. Log., 1974

1973

Post's Problem and His Hypersimple Set.

[BibT_eX]

[DOI]

J. Symb. Log., 1973

Encodability of Kleene's O.

[BibT_eX]

[DOI]

J. Symb. Log., 1973

An Application of sigma04 Determinancy to the Degrees of Unsolvability.

[BibT_eX]

[DOI]

J. Symb. Log., 1973

1972

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

[BibT_eX]

[DOI]

Joseph S. Ullian

Robert B. Barrett Jr.

J. Symb. Log., 1972

Ramsey's Theorem and Recursion Theory.

[BibT_eX]

[DOI]

J. Symb. Log., 1972

1971

A Minimal Pair of pi01 Classes.

[BibT_eX]

[DOI]

J. Symb. Log., 1971

1969

The Degrees of Hyperhyperimmune Sets.

[BibT_eX]

[DOI]

J. Symb. Log., 1969

1968

Uniformly Introreducible Sets.

[BibT_eX]

[DOI]