Carl G. Jockusch Jr. - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 53 from 53

2019

The reverse mathematics of Hindman's Theorem for sums of exactly two elementsBarbara F. Csima, Damir D. Dzhafarov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick. computability, 8(3-4):253-263, 2019. [doi]

2017

Effectiveness of Hindman's Theorem for Bounded SumsDamir D. Dzhafarov, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick. BIRTHDAY 2017: 134-142 [doi]

Asymptotic Density and the Theory of Computability: A Partial SurveyCarl G. Jockusch Jr., Paul E. Schupp. BIRTHDAY 2017: 501-520 [doi]

Herrmann's Beautiful Theorem on Computable Partial OrderingsCarl G. Jockusch Jr.. BIRTHDAY 2017: 127-133 [doi]

2016

On notions of computability-theoretic reduction between Π21 principlesDenis R. Hirschfeldt, Carl G. Jockusch Jr.. jml, 16(1):1650002, 2016. [doi]

Coarse Reducibility and Algorithmic RandomnessDenis R. Hirschfeldt, Carl G. Jockusch Jr., Rutger Kuyper, Paul E. Schupp. JSYML, 81(3):1028-1046, 2016. [doi]

Asymptotic density and the coarse computability boundDenis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp. computability, 5(1):13-27, 2016. [doi]

2015

Asymptotic density and the Ershov hierarchyRod Downey, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp. mlq, 61(3):189-195, 2015. [doi]

2013

Asymptotic density and computably Enumerable SetsRodney G. Downey, Carl G. Jockusch Jr., Paul E. Schupp. jml, 13(2):1350005, 2013. [doi]

Diagonally non-computable functions and bi-immunityCarl G. Jockusch Jr., Andrew E. M. Lewis. JSYML, 78(3):977-988, 2013. [doi]

2012

Generic computability, Turing degrees, and asymptotic densityCarl G. Jockusch Jr., Paul E. Schupp. jlms, 85(2):472-490, 2012. [doi]

2011

Binary subtrees with few labeled pathsRodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans. combinatorica, 31(3):285-303, 2011. [doi]

2009

Ramsey s theorem and cone avoidanceDamir D. Dzhafarov, Carl G. Jockusch Jr.. JSYML, 74(2):557-578, 2009. [doi]

Corrigendum to: On the strength of Ramsey s Theorem for pairs Peter Cholak Jr., Theodore A. Slaman, Carl G. Jockusch Jr.. JSYML, 74(4):1438-1439, 2009. [doi]

Stability and posetsCarl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon. JSYML, 74(2):693-711, 2009. [doi]

2007

Pi::1:::::0::: classes and strong degree spectra of relationsJohn Chisholm, Jennifer Chubb, Valentina S. Harizanov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Sarah Pingrey. JSYML, 72(3):1003-1018, 2007. [doi]

2006

On self-embeddings of computable linear orderingsRodney G. Downey, Carl G. Jockusch Jr., Joseph S. Miller. APAL, 138(1-3):52-76, 2006. [doi]

Restricted jump interpolation in the d.c.e. degreesCarl G. Jockusch Jr., Angsheng Li. mscs, 16(5):841-865, 2006. [doi]

2005

Completing pseudojump operatorsRichard Coles, Rodney G. Downey, Carl G. Jockusch Jr., Geoffrey LaForte. APAL, 136(3):297-333, 2005. [doi]

2002

Generalized R-Cohesiveness and The Arithmetical Hierarchy: A Correction to Generalized Cohesiveness Carl G. Jockusch Jr., Tamara J. Lakins. JSYML, 67(3):1078-1082, 2002.

2001

On The Strength of Ramsey s Theorem for PairsPeter Cholak, Carl G. Jockusch Jr., Theodore A. Slaman. JSYML, 66(1):1-55, 2001.

Ramsey s Theorem for Computably Enumerable ColoringsTamara Lakins Hummel, Carl G. Jockusch Jr.. JSYML, 66(2):873-880, 2001.

1999

Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank 1Rodney G. Downey, Carl G. Jockusch Jr.. JSYML, 64(1):45-52, 1999.

Generalized CohesivenessTamara Lakins Hummel, Carl G. Jockusch Jr.. JSYML, 64(2):489-516, 1999.

1998

Difference Sets and Computability TheoryRodney G. Downey, Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel. APAL, 93(1-3):63-72, 1998.

1997

Correction to A Cohesive Set which is not High Carl G. Jockusch Jr., Frank Stephan. mlq, 43:569, 1997.

1996

Difference Sets and Inverting the Difference OperatorZoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel. combinatorica, 16(1):87-106, 1996.

1995

Weak Presentation of Computable FieldsCarl G. Jockusch Jr., Alexandra Shalpentokh. JSYML, 60(1):199-208, 1995.

1994

Boolean Algebras, Stone Spaces, and the Iterated Turing JumpCarl G. Jockusch Jr., Robert I. Soare. JSYML, 59(4):1121-1138, 1994.

1993

Decidability and Undecidability of Theories with a Predicate for the PrimesP. T. Bateman, Carl G. Jockusch Jr., Alan R. Woods. JSYML, 58(2):672-687, 1993.

Countable Thin Pi:::0:::::1:: ClassesDouglas A. Cenzer, Rodney G. Downey, Carl G. Jockusch Jr., Richard A. Shore. APAL, 59(2):79-139, 1993.

On the Sigma::2::-Theory of the Upper Semilattice of Turing DegreesCarl G. Jockusch Jr., Theodore A. Slaman. JSYML, 58(1):193-204, 1993.

A Cohesive Set which is not HighFrank Stephan, Carl G. Jockusch Jr.. mlq, 39:515-530, 1993.

1991

Degrees of Orderings Not Isomorphic to Recursive Linear OrderingsCarl G. Jockusch Jr., Robert I. Soare. APAL, 52(1-2):39-64, 1991.

Pi:::0:::::1::-Classes and Rado s Selection PrincipleCarl G. Jockusch Jr., A. Lewis, Jeffrey B. Remmel. JSYML, 56(2):684-693, 1991.

1990

Weakly Semirecursive SetsCarl G. Jockusch Jr., James C. Owings. JSYML, 55(2):637-644, 1990.

1989

Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov s Completeness CriterionCarl G. Jockusch Jr., Manuel Lerman, Robert I. Soare, Robert Solovay. JSYML, 54(4):1288-1323, 1989.

1988

Annual Meeting of the Association for Symbolic Logic, New York City, December 1987Nicolas D. Goodman, Harold T. Hodes, Carl G. Jockusch Jr., Kenneth McAloon. JSYML, 53(4):1287-1299, 1988.

1984

Annual Meeting of the Association for Symbolic Logic: Denver, 1983Carl G. Jockusch Jr., Richard Laver, J. Donald Monk, Jan Mycielski, Jon Pearce. JSYML, 49(2):674-682, 1984.

Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal CoversCarl G. Jockusch Jr., Richard A. Shore. JSYML, 49(4):1205-1236, 1984.

1980

Fine Degrees of Word Problems of Cancellation SemigroupsCarl G. Jockusch Jr.. mlq, 26(1-6):93-95, 1980. [doi]

1978

Meeting of the Association for Symbolic Logic: Chicago, 1977Carl G. Jockusch Jr., Robert I. Soare, William W. Tait, Gaisi Takeuti. JSYML, 43(3):614-619, 1978.

Double Jumps of Minimal DegreesCarl G. Jockusch Jr., David B. Posner. JSYML, 43(4):715-724, 1978.

1976

Completely Autoreducible DegreesCarl G. Jockusch Jr., Michael S. Paterson. mlq, 22(1):571-575, 1976. [doi]

1974

Pi:::0:::::1:: Classes and Boolean Combinations of Recursively Enumerable SetsCarl G. Jockusch Jr.. JSYML, 39(1):95-96, 1974.

1973

An Application of sigma:::0:::::4:: Determinancy to the Degrees of UnsolvabilityCarl G. Jockusch Jr.. JSYML, 38(2):293-294, 1973.

Post s Problem and His Hypersimple SetCarl G. Jockusch Jr., Robert I. Soare. JSYML, 38(3):446-452, 1973.

Encodability of Kleene s OCarl G. Jockusch Jr., Robert I. Soare. JSYML, 38(3):437-440, 1973.

1972

Meeting of the Association for Symbolic Logic: St. Louis 1972Carl G. Jockusch Jr., Joseph S. Ullian, Robert B. Barrett Jr.. JSYML, 37(4):775-782, 1972.

Ramsey s Theorem and Recursion TheoryCarl G. Jockusch Jr.. JSYML, 37(2):268-280, 1972.

1971

A Minimal Pair of pi:::0:::::1:: ClassesCarl G. Jockusch Jr., Robert I. Soare. JSYML, 36(1):66-78, 1971.

1969

The Degrees of Hyperhyperimmune SetsCarl G. Jockusch Jr.. JSYML, 34(3):489-493, 1969.

1968

Uniformly Introreducible SetsCarl G. Jockusch Jr.. JSYML, 33(4):521-536, 1968.

Sign in or sign up to see more results.

runs on WebDSL