( en | de | ru )

 

Disambiguation of "Jr., Carl G. Jockusch"

Author of the publication

copydeleteadd this publication to your clipboard
Asymptotic density and computably Enumerable Sets.

, , and . J. Math. Log., 13 (2): 1350005 (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ilse Jockusch

Carl G Schmidt

Carl G Schmidt

Carl G Schmidt

Foued Jrad

 

Other publications of authors with the same name

Asymptotic Density and the Theory of Computability: A Partial Survey., and . Computability and Complexity, volume 10010 of Lecture Notes in Computer Science, page 501-520. Springer, (2017)A Cohesive Set which is not High., and . Math. Log. Q., (1993)The reverse mathematics of Hindman's Theorem for sums of exactly two elements., , , , , and . Comput., 8 (3-4): 253-263 (2019)Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics., , and . J. Math. Log., 24 (2): 2350005:1-2350005:76 (August 2024)Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion., , , and . J. Symb. Log., 54 (4): 1288-1323 (1989)Herrmann's Beautiful Theorem on Computable Partial Orderings.. Computability and Complexity, volume 10010 of Lecture Notes in Computer Science, page 127-133. Springer, (2017)Fine Degrees of Word Problems of Cancellation Semigroups.. Math. Log. Q., 26 (1-6): 93-95 (1980)Asymptotic density and computably Enumerable Sets., , and . J. Math. Log., 13 (2): 1350005 (2013)Effectiveness of Hindman's Theorem for Bounded Sums., , , and . Computability and Complexity, volume 10010 of Lecture Notes in Computer Science, page 134-142. Springer, (2017)On self-embeddings of computable linear orderings., , and . Ann. Pure Appl. Log., 138 (1-3): 52-76 (2006)