Skip to content
Rider Library Catalog
You are not logged in
|
Login
Your session will expire automatically in
0
seconds.
Continue session
End session now
Add to My Lists
Export
MARC Display
Return To Browse
SearchType
Keyword
Author
Title
Journal Title
Series Title
Subject
Genre
Call no.
ISBN / ISSN
Table of Contents
Publisher
Prof/TA
Course
Search
Search Scope
View Entire Collection
Moore Library
Talbott Library
Limit search to available items
Record:  
Prev
Next
Resources
More Information
Bestseller
Author
Sacks, Gerald E., author.
Title
Higher recursion theory / Gerald E. Sacks, Harvard University.
Publication Info.
Cambridge ; New York : Cambridge University Press, [2016]
©2016
Online access
Online ebook via EBSCO. Access restricted to current Rider University students, faculty, and staff.
Instructions for reading/downloading the EBSCO version of this ebook
Item Status
Description
1 online resource (xv, 344 pages).
Physical Medium
polychrome
Description
text file
Series
Perspectives in Logic ; 2
Perspectives in logic ; 2.
Summary
This almost self-contained introduction to higher recursion theory is essential reading for all researchers in the field.
Bibliography
Includes bibliographical references.
Contents
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.
Local Note
eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - North America
Subject
Recursion theory.
Recursion theory.
MATHEMATICS -- General.
Genre/Form
Electronic books.
Other Form:
Print version: SACKS, GERALD E. HIGHER RECURSION THEORY. [S.l.] : CAMBRIDGE UNIV PRESS, 2016 1107168430 (OCoLC)959947933
ISBN
9781316754900 (electronic book)
1316754901 (electronic book)
9781316749111 (ebook)
1316749118 (ebook)
9781107168435 (hardcover ; alkaline paper)
1107168430 (hardcover ; alkaline paper)
9781316717301
1316717305