Embeddings of N₅ and the contiguous degrees

DOI10.1016/S0168-0072(01)00028-8zbMATH Open1003.03038OpenAlexW2048822891MaRDI QIDQ5956887FDOQ5956887

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

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

zbMATH Keywords

embeddingcontiguous degreescomputably enumerable degreeweak truth table degreenonmodular lattice

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Decomposition of Recursively Enumerable Degrees
• The weak truth table degrees of recursively enumerable sets
• Not every finite lattice is embeddable in the recursively enumerable degrees
• Degree theoretical splitting properties of recursively enumerable sets
• Branching Degrees above low Degrees
• Contiguity and distributivity in the enumerable Turing degrees
• Title not available (Why is that?)
• Lattice nonembeddings and initial segments of the recursively enumerable degrees
• Wtt-degrees and T-degrees of r.e. sets
• Array nonrecursive degrees and lattice embeddings of the diamond
• Degree theoretic definitions of the low₂ recursively enumerable sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximal contiguous degrees
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• 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)