Skip Navigation


Journal of Logic and Computation Advance Access originally published online on July 18, 2008
Journal of Logic and Computation 2009 19(1):77-87; doi:10.1093/logcom/exn028
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cenzer, D.
Right arrow Articles by Wu, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

This article appears in the following Journal of Logic and Computation issue: Special Issue: Logic and Computation in the Real World: CiE 2007 [View the issue table of contents]

Original Articles

Pseudojumps and Formula Classes*

Douglas Cenzer

Department of Mathematics, University of Florida, P.O. Box 118105, Gainesville, Florida 32611, USA
E-mail: cenzer{at}math.ufl.edu

Geoffrey Laforte

Department of Mathematics and Statistics, University of West Florida, Pensacola, Florida 32514, USA
E-mail: glaforte{at}uwf.edu

Guohua Wu

School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore 639798
E-mail: guohua{at}ntu.edu.sg

Received 26 September 2007.

For a pseudojump VX and a Formula class P, we consider properties of the set {VX:X isin P}.We show that if P is Medvedev complete or if P has positive measure, and Ø' ≤T C, then there exists X isin P with VX {equiv}T C. We examine the consequences when VX is Turing incomparable with VY for X != Y in P and when Formula for all X, Y isin P. Finally, we give a characterization of the jump in terms of Formula classes.

Keywords: Computability; {Pi}Formula Classes

*Support for this research was provided by National Science Foundation awards DMS 0532644 and DMS 0652732.



References

  1. Cenzer D, Remmel JB. Formula classes in mathematics. In: Handbook of Recursive Mathematics, Part Two.—Ershov Y, Goncharov S, Nerode A, Remmel J, eds. (1998) 139. Elsevier, New York: Elsevier Studies in Logic. 623–821.
  2. Coles R, Downey R, Jockusch C. Completing pseudojump operators. Annals of Pure and Applied Logic (2005) 136:297–333.[CrossRef][Web of Science]
  3. Downey R, Miller J. Abasis theorem for Formula classes of positive measure and jump inversion for random reals. Proceedings of the American Mathematical Society (2006) 134:283–288.[CrossRef][Web of Science]
  4. Friedberg RM. A criterion for completeness of degrees of unsolvability. Journal of Symbolic Logic (1957) 22:159–160.[CrossRef]
  5. Jockusch CG. Formula classes and boolean combinations of recursively enumerable sets. Journal of Symbolic Logic (1974) 39:95–96.[CrossRef][Web of Science]
  6. Jockusch CG, Soare R. Degrees of members of Formula classes. Pacific Journal of Mathematics (1972) 40:605–616.[Web of Science]
  7. Jockusch CG, Soare R. Formula classes and degrees of theories. Transactions of the American Mathematical Society (1972) 173:35–56.
  8. Jockusch CG, Shore R. Pseudojump operators I: the r.e. case. Transactions of the American Mathematical Society (1983) 275:599–609.[CrossRef][Web of Science]
  9. Jockusch CG, Shore R. Pseudo-jump operators II: transfinite iterations, hierarchies, and minimal covers. Journal of Symbolic Logic (1984) 49:1205–1236.[CrossRef][Web of Science]
  10. Kreisel G. Analysis of the Cantor-Bendixson theorem by means of the analytic hierarchy. Bulletin de l’Academie Polonaise des Sciences: Serie des Sciences Mathematiques, Astronomie, et Physique (1959) 7:621–626.
  11. Kucera A. Measure Formula classes and complete extensions of PA. In: Recursion Theory Week (Oberwolfach 1984). (1985) 1141. Berlin: Springer-Verlag. 245–259. Lecture Notes in Mathematics.[CrossRef]
  12. Simpson S. Mass problems and randomness. Bulletin of Symbolic Logic (2005) 11:1–27.[CrossRef][Web of Science]
  13. Simpson S. Formula classes and models of WKL0. In: Reverse Mathematics 2001: Lecture Notes in Logic.—Simpson S, ed. (2005) (21). La Jolla: Association for Symbolic Logic. 352–378.

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cenzer, D.
Right arrow Articles by Wu, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?