Bøger i De Gruyter Series in Logic and Its Applications serien

Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to transfinite working time and space. In particular, recognizability, randomness, and applications to other areas of mathematics are covered.

This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. 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 techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory.The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness.

In this volume the author develops and applies methods for proving, from large cardinals, the determinacy of definable games of countable length on natural numbers. The determinacy is ultimately derived from iteration strategies, connecting games on natural numbers with the specific iteration games that come up in the study of large cardinals. The games considered in this text range in strength, from games of fixed countable length, through games where the length is clocked by natural numbers, to games in which a run is complete when its length is uncountable in an inner model (or a pointclass) relative to the run. More can be done using the methods developed here, reaching determinacy for games of certain length. The book is largely self-contained. Only graduate level knowledge of modern techniques in large cardinals and basic forcing is assumed. Several exercises allow the reader to build on the results in the text, for example connecting them with universally Baire and homogeneously Suslin sets. - Important contribution to one of the main features of current set theory, as initiated and developed by Jensen, Woodin, Steel and others.

The series is devoted to the publication of high-level monographs on all areas of mathematical logic and its applications. It is addressed to advanced students and research mathematicians, and may also serve as a guide for lectures and for seminars at the graduate level.

This volume is an introduction to inner model theory, an area of set theory which is concerned with fine structural inner models reflecting large cardinal properties of the set theoretic universe. The monograph contains a detailed presentation of general fine structure theory as well as a modern approach to the construction of small core models, namely those models containing at most one strong cardinal, together with some of their applications. The final part of the book is devoted to a new approach encompassing large inner models which admit many Woodin cardinals. The exposition is self-contained and does not assume any special prerequisities, which should make the text comprehensible not only to specialists but also to advanced students in Mathematical Logic and Set Theory.