Turing computable embeddings
From MaRDI portal
Publication:5422309
DOI10.2178/jsl/1191333847zbMath1123.03026OpenAlexW2149937309MaRDI QIDQ5422309
No author found.
Publication date: 17 October 2007
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jsl/1191333847
Related Items (max. 100)
Index set of structures with two equivalence relations that are autostable relative to strong constructivizations ⋮ Comparing classes of finite sums ⋮ On functors enumerating structures ⋮ Computable embeddings of classes of structures under enumeration and Turing operators ⋮ Agreement reducibility ⋮ On the effective universality of mereological theories ⋮ Classes of algebraic structures ⋮ Learning algebraic structures with the help of Borel equivalence relations ⋮ Learning families of algebraic structures from informant ⋮ 2006–07 Winter Meeting of the Association for Symbolic Logic ⋮ Isomorphism relations on computable structures ⋮ CODING IN GRAPHS AND LINEAR ORDERINGS ⋮ A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS ⋮ Turing computable embeddings of equivalences other than isomorphism ⋮ Categoricity spectra for polymodal algebras ⋮ Equivalence Relations on Classes of Computable Structures ⋮ Finitely generated groups are universal among finitely generated structures ⋮ The computable embedding problem ⋮ Using computability to measure complexity of algebraic structures and classes of structures ⋮ Computable transformations of structures ⋮ Turing computable embeddings, computable infinitary equivalence, and linear orders ⋮ 2007-2008 Winter Meeting of the Association for Symbolic Logic ⋮ Computable embeddings for pairs of linear orders ⋮ A note on computable embeddings for ordinals and their reverses
Cites Work
This page was built for publication: Turing computable embeddings
