Bounding minimal pairs

DOI10.2307/2273300zbMath0428.03037OpenAlexW1994697128MaRDI QIDQ3864501

Alistair H. Lachlan

Publication date: 1979

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273300

zbMATH Keywords

recursively enumerable degreeexistence of minimal pairs

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (22)

Structural interactions of the recursively enumerable T- and W-degrees ⋮ An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees ⋮ Intervals and sublattices of the r.e. weak truth table degrees. I: Density ⋮ Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding ⋮ Classification of degree classes associated with r.e. subspaces ⋮ A non-inversion theorem for the jump operator ⋮ Minimal pairs in initial segments of the recursively enumerable degrees ⋮ NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS ⋮ Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree ⋮ Some results about the R.E. degrees ⋮ Complementing cappable degrees in the difference hierarchy. ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ On Lachlan's major sub-degree problem ⋮ Elementary differences among jump classes ⋮ Recursively enumerable sets and degrees ⋮ T-Degrees, Jump Classes, and Strong Reducibilities ⋮ Non-bounding constructions ⋮ Lattice nonembeddings and initial segments of the recursively enumerable degrees ⋮ The recursively enumerable degrees have infinitely many one-types ⋮ Minimal pairs for P ⋮ The existence of high nonbounding degrees in the difference hierarchy ⋮ Splitting theorems in recursion theory

This page was built for publication: Bounding minimal pairs