### Turing computable embeddings

Julia F. Knight, Sara Miller, and M. Vanden Boom
Source: J. Symbolic Logic Volume 72, Issue 3 (2007), 901-918.

#### Abstract

In [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 𝒜∈ K, 𝒜⊨φ* iff Φ(𝒜)⊨φ, 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.

First Page:
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.

Permanent link to this document: http://projecteuclid.org/euclid.jsl/1191333847
Digital Object Identifier: doi:10.2178/jsl/1191333847
Mathematical Reviews number (MathSciNet): MR2354906
Zentralblatt MATH identifier: 1123.03026

### References

C. J. Ash and J. F. Knight, Computable Structures and the Hyperarithmetical Hierarchy, Studies in Logic and the Foundations of Mathematics, vol. 144, Elsevier, 2000.
Mathematical Reviews (MathSciNet): MR1767842
Zentralblatt MATH: 0960.03001
S. Buechler, Essential Stability Theory, Springer, 1996.
Mathematical Reviews (MathSciNet): MR1416106
Zentralblatt MATH: 0864.03025
W. Calvert, D. Cummins, S. Miller, and J. F. Knight, Comparing classes of finite structures, Algebra and Logic, vol. 43 (2004), pp. 365--373.
R. Camerlo and S. Gao, The completeness of the isomorphism relation for countable Boolean algebras, Transactions of the American Mathematical Society, vol. 353 (2001), pp. 491--518.
Mathematical Reviews (MathSciNet): MR1804507
Digital Object Identifier: doi:10.1090/S0002-9947-00-02659-3
Zentralblatt MATH: 0960.03041
J. Chisholm, J. F. Knight, and S. Miller, Solution to a problem on computable embeddings, Journal of Symbolic Logic, vol. 72 (2007), pp. 1031--1040.
Mathematical Reviews (MathSciNet): MR2354913
Digital Object Identifier: doi:10.2178/jsl/1191333854
Project Euclid: euclid.jsl/1191333854
Zentralblatt MATH: 1127.03030
H. Friedman and L. Stanley, A Borel reducibility theory for classes of countable structures, Journal of Symbolic Logic, vol. 54 (1989), pp. 894--914.
Mathematical Reviews (MathSciNet): MR1011177
Digital Object Identifier: doi:10.2307/2274750
Project Euclid: euclid.jsl/1183743025
Zentralblatt MATH: 0692.03022
N. Greenberg, conversations,Spring, 2005.
--------, e-mail correspondence,Janaury, 2006.
G. Hjorth, The isomorphism relation on countable torsion-free Abelian groups, Fundamenta Mathematicae, vol. 175 (2002), pp. 241--257.
Mathematical Reviews (MathSciNet): MR1969658
G. Hjorth and A. S. Kechris, Recent developments in the theory of Borel reducibility, Fundamenta Mathematicae, vol. 170 (2001), pp. 21--52.
Mathematical Reviews (MathSciNet): MR1881047
I. Kalimullin, e-mail correspondence,June--July, 2005.
J. F. Knight, A result on the degree structure associated with computable embedding, unpublished.
D. Marker, Model Theory: An Introduction, Springer, 2002.
Mathematical Reviews (MathSciNet): MR1924282
M. Vanden Boom, Effective Borel hierarchy, Fundamenta Mathematicae, to appear.
Mathematical Reviews (MathSciNet): MR2338544