Turing computable embeddings, computable infinitary equivalence, and linear orders

DOI10.1007/978-3-319-58741-7_15zbMATH Open1496.03151OpenAlexW2612101967MaRDI QIDQ2011646FDOQ2011646

Authors: Nikolay Bazhenov 

Publication date: 4 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-58741-7_15

Recommendations

• Computable embeddings for pairs of linear orders
• Turing computable embeddings
• Turing computable embeddings of equivalences other than isomorphism
• Turing computable embeddings and coding families of sets
• CODING IN GRAPHS AND LINEAR ORDERINGS

zbMATH Keywords

ordinalcomputable structurelinear ordercomputable infinitary equivalenceTuring-computable embedding

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Total orders (06A05)

Cites Work

• Computable structures and the hyperarithmetical hierarchy
• Comparing classes of finite sums
• A Borel reductibility theory for classes of countable structures
• On Σ¹ ₁ equivalence relations over the natural numbers
• Classes of Ulm type and coding rank-homogeneous trees in other structures
• Turing computable embeddings
• Comparing Classes of Finite Structures
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Pairs of recursive structures
• Degree spectra and computable dimensions in algebraic structures
• Using computability to measure complexity of algebraic structures and classes of structures
• Title not available (Why is that?)
• Turing computable embeddings of equivalences other than isomorphism
• Computable functors and effective interpretability
• Turing computable embeddings and coding families of sets
• Computable embeddings and strongly minimal theories

Cited In (10)

• Turing computable embeddings of equivalences other than isomorphism
• Turing computable embeddings and coding families of sets
• Comparing classes of finite sums
• Turing computable embeddings
• On bi-embeddable categoricity of algebraic structures
• Computable embeddings for pairs of linear orders
• Punctual categoricity spectra of computably categorical structures
• Turing L-machines and recursive computability for L-maps
• Embedding jump upper semilattices into the Turing degrees
• CODING IN GRAPHS AND LINEAR ORDERINGS

This page was built for publication: Turing computable embeddings, computable infinitary equivalence, and linear orders

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