Higher Recursion Theory (Perspectives in Mathematical Logic)

von Gerald E. Sacks Kategorie: Computabilität & Rekursionstheorie ISBN: 3540193057 Kommentar abgeben

From Book News, Inc. An advanced mathematics study assuming in the reader no course in Godel's L, and no previous acquaintance with forcing; the more background in classical recursive theory, the better, but almost none might be enough. The sections cover hyperarithmetic sets, metarecursion, alpha-recursion, and E-recursion. Some individual chapters discuss the hyperarithmetic hierarchy, hyperregularity and priority, admissibility and regularity, and forcing computations to converge. Annotation copyright Book News, Inc. Portland, Or.

Kurzbeschreibung Hyperarithmetic theory is the first step beyond classical recursion theory. It is the primary source of ideas and examples in higher recursion theory. It is also a crossroad for several areas of mathematical logic: in set theory it is an initial segment of Godel's L; in model theory, the least admissible set after ; in descriptive set theory, the setting for effective arguments. In this book, hyperarithmetic theory is developed at length and used to lift classical recursion theory from integers...

Synopsis Hyperarithmetic theory is the first step beyond classical recursion theory. It is the primary source of ideas and examples in higher recursion theory. It is also a crossroad for several areas of mathematical logic: in set theory it is an initial segment of Godel's L; in model theory, the least admissible set after ; in descriptive set theory, the setting for effective arguments. In this book, hyperarithmetic theory is developed at length and used to lift classical recursion theory from integers...