Turing computable embeddings, computable infinitary equivalence, and linear orders
From MaRDI portal
Publication:2011646
DOI10.1007/978-3-319-58741-7_15zbMATH Open1496.03151OpenAlexW2612101967MaRDI QIDQ2011646FDOQ2011646
Publication date: 4 August 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-58741-7_15
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Total orders (06A05)
Cites Work
- Title not available (Why is that?)
- Computable structures and the hyperarithmetical hierarchy
- Comparing classes of finite sums
- 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
- 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
- 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 (5)
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)
