Skip Navigation


Journal of the London Mathematical Society Advance Access originally published online on October 29, 2009
Journal of the London Mathematical Society 2009 80(3):785-797; doi:10.1112/jlms/jdp049
This Article
Right arrow FREE Full Text (PDF) Freely available
Right arrow All Versions of this Article:
80/3/785    most recent
jdp049v1
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 Kumabe, M.
Right arrow Articles by Lewis, A. E. M.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2009 London Mathematical Society

A fixed-point-free minimal degree

Masahiro Kumabe

University of the Air
2-11 Wakaba, Mihama-ku
Chiba City, 261-8586
Japan
kumabe@u-air.ac.jp

Andrew E. M. Lewis

Department of Pure Mathematics
University of Leeds
Leeds
LS2 9JT
United Kingdom

We show that there exists a Turing degree that is minimal and fixed-point-free.


2000 Mathematics Subject Classification 03D28.

The second author was supported by Marie-Curie Fellowship MEIF-CT-2005-023657 and partially supported by the NSFC Grand International Joint Project no. 60310213, New Directions in the Theory and Applications of Models of Computation.

Received March 26, 2007; revised December 9, 2008; published online October 29, 2009.


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




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.