Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the fifth publication in the Lecture Notes in Logic series, the authors give an insightful introduction to the fascinating subject of the model theory of fields, concentrating on its connections to stability theory. In the first two chapters David Marker gives an overview of the model theory of algebraically closed, real closed and differential fields. In the third chapter Anand Pillay gives a proof that there are 2 non-isomorphic countable differential closed fields. Finally, Margit Messmer gives a survey of the model theory of separably closed fields of characteristic p > 0.

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the first publication in the Lecture Notes in Logic series, Shoenfield gives a clear and focused introduction to recursion theory. The fundamental concept of recursion makes the idea of computability accessible to a mathematical analysis, thus forming one of the pillars on which modern computer science rests. This introduction is an ideal instrument for teaching and self-study that prepares the reader for the study of advanced monographs and the current literature on recursion theory.

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the tenth publication in the Perspectives in Logic series, Jens E. Fenstad takes an axiomatic approach to present a unified and coherent account of the many and various parts of general recursion theory. The main core of the book gives an account of the general theory of computations. The author then moves on to show how computation theories connect with and unify other parts of general recursion theory. Some mathematical maturity is required of the reader, who is assumed to have some acquaintance with recursion theory. This book is ideal for a second course in the subject.

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. The theory set out in this volume, the ninth publication in the Perspectives in Logic series, is the result of the meeting and common development of two currents of mathematical research: descriptive set theory and recursion theory. Both are concerned with notions of definability and with the classification of mathematical objects according to their complexity. These are the common themes which run through the topics discussed here. The author develops a general theory from which the results of both areas can be derived, making these common threads clear.

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the eighth publication in the Perspectives in Logic series, brings together several directions of work in model theory between the late 1950s and early 1980s. It contains expository papers by pre-eminent researchers. Part I provides an introduction to the subject as a whole, as well as to the basic theory and examples. The rest of the book addresses finitary languages with additional quantifiers, infinitary languages, second-order logic, logics of topology and analysis, and advanced topics in abstract model theory. Many chapters can be read independently.

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. Admissible set theory is a major source of interaction between model theory, recursion theory and set theory, and plays an important role in definability theory. In this volume, the seventh publication in the Perspectives in Logic series, Jon Barwise presents the basic facts about admissible sets and admissible ordinals in a way that makes them accessible to logic students and specialists alike. It fills the artificial gap between model theory and recursion theory and covers everything the logician should know about admissible sets.

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the third publication in the Perspectives in Logic series, is a much-needed monograph on the metamathematics of first-order arithmetic. The authors pay particular attention to subsystems (fragments) of Peano arithmetic and give the reader a deeper understanding of the role of the axiom schema of induction and of the phenomenon of incompleteness. The reader is only assumed to know the basics of mathematical logic, which are reviewed in the preliminaries. Part I develops parts of mathematics and logic in various fragments. Part II is devoted to incompleteness. Finally, Part III studies systems that have the induction schema restricted to bounded formulas (bounded arithmetic).

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the second publication in the Perspectives in Logic series, is an almost self-contained introduction to higher recursion theory, in which the reader is only assumed to know the basics of classical recursion theory. The book is divided into four parts: hyperarithmetic sets, metarecursion, -recursion, and E-recursion. This text is essential reading for all researchers in the field.

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the first publication in the Perspectives in Logic series, Pour-El and Richards present the first graduate-level treatment of computable analysis within the tradition of classical mathematical reasoning. The book focuses on the computability or noncomputability of standard processes in analysis and physics. Topics include classical analysis, Hilbert and Banach spaces, bounded and unbounded linear operators, eigenvalues, eigenvectors, and equations of mathematical physics. The work is self-contained, and although it is intended primarily for logicians and analysts, it should also be of interest to researchers and graduate students in physics and computer science.

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the third publication in the Lecture Notes in Logic series, Mitchell and Steel construct an inner model with a Woodin cardinal and develop its fine structure theory. This work builds upon the existing theory of a model of the form L[E], where E is a coherent sequence of extenders, and relies upon the fine structure theory of L[E] models with strong cardinals, and the theory of iteration trees and 'backgrounded' L[E] models with Woodin cardinals. This work is what results when fine structure meets iteration trees.

Fascinating connections exist between group theory and automata theory, and a wide variety of them are discussed in this text. Automata can be used in group theory to encode complexity, to represent aspects of underlying geometry on a space on which a group acts, and to provide efficient algorithms for practical computation. There are also many applications in geometric group theory. The authors provide background material in each of these related areas, as well as exploring the connections along a number of strands that lead to the forefront of current research in geometric group theory. Examples studied in detail include hyperbolic groups, Euclidean groups, braid groups, Coxeter groups, Artin groups, and automata groups such as the Grigorchuk group. This book will be a convenient reference point for established mathematicians who need to understand background material for applications, and can serve as a textbook for research students in (geometric) group theory.

Fascinating connections exist between group theory and automata theory, and a wide variety of them are discussed in this text. Automata can be used in group theory to encode complexity, to represent aspects of underlying geometry on a space on which a group acts, and to provide efficient algorithms for practical computation. There are also many applications in geometric group theory. The authors provide background material in each of these related areas, as well as exploring the connections along a number of strands that lead to the forefront of current research in geometric group theory. Examples studied in detail include hyperbolic groups, Euclidean groups, braid groups, Coxeter groups, Artin groups, and automata groups such as the Grigorchuk group. This book will be a convenient reference point for established mathematicians who need to understand background material for applications, and can serve as a textbook for research students in (geometric) group theory.

The logician Kurt Goedel (1906-1978) published a paper in 1931 formulating what have come to be known as his 'incompleteness theorems', which prove, among other things, that within any formal system with resources sufficient to code arithmetic, questions exist which are neither provable nor disprovable on the basis of the axioms which define the system. These are among the most celebrated results in logic today. In this volume, leading philosophers and mathematicians assess important aspects of Goedel's work on the foundations and philosophy of mathematics. Their essays explore almost every aspect of Godel's intellectual legacy including his concepts of intuition and analyticity, the Completeness Theorem, the set-theoretic multiverse, and the state of mathematical logic today. This groundbreaking volume will be invaluable to students, historians, logicians and philosophers of mathematics who wish to understand the current thinking on these issues.

The present book is an introduction to the philosophy of mathematics. It asks philosophical questions concerning fundamental concepts, constructions and methods - this is done from the standpoint of mathematical research and teaching. It looks for answers both in mathematics and in the philosophy of mathematics from their beginnings till today. The reference point of the considerations is the introducing of the reals in the 19th century that marked an epochal turn in the foundations of mathematics. In the book problems connected with the concept of a number, with the infinity, the continuum and the infinitely small, with the applicability of mathematics as well as with sets, logic, provability and truth and with the axiomatic approach to mathematics are considered. In Chapter 6 the meaning of infinitesimals to mathematics and to the elements of analysis is presented. The authors of the present book are mathematicians. Their aim is to introduce mathematicians and teachers of mathematics as well as students into the philosophy of mathematics. The book is suitable also for professional philosophers as well as for students of philosophy, just because it approaches philosophy from the side of mathematics. The knowledge of mathematics needed to understand the text is elementary. Reports on historical conceptions. Thinking about today's mathematical doing and thinking. Recent developments. Based on the third, revised German edition. For mathematicians - students, teachers, researchers and lecturers - and readersinterested in mathematics and philosophy. Contents On the way to the reals On the history of the philosophy of mathematics On fundamental questions of the philosophy of mathematics Sets and set theories Axiomatic approach and logic Thinking and calculating infinitesimally - First nonstandard steps Retrospection

The area of coalgebra has emerged within theoretical computer science with a unifying claim: to be the mathematics of computational dynamics. It combines ideas from the theory of dynamical systems and from the theory of state-based computation. Although still in its infancy, it is an active area of research that generates wide interest. Written by one of the founders of the field, this book acts as the first mature and accessible introduction to coalgebra. It provides clear mathematical explanations, with many examples and exercises involving deterministic and non-deterministic automata, transition systems, streams, Markov chains and weighted automata. The theory is expressed in the language of category theory, which provides the right abstraction to make the similarity and duality between algebra and coalgebra explicit, and which the reader is introduced to in a hands-on manner. The book will be useful to mathematicians and (theoretical) computer scientists and will also be of interest to mathematical physicists, biologists and economists.

Infinitary logic, the logic of languages with infinitely long conjunctions, plays an important role in model theory, recursion theory and descriptive set theory. This book is the first modern introduction to the subject in forty years, and will bring students and researchers in all areas of mathematical logic up to the threshold of modern research. The classical topics of back-and-forth systems, model existence techniques, indiscernibles and end extensions are covered before more modern topics are surveyed. Zilber's categoricity theorem for quasiminimal excellent classes is proved and an application is given to covers of multiplicative groups. Infinitary methods are also used to study uncountable models of counterexamples to Vaught's conjecture, and effective aspects of infinitary model theory are reviewed, including an introduction to Montalban's recent work on spectra of Vaught counterexamples. Self-contained introductions to effective descriptive set theory and hyperarithmetic theory are provided, as is an appendix on admissible model theory.

Providing a timely description of the present state of the art of moduli spaces of curves and their geometry, this volume is written in a way which will make it extremely useful both for young people who want to approach this important field, and also for established researchers, who will find references, problems, original expositions, new viewpoints, etc. The book collects the lecture notes of a number of leading algebraic geometers and in particular specialists in the field of moduli spaces of curves and their geometry. This is an important subject in algebraic geometry and complex analysis which has seen spectacular developments in recent decades, with important applications to other parts of mathematics such as birational geometry and enumerative geometry, and to other sciences, including physics. The themes treated are classical but with a constant look to modern developments (see Cascini, Debarre, Farkas, and Sernesi's contributions), and include very new material, such as Bridgeland stability (see Macri's lecture notes) and tropical geometry (see Chan's lecture notes).

Originally published in 1948, this book was written to provide students with an accessible guide to various elements of mathematics. The text was created for individual working rather than group learning situations. Numerous exercises are included. This book will be of value to anyone with an interest in mathematics and the history of education.

The Banach-Tarski Paradox is a most striking mathematical construction: it asserts that a solid ball can be taken apart into finitely many pieces that can be rearranged using rigid motions to form a ball twice as large. This volume explores the consequences of the paradox for measure theory and its connections with group theory, geometry, set theory, and logic. This new edition of a classic book unifies contemporary research on the paradox. It has been updated with many new proofs and results, and discussions of the many problems that remain unsolved. Among the new results presented are several unusual paradoxes in the hyperbolic plane, one of which involves the shapes of Escher's famous 'Angel and Devils' woodcut. A new chapter is devoted to a complete proof of the remarkable result that the circle can be squared using set theory, a problem that had been open for over sixty years.

Michael Holzhauser discusses generalizations of well-known network flow and packing problems by additional or modified side constraints. By exploiting the inherent connection between the two problem classes, the author investigates the complexity and approximability of several novel network flow and packing problems and presents combinatorial solution and approximation algorithms.

Fourier analysis aims to decompose functions into a superposition of simple trigonometric functions, whose special features can be exploited to isolate specific components into manageable clusters before reassembling the pieces. This two-volume text presents a largely self-contained treatment, comprising not just the major theoretical aspects (Part I) but also exploring links to other areas of mathematics and applications to science and technology (Part II). Following the historical and conceptual genesis, this book (Part I) provides overviews of basic measure theory and functional analysis, with added insight into complex analysis and the theory of distributions. The material is intended for both beginning and advanced graduate students with a thorough knowledge of advanced calculus and linear algebra. Historical notes are provided and topics are illustrated at every stage by examples and exercises, with separate hints and solutions, thus making the exposition useful both as a course textbook and for individual study.

It is a fact of modern scientific thought that there is an enormous variety of logical systems - such as classical logic, intuitionist logic, temporal logic, and Hoare logic, to name but a few - which have originated in the areas of mathematical logic and computer science. In this book the author presents a systematic study of this rich harvest of logics via Tarski's well-known axiomatization of the notion of logical consequence. New and sometimes unorthodox treatments are given of the underlying principles and construction of many-valued logics, the logic of inexactness, effective logics, and modal logics. Throughout, numerous historical and philosophical remarks illuminate both the development of the subject and show the motivating influences behind its development. Those with a modest acquaintance of modern formal logic will find this to be a readable and not too technical account which will demonstrate the current diversity and profusion of logics. In particular, undergraduate and postgraduate students in mathematics, philosophy, computer science, and artificial intelligence will enjoy this introductory survey of the field.

Prime numbers are beautiful, mysterious, and beguiling mathematical objects. The mathematician Bernhard Riemann made a celebrated conjecture about primes in 1859, the so-called Riemann hypothesis, which remains one of the most important unsolved problems in mathematics. Through the deep insights of the authors, this book introduces primes and explains the Riemann hypothesis. Students with a minimal mathematical background and scholars alike will enjoy this comprehensive discussion of primes. The first part of the book will inspire the curiosity of a general reader with an accessible explanation of the key ideas. The exposition of these ideas is generously illuminated by computational graphics that exhibit the key concepts and phenomena in enticing detail. Readers with more mathematical experience will then go deeper into the structure of primes and see how the Riemann hypothesis relates to Fourier analysis using the vocabulary of spectra. Readers with a strong mathematical background will be able to connect these ideas to historical formulations of the Riemann hypothesis.

This book gives a detailed treatment of functional interpretations of arithmetic, analysis, and set theory. The subject goes back to Goedel's Dialectica interpretation of Heyting arithmetic which replaces nested quantification by higher type operations and thus reduces the consistency problem for arithmetic to the problem of computability of primitive recursive functionals of finite types. Regular functional interpretations, in particular the Dialectica interpretation and its generalization to finite types, the Diller-Nahm interpretation, are studied on Heyting as well as Peano arithmetic in finite types and extended to functional interpretations of constructive as well as classical systems of analysis and set theory. Kreisel's modified realization and Troelstra's hybrids of it are presented as interpretations of Heyting arithmetic and extended to constructive set theory, both in finite types. They serve as background for the construction of hybrids of the Diller-Nahm interpretation of Heyting arithmetic and constructive set theory, again in finite types. All these functional interpretations yield relative consistency results and closure under relevant rules of the theories in question as well as axiomatic characterizations of the functional translations.