|
|
|
|
LEADER |
00000cam a2200000 i 4500 |
001 |
EBOOKCENTRAL_ocn851085997 |
003 |
OCoLC |
005 |
20240329122006.0 |
006 |
m o d |
007 |
cr un||||||||| |
008 |
130627s1975 riua obm 001 0 eng d |
040 |
|
|
|a GZM
|b eng
|e pn
|c GZM
|d OCLCO
|d COO
|d UIU
|d OCLCF
|d LLB
|d E7B
|d EBLCP
|d OCLCQ
|d YDXCP
|d OCLCQ
|d AU@
|d TXI
|d OCLCQ
|d OCLCO
|d OCL
|d K6U
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|
019 |
|
|
|a 884584201
|a 1058373273
|
020 |
|
|
|a 9781470406448
|
020 |
|
|
|a 1470406446
|
020 |
|
|
|z 0821818627
|
020 |
|
|
|z 9780821818626
|
029 |
1 |
|
|a AU@
|b 000056872172
|
035 |
|
|
|a (OCoLC)851085997
|z (OCoLC)884584201
|z (OCoLC)1058373273
|
050 |
|
4 |
|a QA3
|b .A57 no. 162
|a QA248.54
|
082 |
0 |
4 |
|a 510/.8 s
|a 511/.3
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a Epstein, Richard L.,
|d 1947-
|1 https://id.oclc.org/worldcat/entity/E39PCjxFBcdwMRqVHKJFmRPmh3
|
245 |
1 |
0 |
|a Minimal degrees of unsolvability and the full approximation construction /
|c Richard L. Epstein.
|
260 |
|
|
|a Providence :
|b American Mathematical Society,
|c 1975.
|
300 |
|
|
|a 1 online resource (viii, 136 pages) :
|b illustrations, diagrams
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
490 |
1 |
|
|a Memoirs of the American Mathematical Society,
|x 1947-6221 ;
|v v. 162
|
502 |
|
|
|b Ph. D.
|c University of California, Berkeley
|d 1973
|
504 |
|
|
|a Includes bibliographical references (page 131), index, and notes added in proof.
|
505 |
0 |
|
|a A minimal degree -- A minimal degree [script bold]m [less than symbol] 02 -- A minimal degree such that [italic]m2 = 02 -- Minimal degrees and the jump operator -- A minimal degree [script bold]m [less than symbol] [script bold]a r.e. -- A minimal degree such that [script bold]m [set theoretic union symbol] [script bold]a [bold]r.e. = 02
|
520 |
|
|
|a For the purposes of this monograph, "by a degree" is meant a degree of recursive unsolvability. A degree [script bold]m is said to be minimal if 0 is the unique degree less than [script bold]m. Each of the six chapters of this self-contained monograph is devoted to the proof of an existence theorem for minimal degrees
|
588 |
0 |
|
|a Print version record.
|
590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
650 |
|
0 |
|a Unsolvability (Mathematical logic)
|
650 |
|
0 |
|a Recursive functions.
|
650 |
|
0 |
|a Constructive mathematics.
|
650 |
|
6 |
|a Non-résolubilité (Logique mathématique)
|
650 |
|
6 |
|a Fonctions récursives.
|
650 |
|
6 |
|a Mathématiques constructives.
|
650 |
|
7 |
|a Constructive mathematics
|2 fast
|
650 |
|
7 |
|a Recursive functions
|2 fast
|
650 |
|
7 |
|a Unsolvability (Mathematical logic)
|2 fast
|
655 |
|
7 |
|a dissertations.
|2 aat
|
655 |
|
7 |
|a Academic theses
|2 fast
|
655 |
|
7 |
|a Academic theses.
|2 lcgft
|
655 |
|
7 |
|a Thèses et écrits académiques.
|2 rvmgf
|
758 |
|
|
|i has work:
|a Minimal degrees of unsolvability and the full approximation construction (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCGm6wWMdcRvVygQhCDtBT3
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
776 |
0 |
8 |
|i Print version:
|a Epstein, Richard L., 1947-
|t Minimal degrees of unsolvability and the full approximation construction /
|x 0065-9266
|z 9780821818626
|
830 |
|
0 |
|a Memoirs of the American Mathematical Society ;
|v no. 162.
|x 0065-9266
|
856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=3113464
|z Texto completo
|
938 |
|
|
|a ProQuest Ebook Central
|b EBLB
|n EBL3113464
|
938 |
|
|
|a ebrary
|b EBRY
|n ebr10882123
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 12303244
|
994 |
|
|
|a 92
|b IZTAP
|