A note on computable embeddings for ordinals and their reverses

DOI10.1007/978-3-030-51466-2_1MaRDI QIDQ2106587zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Computable embeddings for pairs of linear orders
• Effective embeddings for pairs of structures
• Embeddings of computable structures
• On self-embeddings of computable linear orderings
• Turing computable embeddings, computable infinitary equivalence, and linear orders

Cites work

• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• A Borel reductibility theory for classes of countable structures
• A certain reducibility on admissible sets
• A computable functor from graphs to fields
• BOREL FUNCTORS AND INFINITARY INTERPRETATIONS
• Comparing Classes of Finite Structures
• Computable embeddings and strongly minimal theories
• Computable embeddings for pairs of linear orders
• Computable embeddings of classes of structures under enumeration and Turing operators
• Computable functors and effective interpretability
• Degree spectra and computable dimensions in algebraic structures
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Graphs are not universal for online computability
• HF-computability
• Learning families of algebraic structures from informant
• Topological properties of concept spaces (full version)
• Turing computable embeddings

Cited in

(2)

• On bi-embeddable categoricity of algebraic structures
• A Note on Computable Embeddings for Ordinals and Their Reverses

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

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