Author:
Knight Julia F.,Miller Sara,Boom M. Vanden
Abstract
AbstractIn [3]. two different effective versions of Borel embedding are defined. The first, called computable embedding, is based on uniform enumeration reducibility. while the second, called Turing computable embedding, is based on uniform Turing reducibility. While [3] focused mainly on computable embeddings, the present paper considers Turing computable embeddings. Although the two notions are not equivalent, we can show that they behave alike on the mathematically interesting classes chosen for investigation in [3]. We give a “Pull-back Theorem”, saying that if Ф is a Turing computable embedding of K into K′, then for any computable infinitary sentence φ in the language of K′, we can find a computable infinitary sentence φ* in the language of K such that for all A ∈ K A ⊨ φ* iff Φ (A) ⊨ φ and φ* has the same “complexity” as φ (i.e., if φ is computable Σα or computable Πα, for α ≥ 1, then so is φ*). The Pull-back Theorem is useful in proving non-embeddability, and it has other applications as well.
Publisher
Cambridge University Press (CUP)
Reference14 articles.
1. [8] Greenberg N. , e-mail correspondence, 01, 2006.
2. Essential Stability Theory
3. The completeness of the isomorphism relation for countable Boolean algebras
4. The isomorphism relation on countable torsion-free Abelian groups;Hjorth;Fundament a Mathematicae,2002
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Classes of Algebraic Structures;Journal of Mathematical Sciences;2023-09
2. Learning algebraic structures with the help of Borel equivalence relations;Theoretical Computer Science;2023-03
3. On the effective universality of mereological theories;Mathematical Logic Quarterly;2021-11-22
4. Computable Categoricity;Computable Structure Theory;2021-07-31
5. Finite-Injury Constructions;Computable Structure Theory;2021-07-31