The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Carl G. Jockusch Jr.: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Douglas A. Cenzer, Rodney G. Downey, Carl G. Jockusch Jr., Richard A. Shore
    Countable Thin Pi01 Classes. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:59, n:2, pp:79-139 [Journal]
  2. Richard Coles, Rodney G. Downey, Carl G. Jockusch Jr., Geoffrey LaForte
    Completing pseudojump operators. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:136, n:3, pp:297-333 [Journal]
  3. Rodney G. Downey, Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel
    Difference Sets and Computability Theory. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:93, n:1-3, pp:63-72 [Journal]
  4. Rodney G. Downey, Carl G. Jockusch Jr., Joseph S. Miller
    On self-embeddings of computable linear orderings. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:52-76 [Journal]
  5. Carl G. Jockusch Jr., Robert I. Soare
    Degrees of Orderings Not Isomorphic to Recursive Linear Orderings. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1991, v:52, n:1-2, pp:39-64 [Journal]
  6. Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel
    Difference Sets and Inverting the Difference Operator. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:1, pp:87-106 [Journal]
  7. P. T. Bateman, Carl G. Jockusch Jr., Alan R. Woods
    Decidability and Undecidability of Theories with a Predicate for the Primes. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:2, pp:672-687 [Journal]
  8. Peter Cholak, Carl G. Jockusch Jr., Theodore A. Slaman
    On The Strength of Ramsey's Theorem for Pairs. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:1, pp:1-55 [Journal]
  9. Rodney G. Downey, Carl G. Jockusch Jr.
    Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank 1. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:1, pp:45-52 [Journal]
  10. 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. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1988, v:53, n:4, pp:1287-1299 [Journal]
  11. Tamara Lakins Hummel, Carl G. Jockusch Jr.
    Ramsey's Theorem for Computably Enumerable Colorings. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:2, pp:873-880 [Journal]
  12. Tamara Lakins Hummel, Carl G. Jockusch Jr.
    Generalized Cohesiveness. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:2, pp:489-516 [Journal]
  13. Carl G. Jockusch Jr.
    Ramsey's Theorem and Recursion Theory. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1972, v:37, n:2, pp:268-280 [Journal]
  14. Carl G. Jockusch Jr.
    An Application of sigma04 Determinancy to the Degrees of Unsolvability. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1973, v:38, n:2, pp:293-294 [Journal]
  15. Carl G. Jockusch Jr.
    Pi01 Classes and Boolean Combinations of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1974, v:39, n:1, pp:95-96 [Journal]
  16. Carl G. Jockusch Jr., Tamara J. Lakins
    Generalized R-Cohesiveness and The Arithmetical Hierarchy: A Correction to "Generalized Cohesiveness". [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:3, pp:1078-1082 [Journal]
  17. Carl G. Jockusch Jr., Richard Laver, J. Donald Monk, Jan Mycielski, Jon Pearce
    Annual Meeting of the Association for Symbolic Logic: Denver, 1983. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:2, pp:674-682 [Journal]
  18. Carl G. Jockusch Jr., A. Lewis, Jeffrey B. Remmel
    Pi01-Classes and Rado's Selection Principle. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1991, v:56, n:2, pp:684-693 [Journal]
  19. Carl G. Jockusch Jr., Manuel Lerman, Robert I. Soare, Robert Solovay
    Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:4, pp:1288-1323 [Journal]
  20. Carl G. Jockusch Jr., James C. Owings
    Weakly Semirecursive Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1990, v:55, n:2, pp:637-644 [Journal]
  21. Carl G. Jockusch Jr., David B. Posner
    Double Jumps of Minimal Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1978, v:43, n:4, pp:715-724 [Journal]
  22. Carl G. Jockusch Jr., Robert I. Soare
    A Minimal Pair of pi01 Classes. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1971, v:36, n:1, pp:66-78 [Journal]
  23. Carl G. Jockusch Jr., Robert I. Soare
    Encodability of Kleene's O. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1973, v:38, n:3, pp:437-440 [Journal]
  24. Carl G. Jockusch Jr., Robert I. Soare
    Post's Problem and His Hypersimple Set. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1973, v:38, n:3, pp:446-452 [Journal]
  25. Carl G. Jockusch Jr., Richard A. Shore
    Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:4, pp:1205-1236 [Journal]
  26. Carl G. Jockusch Jr., Theodore A. Slaman
    On the Sigma2-Theory of the Upper Semilattice of Turing Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:1, pp:193-204 [Journal]
  27. Carl G. Jockusch Jr., Robert I. Soare
    Boolean Algebras, Stone Spaces, and the Iterated Turing Jump. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1994, v:59, n:4, pp:1121-1138 [Journal]
  28. Carl G. Jockusch Jr., Alexandra Shalpentokh
    Weak Presentation of Computable Fields. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:199-208 [Journal]
  29. Carl G. Jockusch Jr., Robert I. Soare, William W. Tait, Gaisi Takeuti
    Meeting of the Association for Symbolic Logic: Chicago, 1977. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1978, v:43, n:3, pp:614-619 [Journal]
  30. Carl G. Jockusch Jr., Joseph S. Ullian, Robert B. Barrett Jr.
    Meeting of the Association for Symbolic Logic: St. Louis 1972. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1972, v:37, n:4, pp:775-782 [Journal]
  31. Carl G. Jockusch Jr.
    Uniformly Introreducible Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1968, v:33, n:4, pp:521-536 [Journal]
  32. Carl G. Jockusch Jr.
    The Degrees of Hyperhyperimmune Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1969, v:34, n:3, pp:489-493 [Journal]
  33. Carl G. Jockusch Jr., Frank Stephan
    Correction to "A Cohesive Set which is not High". [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1997, v:43, n:, pp:569- [Journal]
  34. Frank Stephan, Carl G. Jockusch Jr.
    A Cohesive Set which is not High. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1993, v:39, n:, pp:515-530 [Journal]

  35. Chains and antichains in partial orderings. [Citation Graph (, )][DBLP]


Search in 0.056secs, Finished in 0.058secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002