Turing computable embeddings

DOI10.2178/JSL/1191333847MaRDI QIDQ5422309zbMATH OpenOpenAlexFDO

Authors

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

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Recommendations

• Turing computable embeddings, computable infinitary equivalence, and linear orders
• Turing computable embeddings of equivalences other than isomorphism
• Embeddings of computable structures
• Comparing classes of finite sums
• The effective Borel hierarchy

Cites work

• A Borel reductibility theory for classes of countable structures
• Computable structures and the hyperarithmetical hierarchy
• scientific article; zbMATH DE number 914513 (Why is no real title available?)
• scientific article; zbMATH DE number 3027246 (Why is no real title available?)
• Model Theory

Cited in

(35)

• Turing L-machines and recursive computability for L-maps
• Finitely generated groups are universal among finitely generated structures
• Computable transformations of structures
• Turing computable embeddings, computable infinitary equivalence, and linear orders
• Computable embeddings for pairs of linear orders
• A note on computable embeddings for ordinals and their reverses
• Effective embeddings for pairs of structures
• Learning families of algebraic structures from informant
• Using computability to measure complexity of algebraic structures and classes of structures
• Index set of structures with two equivalence relations that are autostable relative to strong constructivizations
• On functors enumerating structures
• Terminal embeddings
• Computable embeddings of classes of structures under enumeration and Turing operators
• Learning algebraic structures with the help of Borel equivalence relations
• Comparing classes of finite sums
• Turing computable embeddings and coding families of sets
• Classes of Ulm type and coding rank-homogeneous trees in other structures
• 2006–07 Winter Meeting of the Association for Symbolic Logic
• Equivalence Relations on Classes of Computable Structures
• 2007-2008 Winter Meeting of the Association for Symbolic Logic
• A computable functor from graphs to fields
• Categoricity spectra for polymodal algebras
• CODING IN GRAPHS AND LINEAR ORDERINGS
• Isomorphism relations on computable structures
• Turing computable embeddings of equivalences other than isomorphism
• Agreement reducibility
• On the effective universality of mereological theories
• Classes of algebraic structures
• On learning for families of algebraic structures
• Relations enumerable from positive information
• A Lopez-Escobar theorem for continuous domains
• The computable embedding problem
• Learning families of algebraic structures from text
• On computability-theoretic universality of Boolean-valued models
• Embeddings of computable structures

This page was built for publication: Turing computable embeddings

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