Source: J. Symbolic Logic
Volume 72, Issue 3
In , 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 
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 . 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.
Full-text: Access denied (no subscription
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.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription. Read more about accessing full-text
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.
S. Buechler, Essential Stability Theory, Springer, 1996.
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.
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.
H. Friedman and L. Stanley, A Borel reducibility theory for classes of countable structures, Journal of Symbolic Logic, vol. 54 (1989), pp. 894--914.
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.
G. Hjorth and A. S. Kechris, Recent developments in the theory of Borel reducibility, Fundamenta Mathematicae, vol. 170 (2001), pp. 21--52.
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.
M. Vanden Boom, Effective Borel hierarchy, Fundamenta Mathematicae, to appear.