The role of true finiteness in the admissible recursively enumerable degrees

Bulletin of Symbolic Logic 11 (3):398-410 (2005)
Abstract
We show, however, that this is not always the case.
Keywords Recursion theory  Recursively enumerable sets  Finite, The
Categories (categorize this paper)
Buy the book $25.00 new (59% off)   $60.00 direct from Amazon   $343.87 used    Amazon page
Call number QA9.6.A57 no. 854
ISBN(s) 0821838857     9780821838853
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,351
External links
  •   Try with proxy.
  •   Try with proxy.
  •   Try with proxy.
  •   Try with proxy.
  •   Try with proxy.
  • Through your library Configure
    References found in this work BETA

    No references found.

    Citations of this work BETA

    No citations found.

    Similar books and articles
    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    2 ( #257,981 of 1,088,370 )

    Recent downloads (6 months)

    0

    How can I increase my downloads?

    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.