Recursion theory : computational aspects of definability / Chi Tat Chong, Liang Yu.

By:

Chong, C.-T. (Chi-Tat), 1949- [author.]

Contributor(s):

Yu, Liang (Professor of mathematics) [author.]

Material type: Text

TextSeries: De Gruyter series in logic and its applications ; 8.Publisher: Berlin ; Boston : Walter de Gruyter GmbH & Co., KG, [2015]Copyright date: ©2015Description: 1 online resource (xiii, 306 pages)Content type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783110275643
3110275643
9783110275650
3110275651

Subject(s):

Genre/Form:

Electronic books.

Additional physical formats: Print version:: Recursion theory.DDC classification:

511.3/5 23

LOC classification:

QA9.6 .C46 2015

Online resources:

Click here to access online

Contents:

Part I: Fundamental theory -- Part II: The story of turing degrees -- Part III: Hyperarithmetic degrees and perfect set properly -- Part IV: Higher randomness theory.

Summary: This monograph presents recursion theory from a generalized and largely global point of view. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using ideas and techniques beyond those of classical recursion theory. These include structure theory, hyperarithmetic determinacy and rigidity, basis theorems, independence results on Turing degrees, as well as applications to higher randomness.

Item type:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Home library	Collection	Call number	Materials specified	Status	Date due	Barcode
Electronic-Books	OPJGU Sonepat- Campus	E-Books EBSCO			Available

Includes bibliographical reference (pages 295-301) and index.

Part I: Fundamental theory -- Part II: The story of turing degrees -- Part III: Hyperarithmetic degrees and perfect set properly -- Part IV: Higher randomness theory.

Print version record.

This monograph presents recursion theory from a generalized and largely global point of view. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using ideas and techniques beyond those of classical recursion theory. These include structure theory, hyperarithmetic determinacy and rigidity, basis theorems, independence results on Turing degrees, as well as applications to higher randomness.

In English.

eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - Worldwide

There are no comments on this title.

to post a comment.