Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Transactions of the American Mathematical Society
Transactions of the American Mathematical Society
ISSN 1088-6850(online) ISSN 0002-9947(print)

 

Extensions of embeddings below computably enumerable degrees


Authors: Rod Downey, Noam Greenberg, Andrew Lewis and Antonio Montalbán
Journal: Trans. Amer. Math. Soc. 365 (2013), 2977-3018
MSC (2010): Primary 03D28; Secondary 03D25
Published electronically: December 13, 2012
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: Toward establishing the decidability of the two-quantifier theory of the $ \Delta ^0_2$ Turing degrees with join, we study extensions of embeddings of upper-semi-lattices into the initial segments of Turing degrees determined by computably enumerable sets, in particular, the degree of the halting set $ \boldsymbol {0}'$. We obtain a good deal of sufficient and necessary conditions.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Transactions of the American Mathematical Society with MSC (2010): 03D28, 03D25

Retrieve articles in all journals with MSC (2010): 03D28, 03D25


Additional Information

Rod Downey
Affiliation: School of Mathematics, Statistics and Computer Science, Victoria University, P.O. Box 600, Wellington, New Zealand
Email: Rod.Downey@msor.vuw.ac.nz

Noam Greenberg
Affiliation: School of Mathematics, Statistics and Computer Science, Victoria University. P.O. Box 600, Wellington, New Zealand
Email: greenberg@msor.vuw.ac.nz

Andrew Lewis
Affiliation: School of Mathematics, University of Leeds, Leeds, United Kingdom
Email: andy@aemlewis.co.uk

Antonio Montalbán
Affiliation: Department of Mathematics, University of Chicago, 5734 S. University Ave., Chicago, Illinois 60637
Email: antonio@math.uchicago.edu

DOI: http://dx.doi.org/10.1090/S0002-9947-2012-05660-1
PII: S 0002-9947(2012)05660-1
Keywords: Turing degrees, decidability, extensions of embeddings
Received by editor(s): December 9, 2009
Received by editor(s) in revised form: June 30, 2011
Published electronically: December 13, 2012
Additional Notes: The first two authors were supported by the Marsden Fund of New Zealand.
The third author was supported by a Royal Society University Research Fellowship.
The fourth author was partially supported by NSF Grant DMS-0600824, and by the Marsden Fund of New Zealand via a postdoctoral fellowship.
Article copyright: © Copyright 2012 American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication.