Embedding Lattices with Top Preserved Below Non‐GL2 Degrees

DOI10.1002/MALQ.19890350102MaRDI QIDQ5202647zbMATH OpenOpenAlexFDO

Authors Peter A. Fejer

Publication date 1989

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19890350102

zbMATH Keywords

recursive partial orderrecursively presented latticeTuring degrees

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• scientific article; zbMATH DE number 749917
• Lattice embeddings into the recursively enumerable degrees. II
• scientific article; zbMATH DE number 3954890
• Embedding lattices into the wtt-degrees below 0′
• scientific article; zbMATH DE number 733390

Cited in

(12)

• The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory
• Lattice representations for computability theory
• Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
• A nonlow\(_2\) r. e. degree with the extension of embeddings properties of a low\(_2\) degree
• Embedding distributive lattices in the ^0_2 enumeration degrees
• Lattice Embeddings in the Recursively Enumerable Truth Table Degrees
• On the T-degrees of partial functions
• scientific article; zbMATH DE number 3954890 (Why is no real title available?)
• Embedding lattices into the wtt-degrees below 0′
• scientific article; zbMATH DE number 733390 (Why is no real title available?)
• Embedding and coding below a 1-generic degree
• There is no ordering on the classes in the generalized high/low hierarchies

This page was built for publication: Embedding Lattices with Top Preserved Below Non‐GL₂ Degrees

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