Embeddings of N₅ and the contiguous degrees

DOI10.1016/S0168-0072(01)00028-8MaRDI QIDQ5956887zbMATH OpenOpenAlexFDO

Authors Klaus Ambos-Spies, Peter A. Fejer

Publication date 30 January 2003

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0168-0072(01)00028-8

zbMATH Keywords

embeddingcontiguous degreescomputably enumerable degreeweak truth table degreenonmodular lattice

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2188433
• Bounding the number of embeddings of 5-connected projective-planar graphs
• Embedding graphs containing \(K_5\)-subdivisions on the torus
• Embedding graphs having Ore-degree at most five
• Cycle and Path Embedding on 5-ary N-cubes
• On embeddings of graphs containing noK5-minor
• The combinatorial properties of the hyperplanes of \(D\)W\((5,q)\) arising from embedding
• Re-embedding structures of 5-connected projective-planar graphs
• scientific article; zbMATH DE number 2170439
• Publication:4863245

Cites work

• scientific article; zbMATH DE number 4172959 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1136097 (Why is no real title available?)
• scientific article; zbMATH DE number 1531934 (Why is no real title available?)
• scientific article; zbMATH DE number 749917 (Why is no real title available?)
• scientific article; zbMATH DE number 3404227 (Why is no real title available?)
• Array nonrecursive degrees and lattice embeddings of the diamond
• Branching Degrees above low Degrees
• Contiguity and distributivity in the enumerable Turing degrees
• Decomposition of Recursively Enumerable Degrees
• Degree theoretic definitions of the low₂ recursively enumerable sets
• Degree theoretical splitting properties of recursively enumerable sets
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Lattice nonembeddings and initial segments of the recursively enumerable degrees
• Maximal contiguous degrees
• Not every finite lattice is embeddable in the recursively enumerable degrees
• The weak truth table degrees of recursively enumerable sets
• Wtt-degrees and T-degrees of r.e. sets

Cited in

(5)

• scientific article; zbMATH DE number 5178692 (Why is no real title available?)
• A hierarchy of computably enumerable degrees
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Computational processes, observers and Turing incompleteness
• Maximal contiguous degrees

This page was built for publication: Embeddings of \(N_5\) and the contiguous degrees

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