Bounding minimal pairs

DOI10.2307/2273300MaRDI QIDQ3864501zbMATH OpenOpenAlexFDO

Authors 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

existence of minimal pairsrecursively enumerable degree

Mathematics Subject Classification ID

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

Cited in

(22)

• Elementary differences among jump classes
• Structural interactions of the recursively enumerable T- and W-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
• Splitting theorems in recursion theory
• Minimal pairs in initial segments of the recursively enumerable degrees
• Complementing cappable degrees in the difference hierarchy.
• The recursively enumerable degrees have infinitely many one-types
• Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
• The existence of high nonbounding degrees in the difference hierarchy
• Nonstandard models in recursion theory and reverse mathematics
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• T-Degrees, Jump Classes, and Strong Reducibilities
• Some results about the R.E. degrees
• Recursively enumerable sets and degrees
• A hierarchy of computably enumerable degrees
• Non-bounding constructions
• Lattice nonembeddings and initial segments of the recursively enumerable degrees
• Minimal pairs for P
• On Lachlan's major sub-degree problem

This page was built for publication: Bounding minimal pairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3864501)