You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Numbers imitate space, which is of such a di?erent nature —Blaise Pascal It is fair to date the study of the foundation of mathematics back to the ancient Greeks. The urge to understand and systematize the mathematics of the time led Euclid to postulate axioms in an early attempt to put geometry on a ?rm footing. With roots in the Elements, the distinctive methodology of mathematics has become proof. Inevitably two questions arise: What are proofs? and What assumptions are proofs based on? The ?rst question, traditionally an internal question of the ?eld of logic, was also wrestled with in antiquity. Aristotle gave his famous syllogistic s- tems, and the Stoics had a nascent propositional ...
This book presents the theory of proper forcing and its relatives from the beginning. No prior knowledge of forcing is required.
The main body of this book consists of 106 numbered theorems and a dozen of examples of models of set theory. A large number of additional results is given in the exercises, which are scattered throughout the text. Most exer cises are provided with an outline of proof in square brackets [ ], and the more difficult ones are indicated by an asterisk. I am greatly indebted to all those mathematicians, too numerous to men tion by name, who in their letters, preprints, handwritten notes, lectures, seminars, and many conversations over the past decade shared with me their insight into this exciting subject. XI CONTENTS Preface xi PART I SETS Chapter 1 AXIOMATIC SET THEORY I. Axioms of Set Theory I...
The notion of complexity is an important contribution of logic to theoretical computer science and mathematics. This volume attempts to approach complexity in a holistic way, investigating mathematical properties of complexity hierarchies at the same time as discussing algorithms and computational properties. A main focus of the volume is on some of the new paradigms of computation, among them Quantum Computing and Infinitary Computation. The papers in the volume are tied together by an introductory article describing abstract properties of complexity hierarchies. This volume will be of great interest to both mathematical logicians and theoretical computer scientists, providing them with new insights into the various views of complexity and thus shedding new light on their own research.
None