default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarl G. Jockusch Jr.
Person information
- affiliation: University of Illinois, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j52]Denis R. Hirschfeldt, Carl G. Jockusch Jr., Paul E. Schupp:
Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics. J. Math. Log. 24(2): 2350005:1-2350005:76 (2024)
2010 – 2019
- 2019
- [j51]Barbara F. Csima, Damir D. Dzhafarov
, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick:
The reverse mathematics of Hindman's Theorem for sums of exactly two elements. Comput. 8(3-4): 253-263 (2019) - 2017
- [c3]Carl G. Jockusch Jr.:
Herrmann's Beautiful Theorem on Computable Partial Orderings. Computability and Complexity 2017: 127-133 - [c2]Damir D. Dzhafarov, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick:
Effectiveness of Hindman's Theorem for Bounded Sums. Computability and Complexity 2017: 134-142 - [c1]Carl G. Jockusch Jr., Paul E. Schupp:
Asymptotic Density and the Theory of Computability: A Partial Survey. Computability and Complexity 2017: 501-520 - 2016
- [j50]Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp:
Asymptotic density and the coarse computability bound. Comput. 5(1): 13-27 (2016) - [j49]Denis R. Hirschfeldt, Carl G. Jockusch Jr.:
On notions of computability-theoretic reduction between Π21 principles. J. Math. Log. 16(1): 1650002:1-1650002:59 (2016) - [j48]Denis R. Hirschfeldt, Carl G. Jockusch Jr., Rutger Kuyper, Paul E. Schupp:
Coarse Reducibility and Algorithmic Randomness. J. Symb. Log. 81(3): 1028-1046 (2016) - 2015
- [j47]Rod Downey, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp:
Asymptotic density and the Ershov hierarchy. Math. Log. Q. 61(3): 189-195 (2015) - 2013
- [j46]Rodney G. Downey, Carl G. Jockusch Jr., Paul E. Schupp:
Asymptotic density and computably Enumerable Sets. J. Math. Log. 13(2): 1350005 (2013) - [j45]Carl G. Jockusch Jr., Andrew E. M. Lewis:
Diagonally non-computable functions and bi-immunity. J. Symb. Log. 78(3): 977-988 (2013) - 2012
- [j44]Carl G. Jockusch Jr., Paul E. Schupp:
Generic computability, Turing degrees, and asymptotic density. J. Lond. Math. Soc. 85(2): 472-490 (2012) - 2011
- [j43]Rodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans:
Binary subtrees with few labeled paths. Comb. 31(3): 285-303 (2011)
2000 – 2009
- 2009
- [j42]Valentina S. Harizanov, Carl G. Jockusch Jr., Julia F. Knight:
Chains and antichains in partial orderings. Arch. Math. Log. 48(1): 39-53 (2009) - [j41]Damir D. Dzhafarov, Carl G. Jockusch Jr.:
Ramsey's theorem and cone avoidance. J. Symb. Log. 74(2): 557-578 (2009) - [j40]Carl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon:
Stability and posets. J. Symb. Log. 74(2): 693-711 (2009) - [j39]Peter Cholak, Theodore A. Slaman, Carl G. Jockusch Jr.:
Corrigendum to: "On the strength of Ramsey's Theorem for pairs". J. Symb. Log. 74(4): 1438-1439 (2009) - 2007
- [j38]John Chisholm, Jennifer Chubb, Valentina S. Harizanov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Sarah Pingrey:
Π10 classes and strong degree spectra of relations. J. Symb. Log. 72(3): 1003-1018 (2007) - 2006
- [j37]Rodney G. Downey, Carl G. Jockusch Jr., Joseph S. Miller:
On self-embeddings of computable linear orderings. Ann. Pure Appl. Log. 138(1-3): 52-76 (2006) - [j36]Carl G. Jockusch Jr., Angsheng Li:
Restricted jump interpolation in the d.c.e. degrees. Math. Struct. Comput. Sci. 16(5): 841-865 (2006) - 2005
- [j35]Richard Coles, Rodney G. Downey, Carl G. Jockusch Jr., Geoffrey LaForte:
Completing pseudojump operators. Ann. Pure Appl. Log. 136(3): 297-333 (2005) - 2002
- [j34]Carl G. Jockusch Jr., Tamara J. Lakins:
Generalized R-Cohesiveness and The Arithmetical Hierarchy: A Correction to "Generalized Cohesiveness". J. Symb. Log. 67(3): 1078-1082 (2002) - 2001
- [j33]Peter Cholak, Carl G. Jockusch Jr., Theodore A. Slaman:
On The Strength of Ramsey's Theorem for Pairs. J. Symb. Log. 66(1): 1-55 (2001) - [j32]Tamara Lakins Hummel, Carl G. Jockusch Jr.:
Ramsey's Theorem for Computably Enumerable Colorings. J. Symb. Log. 66(2): 873-880 (2001)
1990 – 1999
- 1999
- [j31]Rodney G. Downey, Carl G. Jockusch Jr.:
Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank 1. J. Symb. Log. 64(1): 45-52 (1999) - [j30]Tamara Lakins Hummel, Carl G. Jockusch Jr.:
Generalized Cohesiveness. J. Symb. Log. 64(2): 489-516 (1999) - 1998
- [j29]Rodney G. Downey, Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel:
Difference Sets and Computability Theory. Ann. Pure Appl. Log. 93(1-3): 63-72 (1998) - 1997
- [j28]Carl G. Jockusch Jr., Frank Stephan:
Correction to "A Cohesive Set which is not High". Math. Log. Q. 43: 569 (1997) - 1996
- [j27]Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel:
Difference Sets and Inverting the Difference Operator. Comb. 16(1): 87-106 (1996) - 1995
- [j26]Carl G. Jockusch Jr., Alexandra Shalpentokh:
Weak Presentation of Computable Fields. J. Symb. Log. 60(1): 199-208 (1995) - 1994
- [j25]Carl G. Jockusch Jr., Robert I. Soare:
Boolean Algebras, Stone Spaces, and the Iterated Turing Jump. J. Symb. Log. 59(4): 1121-1138 (1994) - 1993
- [j24]Douglas A. Cenzer, Rodney G. Downey, Carl G. Jockusch Jr., Richard A. Shore:
Countable Thin Pi01 Classes. Ann. Pure Appl. Log. 59(2): 79-139 (1993) - [j23]Carl G. Jockusch Jr., Theodore A. Slaman:
On the Sigma2-Theory of the Upper Semilattice of Turing Degrees. J. Symb. Log. 58(1): 193-204 (1993) - [j22]P. T. Bateman, Carl G. Jockusch Jr., Alan R. Woods:
Decidability and Undecidability of Theories with a Predicate for the Primes. J. Symb. Log. 58(2): 672-687 (1993) - [j21]Frank Stephan, Carl G. Jockusch Jr.:
A Cohesive Set which is not High. Math. Log. Q. 39: 515-530 (1993) - 1991
- [j20]Carl G. Jockusch Jr., Robert I. Soare:
Degrees of Orderings Not Isomorphic to Recursive Linear Orderings. Ann. Pure Appl. Log. 52(1-2): 39-64 (1991) - [j19]Carl G. Jockusch Jr., Andrew E. M. Lewis, Jeffrey B. Remmel:
Pi01-Classes and Rado's Selection Principle. J. Symb. Log. 56(2): 684-693 (1991) - 1990
- [j18]Carl G. Jockusch Jr., James C. Owings:
Weakly Semirecursive Sets. J. Symb. Log. 55(2): 637-644 (1990)
1980 – 1989
- 1989
- [j17]Carl G. Jockusch Jr., Manuel Lerman, Robert I. Soare, Robert Solovay:
Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion. J. Symb. Log. 54(4): 1288-1323 (1989) - 1988
- [j16]Nicolas D. Goodman, Harold T. Hodes, Carl G. Jockusch Jr., Kenneth McAloon:
Annual Meeting of the Association for Symbolic Logic, New York City, December 1987. J. Symb. Log. 53(4): 1287-1299 (1988) - 1984
- [j15]Carl G. Jockusch Jr., Richard Laver, J. Donald Monk, Jan Mycielski, Jon Pearce:
Annual Meeting of the Association for Symbolic Logic: Denver, 1983. J. Symb. Log. 49(2): 674-682 (1984) - [j14]Carl G. Jockusch Jr., Richard A. Shore:
Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers. J. Symb. Log. 49(4): 1205-1236 (1984) - 1980
- [j13]Carl G. Jockusch Jr.:
Fine Degrees of Word Problems of Cancellation Semigroups. Math. Log. Q. 26(1-6): 93-95 (1980)
1970 – 1979
- 1978
- [j12]Carl G. Jockusch Jr., Robert I. Soare, William W. Tait, Gaisi Takeuti:
Meeting of the Association for Symbolic Logic: Chicago, 1977. J. Symb. Log. 43(3): 614-619 (1978) - [j11]Carl G. Jockusch Jr., David B. Posner:
Double Jumps of Minimal Degrees. J. Symb. Log. 43(4): 715-724 (1978) - 1976
- [j10]Carl G. Jockusch Jr., Michael S. Paterson:
Completely Autoreducible Degrees. Math. Log. Q. 22(1): 571-575 (1976) - 1974
- [j9]Carl G. Jockusch Jr.:
Pi01 Classes and Boolean Combinations of Recursively Enumerable Sets. J. Symb. Log. 39(1): 95-96 (1974) - 1973
- [j8]Carl G. Jockusch Jr.:
An Application of sigma04 Determinancy to the Degrees of Unsolvability. J. Symb. Log. 38(2): 293-294 (1973) - [j7]Carl G. Jockusch Jr., Robert I. Soare:
Encodability of Kleene's O. J. Symb. Log. 38(3): 437-440 (1973) - [j6]Carl G. Jockusch Jr., Robert I. Soare:
Post's Problem and His Hypersimple Set. J. Symb. Log. 38(3): 446-452 (1973) - 1972
- [j5]Carl G. Jockusch Jr.:
Ramsey's Theorem and Recursion Theory. J. Symb. Log. 37(2): 268-280 (1972) - [j4]Carl G. Jockusch Jr., Joseph S. Ullian, Robert B. Barrett Jr.:
Meeting of the Association for Symbolic Logic: St. Louis 1972. J. Symb. Log. 37(4): 775-782 (1972) - 1971
- [j3]Carl G. Jockusch Jr., Robert I. Soare:
A Minimal Pair of pi01 Classes. J. Symb. Log. 36(1): 66-78 (1971)
1960 – 1969
- 1969
- [j2]Carl G. Jockusch Jr.:
The Degrees of Hyperhyperimmune Sets. J. Symb. Log. 34(3): 489-493 (1969) - 1968
- [j1]Carl G. Jockusch Jr.:
Uniformly Introreducible Sets. J. Symb. Log. 33(4): 521-536 (1968)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
