Computable embeddings for pairs of linear orders

DOI10.1007/s10469-021-09639-7OpenAlexW4288640842MaRDI QIDQ2055305

S. Vatev, Nikolay Bazhenov, Hristo Ganchev

Publication date: 1 December 2021

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.01933

zbMATH Keywords

computable linear ordercomputable embeddingenumeration operator

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Group theory and generalizations (20-XX)

Related Items

A note on computable embeddings for ordinals and their reverses

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pairs of recursive structures
• Topological properties of concept spaces (full version)
• Computable structures and the hyperarithmetical hierarchy
• Degree spectra and computable dimensions in algebraic structures
• Effective embeddings for pairs of structures
• Learning families of algebraic structures from informant
• On functors enumerating structures
• Computable embeddings of classes of structures under enumeration and Turing operators
• Enumerations in computable structure theory
• A Borel reductibility theory for classes of countable structures
• Classes of Ulm type and coding rank-homogeneous trees in other structures
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
• Isomorphism and classification for countable structures
• Turing computable embeddings
• Computable embeddings and strongly minimal theories
• Comparing Classes of Finite Structures
• COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY