A note on computable embeddings for ordinals and their reverses

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

Authors: S. Vatev, Nikolay Bazhenov 

Publication date: 16 December 2022

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

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

zbMATH Keywords

linear ordercomputable embeddingenumeration operator

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

Cited In (2)

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

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)