A note on computable embeddings for ordinals and their reverses

DOI10.1007/978-3-030-51466-2_1OpenAlexW3105233830MaRDI QIDQ2106587

S. Vatev, Nikolay Bazhenov

Publication date: 16 December 2022

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

zbMATH Keywords

linear ordercomputable embeddingenumeration operator

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topological properties of concept spaces (full version)
• Degree spectra and computable dimensions in algebraic structures
• Computable embeddings for pairs of linear orders
• Graphs are not universal for online computability
• Learning families of algebraic structures from informant
• Computable embeddings of classes of structures under enumeration and Turing operators
• A Borel reductibility theory for classes of countable structures
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
• BOREL FUNCTORS AND INFINITARY INTERPRETATIONS
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Turing computable embeddings
• Computable embeddings and strongly minimal theories
• Comparing Classes of Finite Structures
• COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY

This page was built for publication: A note on computable embeddings for ordinals and their reverses