Turing computable embeddings and coding families of sets

DOI10.1007/978-3-642-30870-3_54zbMATH Open1358.03044OpenAlexW93176174MaRDI QIDQ2904450FDOQ2904450

Authors: Victor Ocasio González 

Publication date: 14 August 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30870-3_54

Recommendations

• Turing computable embeddings
• Turing computable embeddings, computable infinitary equivalence, and linear orders
• Comparing classes of finite sums
• CODING IN GRAPHS AND LINEAR ORDERINGS
• Effective embeddings for pairs of structures

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cited In (3)

• Comparing classes of finite sums
• Turing computable embeddings, computable infinitary equivalence, and linear orders
• Classes of Ulm type and coding rank-homogeneous trees in other structures

This page was built for publication: Turing computable embeddings and coding families of sets

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