|
|
|
|
LEADER |
00000cam a2200000Ii 4500 |
001 |
EBSCO_ocn982124320 |
003 |
OCoLC |
005 |
20231017213018.0 |
006 |
m o d |
007 |
cr mn||||||||| |
008 |
170411t20162016enk ob 001 0 eng d |
040 |
|
|
|a LGG
|b eng
|e rda
|e pn
|c LGG
|d N$T
|d EBLCP
|d N$T
|d YDX
|d UIU
|d OCLCF
|d OSU
|d U3W
|d COO
|d OCLCQ
|d UKAHL
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|
066 |
|
|
|c (S
|
019 |
|
|
|a 982237749
|a 982362171
|a 982424526
|a 982436909
|a 982515742
|a 982538990
|a 982582184
|a 982815444
|a 982853592
|a 983024971
|a 983071176
|
020 |
|
|
|a 9781316754900
|q (electronic bk.)
|
020 |
|
|
|a 1316754901
|q (electronic bk.)
|
020 |
|
|
|a 9781316749111
|q (ebook)
|
020 |
|
|
|a 1316749118
|q (ebook)
|
020 |
|
|
|z 9781107168435
|q (hardcover ;
|q alk. paper)
|
020 |
|
|
|z 1107168430
|q (hardcover ;
|q alk. paper)
|
020 |
|
|
|z 9781316717301
|
020 |
|
|
|z 1316717305
|
029 |
1 |
|
|a AU@
|b 000062882217
|
035 |
|
|
|a (OCoLC)982124320
|z (OCoLC)982237749
|z (OCoLC)982362171
|z (OCoLC)982424526
|z (OCoLC)982436909
|z (OCoLC)982515742
|z (OCoLC)982538990
|z (OCoLC)982582184
|z (OCoLC)982815444
|z (OCoLC)982853592
|z (OCoLC)983024971
|z (OCoLC)983071176
|
050 |
|
4 |
|a QA9.6
|b .S23 2016
|
072 |
|
7 |
|a MAT
|x 000000
|2 bisacsh
|
082 |
0 |
4 |
|a 511.3
|2 23
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a Sacks, Gerald E.,
|e author.
|
245 |
1 |
0 |
|a Higher recursion theory /
|c Gerald E. Sacks, Harvard University.
|
264 |
|
1 |
|a Cambridge ;
|a New York :
|b Cambridge University Press,
|c [2016]
|
264 |
|
4 |
|c ©2016
|
300 |
|
|
|a 1 online resource (xv, 344 pages)
|
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 Perspectives in Logic ;
|v 2
|
520 |
|
|
|a This almost self-contained introduction to higher recursion theory is essential reading for all researchers in the field.
|
504 |
|
|
|a Includes bibliographical references.
|
505 |
0 |
|
|a Constructive ordinals and sets -- The hyperarithmetic hierarchy -- Predicates of reals -- Measure and forcing -- Metarecursive enumerability -- Hyperregularity and priority -- Admissibility and regularity -- Priority arguments -- Splitting, density and beyond -- E-closed structures -- Forcing computations to converge -- Selection and k-sections -- E-recursively enumerable degrees.
|
588 |
0 |
|
|a Print version record.
|
590 |
|
|
|a eBooks on EBSCOhost
|b EBSCO eBook Subscription Academic Collection - Worldwide
|
650 |
|
0 |
|a Recursion theory.
|
650 |
|
6 |
|a Théorie de la récursivité.
|
650 |
|
7 |
|a MATHEMATICS
|x General.
|2 bisacsh
|
650 |
|
7 |
|a Recursion theory
|2 fast
|
776 |
0 |
8 |
|i Print version:
|a SACKS, GERALD E.
|t HIGHER RECURSION THEORY.
|d [S.l.] : CAMBRIDGE UNIV PRESS, 2016
|z 1107168430
|w (OCoLC)959947933
|
830 |
|
0 |
|a Perspectives in logic ;
|v 2.
|
856 |
4 |
0 |
|u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1475809
|z Texto completo
|
880 |
|
|
|6 520-00/(S
|a Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the second publication in the Perspectives in Logic series, is an almost self-contained introduction to higher recursion theory, in which the reader is only assumed to know the basics of classical recursion theory. The book is divided into four parts: hyperarithmetic sets, metarecursion, α-recursion, and E-recursion. This text is essential reading for all researchers in the field.
|
938 |
|
|
|a Askews and Holts Library Services
|b ASKH
|n AH32658277
|
938 |
|
|
|a Askews and Holts Library Services
|b ASKH
|n AH32588641
|
938 |
|
|
|a ProQuest Ebook Central
|b EBLB
|n EBL4812313
|
938 |
|
|
|a EBSCOhost
|b EBSC
|n 1475809
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 14008066
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 13972509
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 14007754
|
994 |
|
|
|a 92
|b IZTAP
|