Turing computable embeddings, computable infinitary equivalence, and linear orders
type: Item
instance of: scholarly article
title: Turing computable embeddings, computable infinitary equivalence, and linear orders
zbMATH Open document ID: 1496.03151
DOI: 10.1007/978-3-319-58741-7_15
publication date: 2017-08-04T00:00:00Z
Mathematics Subject Classification ID: 03C57
Mathematics Subject Classification ID: 06A05
Mathematics Subject Classification ID: 03D45
zbMATH DE Number: 6756757
zbMATH Keywords: Turing-computable embedding
zbMATH Keywords: linear order
zbMATH Keywords: ordinal
zbMATH Keywords: computable infinitary equivalence
zbMATH Keywords: computable structure
author: Nikolay Bazhenov
MaRDI profile type: Publication
full work available at URL: 978-3-319-58741-7 15
OpenAlex ID: W2612101967
cites work: Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
cites work: Degree spectra and computable dimensions in algebraic structures
cites work: Comparing Classes of Finite Structures
cites work: On Σ1 1 equivalence relations over the natural numbers
cites work: COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
cites work: A Borel reductibility theory for classes of countable structures
cites work: Turing computable embeddings
cites work: Computable embeddings and strongly minimal theories
cites work: Classes of Ulm type and coding rank-homogeneous trees in other structures
cites work: Turing Computable Embeddings and Coding Families of Sets
cites work: Comparing classes of finite sums
cites work: Turing computable embeddings of equivalences other than isomorphism
cites work: Q3961013
cites work: Computable structures and the hyperarithmetical hierarchy
cites work: Using computability to measure complexity of algebraic structures and classes of structures
cites work: Pairs of recursive structures
description: scientific article; zbMATH DE number 6756757