A note on computable embeddings for ordinals and their reverses
From MaRDI portal
Publication:2106587
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
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)
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)
