The following pages link to Carl G. jun. Jockusch (Q654000):
Displaying 50 items.
- Binary subtrees with few labeled paths (Q654001) (← links)
- Degrees of orderings not isomorphic to recursive linear orderings (Q810503) (← links)
- Chains and antichains in partial orderings (Q1005926) (← links)
- Recursively enumerable sets and van der Waerden's theorem on arithmetic progressions (Q1061736) (← links)
- Automorphism bases for degrees of unsolvability (Q1164625) (← links)
- Countable thin \(\Pi^0_1\) classes (Q1208080) (← links)
- A lattice property of Post's simple set (Q1218849) (← links)
- Fixed points of jump preserving automorphisms of degrees (Q1244338) (← links)
- Difference sets and computability theory (Q1295385) (← links)
- Upward closure and cohesive degrees (Q1394222) (← links)
- Difference sets and inverting the difference operator (Q1912753) (← links)
- Countable retracing functions and \(\Pi_2^0\) predicates (Q2534881) (← links)
- Degrees of members of \(\Pi_ 1^ 0\) classes (Q2543461) (← links)
- On self-embeddings of computable linear orderings (Q2576940) (← links)
- On the strength of Ramsey's theorem for pairs (Q2732267) (← links)
- Ramsey's theorem for computably enumerable colorings (Q2747723) (← links)
- Richard A. Shore and Theodore A. Slaman. Defining the Turing jump. Mathematical research letters, vol. 6 (1999), pp. 711–722. (Q2778664) (← links)
- Asymptotic density and the coarse computability bound (Q2799747) (← links)
- Diagonally Non-Computable Functions and Bi-Immunity (Q2869911) (← links)
- Generic computability, Turing degrees, and asymptotic density (Q2880398) (← links)
- Herrmann’s Beautiful Theorem on Computable Partial Orderings (Q2970954) (← links)
- Effectiveness of Hindman’s Theorem for Bounded Sums (Q2970955) (← links)
- Asymptotic Density and the Theory of Computability: A Partial Survey (Q2970976) (← links)
- COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS (Q2976378) (← links)
- Decidability and undecidability of theories with a predicate for the primes (Q3138021) (← links)
- Asymptotic density, computable traceability, and 1-randomness (Q3178221) (← links)
- On notions of computability-theoretic reduction between Π21 principles (Q3186057) (← links)
- (Q3197814) (← links)
- Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees (Q3317093) (← links)
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees (Q3325709) (← links)
- Restricted jump interpolation in the d.c.e. degrees (Q3422022) (← links)
- (Q3469096) (← links)
- Weakly semirecursive sets (Q3480024) (← links)
- Jumps of Orderings (Q3484823) (← links)
- Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion (Q3489987) (← links)
- The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs (Q3530396) (← links)
- Ramsey's theorem and cone avoidance (Q3630579) (← links)
- Stability and posets (Q3630588) (← links)
- Corrigendum to: “On the strength of Ramsey's Theorem for pairs” (Q3655265) (← links)
- Pseudo Jump Operators. I: The R. E. Case (Q3659772) (← links)
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers (Q3691653) (← links)
- (Q3724315) (← links)
- (Q3755447) (← links)
- T-Degrees, Jump Classes, and Strong Reducibilities (Q3778736) (← links)
- Fine Degrees of Word Problems of Cancellation Semigroups (Q3885749) (← links)
- (Q3905267) (← links)
- (Q3926563) (← links)
- <i>Π</i><sub>0</sub><sup>1</sup>-classes and Rado's selection principle (Q3984442) (← links)
- A degree-theoretic definition of the ramified analytical hierarchy (Q4100082) (← links)
- Recursiveness of initial segments of Kleene's O (Q4105661) (← links)
