Turing computable embeddings, computable infinitary equivalence, and linear orders
From MaRDI portal
Publication:2011646
DOI10.1007/978-3-319-58741-7_15zbMath1496.03151OpenAlexW2612101967MaRDI QIDQ2011646
Publication date: 4 August 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-58741-7_15
Total orders (06A05) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (2)
Punctual categoricity spectra of computably categorical structures ⋮ On bi-embeddable categoricity of algebraic structures
Cites Work
- Unnamed Item
- Comparing classes of finite sums
- Pairs of recursive structures
- Computable structures and the hyperarithmetical hierarchy
- Degree spectra and computable dimensions in algebraic structures
- Using computability to measure complexity of algebraic structures and classes of structures
- Turing Computable Embeddings and Coding Families of Sets
- A Borel reductibility theory for classes of countable structures
- On Σ1 1 equivalence relations over the natural numbers
- Classes of Ulm type and coding rank-homogeneous trees in other structures
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- Turing computable embeddings of equivalences other than isomorphism
- 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: Turing computable embeddings, computable infinitary equivalence, and linear orders
