De Gruyter Series in Logic & its Applications – serie

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.

No detailed description available for "Recursion Theory and Complexity".

No detailed description available for "Fine Structure and Class Forcing".

The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra.Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to algorithmics (randomized alogrithms), parametric complexity, Kolmogorov complexity of finite strings, computational group theory, counting problems, and canonical models of ZFC providing a solution to continuum hypothesis.The text addresses students in computer science or mathematics, and professionals in these areas who seek a complete, but gentle introduction to a wide range of techniques, concepts, and research horizons in the area of computational complexity in a broad sense.

The papers collected in this volume represent the main body of research arising from the International Munich Centenary Conference in 2001, which commemorated the discovery of the famous Russell Paradox a hundred years ago. The 31 contributions and the introductory essay by the editor were (with two exceptions) all originally written for the volume.The volume serves a twofold purpose, historical and systematic. One focus is on Bertrand Russell's logic and logical philosophy, taking into account the rich sources of the Russell Archives, many of which have become available only recently. The second equally important aim is to present original research in the broad range of foundational studies that draws on both current conceptions and recent technical advances in the above-mentioned fields. The volume contributes therefore, to the well-established body of mathematical philosophy initiated to a large extent by Russell's work.

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 starting point for this monograph is the previously unknown connection between the Continuum Hypothesis and the saturation of the non-stationary ideal on ω1; and the principle result of this monograph is the identification of a canonical model in which the Continuum Hypothesis is false. This is the first example of such a model and moreover the model can be characterized in terms of maximality principles concerning the universal-existential theory of all sets of countable ordinals. This model is arguably the long sought goal of the study of forcing axioms and iterated forcing but is obtained by completely different methods, for example no theory of iterated forcing whatsoever is required. The construction of the model reveals a powerful technique for obtaining independence results regarding the combinatorics of the continuum, yielding a number of results which have yet to be obtained by any other method. This monograph is directed to researchers and advanced graduate students in Set Theory. The second edition is updated to take into account some of the developments in the decade since the first edition appeared, this includes a revised discussion of Ω-logic and related matters.

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.

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.

The book is about strong axioms of infi nity in set theory (also known as large cardinal axioms), and the ongoing search for natural models of these axioms. Assuming the Ultrapower Axiom, a combinatorial principle conjectured to hold in all such natural models, we solve various classical problems in set theory (for example, the Generalized Continuum Hypothesis) and uncover a theory of large cardinals that is much clearer than the one that can be developed using only the standard axioms.

Continuous model theory is an extension of classical first order logic which is best suited for classes of structures which are endowed with a metric. Applications have grown considerably in the past decade. This book is dedicated to showing how the techniques of continuous model theory are used to study C*-algebras and von Neumann algebras. This book geared to researchers in both logic and functional analysis provides the first self-contained collection of articles surveying the many applications of continuous logic to operator algebras that have been obtained in the last 15 years.