Effective embeddings into strong degree structures

DOI10.1002/MALQ.200310022MaRDI QIDQ4808462zbMATH OpenOpenAlexFDO

Authors Timothy H. McNicholl

Publication date 22 May 2003

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

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

zbMATH Keywords

computability theoryErshov hierarchystrong reducibilities

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Effective embeddings for pairs of structures
• A new approach to strong embeddings
• On strongly almost trivial embeddings of graphs
• scientific article; zbMATH DE number 1006489
• On strong embeddability and finite decomposition complexity
• Embeddings of graphs of fixed treewidth and bounded degree
• Embedding arbitrary graphs into strongly regular and distance-regular graphs
• Publication:4863245
• scientific article; zbMATH DE number 4164896
• On embedding well-separable graphs

Cited in

(1)

• Embeddings into the Turing degrees

This page was built for publication: Effective embeddings into strong degree structures

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