Studies in Logic and the Foundations of Mathematics Series

Foundations of Set Theory discusses the reconstruction undergone by set theory in the hands of Brouwer, Russell, and Zermelo. Only in the axiomatic foundations, however, have there been such extensive, almost revolutionary, developments. This book tries to avoid a detailed discussion of those topics which would have required heavy technical machinery, while describing the major results obtained in their treatment if these results could be stated in relatively non-technical terms. This book comprises five chapters and begins with a discussion of the antinomies that led to the reconstruction of set theory as it was known before. It then moves to the axiomatic foundations of set theory, including a discussion of the basic notions of equality and extensionality and axioms of comprehension and infinity. The next chapters discuss type-theoretical approaches, including the ideal calculus, the theory of types, and Quine's mathematical logic and new foundations; intuitionistic conceptions of mathematics and its constructive character; and metamathematical and semantical approaches, such as the Hilbert program. This book will be of interest to mathematicians, logicians, and statisticians.

Problems in the Philosophy of Mathematics

Since the second edition of this book (1977), Model Theory has changed radically, and is now concerned with fields such as classification (or stability) theory, nonstandard analysis, model-theoretic algebra, recursive model theory, abstract model theory, and model theories for a host of nonfirst order logics. Model theoretic methods have also had a major impact on set theory, recursion theory, and proof theory. This new edition has been updated to take account of these changes, while preserving its usefulness as a first textbook in model theory. Whole new sections have been added, as well as new exercises and references. A number of updates, improvements and corrections have been made to the main text.

Recursive Model Theory

The first of its kind, this book presents a widely accessible exposition of topos theory, aimed at the philosopher-logician as well as the mathematician. It is suitable for individual study or use in class at the graduate level (it includes 500 exercises). It begins with a fully motivated introduction to category theory itself, moving always from the particular example to the abstract concept. It then introduces the notion of elementary topos, with a wide range of examples and goes on to develop its theory in depth, and to elicit in detail its relationship to Kripke's intuitionistic semantics, models of classical set theory and the conceptual framework of sheaf theory (``localization'' of truth). Of particular interest is a Dedekind-cuts style construction of number systems in topoi, leading to a model of the intuitionistic continuum in which a ``Dedekind-real'' becomes represented as a ``continuously-variable classical real number''. The second edition contains a new chapter, entitled Logical Geometry, which introduces the reader to the theory of geometric morphisms of Grothendieck topoi, and its model-theoretic rendering by Makkai and Reyes. The aim of this chapter is to explain why Deligne's theorem about the existence of points of coherent topoi is equivalent to the classical Completeness theorem for ``geometric'' first-order formulae.

This work presents the most important combinatorial ideas in partition calculus and discusses ordinary partition relations for cardinals without the assumption of the generalized continuum hypothesis. A separate section of the book describes the main partition symbols scattered in the literature. A chapter on the applications of the combinatorial methods in partition calculus includes a section on topology with Arhangel'skii's famous result that a first countable compact Hausdorff space has cardinality, at most continuum. Several sections on set mappings are included as well as an account of recent inequalities for cardinal powers that were obtained in the wake of Silver's breakthrough result saying that the continuum hypothesis can not first fail at a singular cardinal of uncountable cofinality.

Now available in paperback, this monograph is a self-contained exposition of the main results and methods of descriptive set theory. It develops all the necessary background material from logic and recursion theory, and treats both classical descriptive set theory and the effective theory developed by logicians.

The handbook is divided into four parts: model theory, set theory, recursion theory and proof theory. Each of the four parts begins with a short guide to the chapters that follow. Each chapter is written for non-specialists in the field in question. Mathematicians will find that this book provides them with a unique opportunity to apprise themselves of developments in areas other than their own.

This monograph contains a selection of over 250 propositions which are equivalent to AC. The first part on set forms has sections on the well-ordering theorem, variants of AC, the law of the trichotomy, maximal principles, statements related to the axiom of foundation, forms from algebra, cardinal number theory, and a final section of forms from topology, analysis and logic. The second part deals with the axiom of choice for classes - well-ordering theorem, choice and maximal principles.

Since the publication of the first edition in 1976, there has been a notable increase of interest in the development of logic. This is evidenced by the several conferences on the history of logic, by a journal devoted to the subject, and by an accumulation of new results. This increased activity and the new results - the chief one being that Boole's work in probability is best viewed as a probability logic - were influential circumstances conducive to a new edition. Chapter 1, presenting Boole's ideas on a mathematical treatment of logic, from their emergence in his early 1847 work on through to his immediate successors, has been considerably enlarged. Chapter 2 includes additional discussion of the ``uninterpretable'' notion, both semantically and syntactically. Chapter 3 now includes a revival of Boole's abandoned propositional logic and, also, a discussion of his hitherto unnoticed brush with ancient formal logic. Chapter 5 has an improved explanation of why Boole's probability method works. Chapter 6, Applications and Probability Logic, is a new addition. Changes from the first edition have brought about a three-fold increase in the bibliography.

The revised edition contains a new chapter which provides an elegant description of the semantics. The various classes of lambda calculus models are described in a uniform manner. Some didactical improvements have been made to this edition. An example of a simple model is given and then the general theory (of categorical models) is developed. Indications are given of those parts of the book which can be used to form a coherent course.

Studies in Logic and the Foundations of Mathematics, Volume 102: Set Theory: An Introduction to Independence Proofs offers an introduction to relative consistency proofs in axiomatic set theory, including combinatorics, sets, trees, and forcing. The book first tackles the foundations of set theory and infinitary combinatorics. Discussions focus on the Suslin problem, Martin's axiom, almost disjoint and quasi-disjoint sets, trees, extensionality and comprehension, relations, functions, and well-ordering, ordinals, cardinals, and real numbers. The manuscript then ponders on well-founded sets and easy consistency proofs, including relativization, absoluteness, reflection theorems, properties of well-founded sets, and induction and recursion on well-founded relations. The publication examines constructible sets, forcing, and iterated forcing. Topics include Easton forcing, general iterated forcing, Cohen model, forcing with partial functions of larger cardinality, forcing with finite partial functions, and general extensions. The manuscript is a dependable source of information for mathematicians and researchers interested in set theory.

``Platonism and intuitionism are rival philosophies of Mathematics, the former holding that the subject matter of mathematics consists of abstract objects whose existence is independent of the mathematician, the latter that the subject matter consists of mental construction... both views are implicitly opposed to materialistic accounts of mathematics which take the subject matter of mathematics to consist (in a direct way) of material objects...'' FROM THE INTRODUCTION Among the aims of this book are: - The discussion of some important philosophical issues using the precision of mathematics. - The development of formal systems that contain both classical and constructive components. This allows the study of constructivity in otherwise classical contexts and represents the formalization of important intensional aspects of mathematical practice. - The direct formalization of intensional concepts (such as computability) in a mixed constructive/classical context.

1988 marked the first centenary of Recursion Theory, since Dedekind's 1888 paper on the nature of number. Now available in paperback, this book is both a comprehensive reference for the subject and a textbook starting from first principles. Among the subjects covered are: various equivalent approaches to effective computability and their relations with computers and programming languages; a discussion of Church's thesis; a modern solution to Post's problem; global properties of Turing degrees; and a complete algebraic characterization of many-one degrees. Included are a number of applications to logic (in particular Gödel's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation.

The result of the European Summer Meeting of the Association for Symbolic Logic, this volume gives an overview of the latest developments in most of the major fields of logic being actively pursued today. Important new developments in the applications of logic in computer science are presented. Other areas examined include model theory, set theory, recursion theory, proof theory, and the history of logic. This volume contains the texts of ten of the invited lectures and six of the contributed papers.

The bulk of this volume consists of invited addresses presented at the Colloquium. These contributions report on recent or ongoing research in some of the mainstream areas of mathematical logic: model theory, both pure and in its applications (to group theory and real algebraic geometry); and proof theory, applied to set theory and diophantine equations. The major novel aspect of the book is the important place accorded to the connections of mathematical logic with the neighboring disciplines: mathematical foundations of computer science, and philosophy of mathematics.

The aim of this book is to present the fundamental theoretical results concerning inference rules in deductive formal systems. Primary attention is focused on: • admissible or permissible inference rules • the derivability of the admissible inference rules • the structural completeness of logics • the bases for admissible and valid inference rules. There is particular emphasis on propositional non-standard logics (primary, superintuitionistic and modal logics) but general logical consequence relations and classical first-order theories are also considered. The book is basically self-contained and special attention has been made to present the material in a convenient manner for the reader. Proofs of results, many of which are not readily available elsewhere, are also included. The book is written at a level appropriate for first-year graduate students in mathematics or computer science. Although some knowledge of elementary logic and universal algebra are necessary, the first chapter includes all the results from universal algebra and logic that the reader needs. For graduate students in mathematics and computer science the book is an excellent textbook.

This volume discusses various aspects of Harvey Friedman's research in the foundations of mathematics over the past fifteen years. It should appeal to a wide audience of mathematicians, computer scientists, and mathematically oriented philosophers.

Fourteen papers presented at the 1987 European Summer Meeting of the Association for Symbolic Logic are collected in this volume. The main areas covered by the conference were Logic, Set Theory, Recursion Theory, Model Theory, Logic for Computer Science and Semantics of Natural Languages.

The result of the European Summer Meeting of the Association for Symbolic Logic, this volume gives an overview of the latest developments in most of the major fields of logic being actively pursued today. As well as selected papers, the two panel discussions are also included, on ``Trends in Logic'' and ``The Teaching of Logic''.

Logic, Methodology and Philosophy of Science VIII presents the results of recent research into the foundations of science. The volume contains 37 invited papers presented at the Congress, covering the areas of Logic, Mathematics, Physical Sciences, Biological Sciences and the Humanities.

This English translation of the author's original work has been thoroughly revised, expanded and updated. The book covers logical systems known as type-free or self-referential. These traditionally arise from any discussion on logical and semantical paradoxes. This particular volume, however, is not concerned with paradoxes but with the investigation of type-free sytems to show that: (i) there are rich theories of self-application, involving both operations and truth which can serve as foundations for property theory and formal semantics; (ii) these theories provide a new outlook on classical topics, such as inductive definitions and predicative mathematics; (iii) they are particularly promising with regard to applications. Research arising from paradoxes has moved progressively closer to the mainstream of mathematical logic and has become much more prominent in the last twenty years. A number of significant developments, techniques and results have been discovered. Academics, students and researchers will find that the book contains a thorough overview of all relevant research in this field.

This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There are many interesting results already, but there are also many natural questions still to be answered. The book is self-contained in that it includes necessary background material from recursion theory (ordinal notations, the hyperarithmetical hierarchy) and model theory (infinitary formulas, consistency properties).

The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems. The book is a unified introduction to the modern theory of these concepts, to the way in which they developed first in mathematical logic and computability theory and later in automata theory, and to the theory of formal languages and complexity theory. Apart from considering the fundamental themes and classical aspects of these areas, the subject matter has been selected to give priority throughout to the new aspects of traditional questions, results and methods which have developed from the needs or knowledge of computer science and particularly of complexity theory. It is both a textbook for introductory courses in the above-mentioned disciplines as well as a monograph in which further results of new research are systematically presented and where an attempt is made to make explicit the connections and analogies between a variety of concepts and constructions.

This work is a self-contained elementary exposition of the theory of recursive functionals, that also includes a number of advanced results. Although aiming basically at a theory of higher order computability, attention is restricted to second order functionals, where the arguments are numerical functions and the values, when defined, are natural numbers. This theory is somewhat special, for to some extent it can be reduced to first order theory, but when properly extended and relativized it requires the full machinery of higher order computations. In the theory of recursive monotonic functionals the author formulates a reasonable notion of computation which provides the right frame for what appears to be a convincing form of the extended Church's thesis. At the same time, the theory provides sufficient room to formulate the classical results that are usually derived in terms of singular functionals. Presented are complete proofs of Gandy's selector theorem, Kleene's theorem on hyperarithmetical predicates, and Grilliot's theorem on effectively discontinuous functionals.

Gaps and limits are two phenomena occuring in the Boolean algebra P()/fin. Both were discovered by F. Hausdorff in the mid 1930's. This book aims to show how they can be used in solving several kinds of mathematical problems and to convince the reader that they are of interest in themselves. The forcing technique, which is not commonly known, is used widely in the text. A short explanation of the forcing method is given in Chapter 11. Exercises, both easy and more difficult, are given throughout the book.

This monograph began life as a series of papers documenting five years of research into the logical foundations of Categorial Grammar, a grammatical paradigm which has close analogies with Lambda Calculus and Type Theory. The technical theory presented here stems from the interface between Logic and Linguistics and, in particular, the theory of generalized quantification. A categorical framework with lambda calculus-oriented semantics is a convenient vehicle for generalizing semantic insights (obtained in various corners of natural language) into one coherent theory. The book aims to demonstrate to fellow logicians that the resulting applied lambda calculus has intrinsic logical interest. In the final analysis, the idea is not just to `break the syntactic code' of natural languages but to understand the cognitive functioning of the human mind.

This volume is the product of the Proceedings of the 9th International Congress of Logic, Methodology and Philosophy of Science and contains the text of most of the invited lectures. Divided into 15 sections, the book covers a wide range of different issues. The reader is given the opportunity to learn about the latest thinking in relevant areas other than those in which they themselves may normally specialise.

The Curry-Howard isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as found in type theory. For instance, minimal propositional logic corresponds to simply typed lambda-calculus, first-order logic corresponds to dependent types, second-order logic corresponds to polymorphic types, sequent calculus is related to explicit substitution, etc. The isomorphism has many aspects, even at the syntactic level: formulas correspond to types, proofs correspond to terms, provability corresponds to inhabitation, proof normalization corresponds to term reduction, etc. But there is more to the isomorphism than this. For instance, it is an old idea---due to Brouwer, Kolmogorov, and Heyting---that a constructive proof of an implication is a procedure that transforms proofs of the antecedent into proofs of the succedent; the Curry-Howard isomorphism gives syntactic representations of such procedures. The Curry-Howard isomorphism also provides theoretical foundations for many modern proof-assistant systems (e.g. Coq). This book give an introduction to parts of proof theory and related aspects of type theory relevant for the Curry-Howard isomorphism. It can serve as an introduction to any or both of typed lambda-calculus and intuitionistic logic. Key features - The Curry-Howard Isomorphism treated as common theme - Reader-friendly introduction to two complementary subjects: Lambda-calculus and constructive logics - Thorough study of the connection between calculi and logics - Elaborate study of classical logics and control operators - Account of dialogue games for classical and intuitionistic logic - Theoretical foundations of computer-assisted reasoning · The Curry-Howard Isomorphism treated as the common theme. · Reader-friendly introduction to two complementary subjects: lambda-calculus and constructive logics · Thorough study of the connection between calculi and logics. · Elaborate study of classical logics and control operators. · Account of dialogue games for classical and intuitionistic logic. · Theoretical foundations of computer-assisted reasoning

This book presents what in our opinion constitutes the basis of the theory of the mu-calculus, considered as an algebraic system rather than a logic. We have wished to present the subject in a unified way, and in a form as general as possible. Therefore, our emphasis is on the generality of the fixed-point notation, and on the connections between mu-calculus, games, and automata, which we also explain in an algebraic way. This book should be accessible for graduate or advanced undergraduate students both in mathematics and computer science. We have designed this book especially for researchers and students interested in logic in computer science, comuter aided verification, and general aspects of automata theory. We have aimed at gathering in a single place the fundamental results of the theory, that are currently very scattered in the literature, and often hardly accessible for interested readers. The presentation is self-contained, except for the proof of the Mc-Naughton's Determinization Theorem (see, e.g., [97]. However, we suppose that the reader is already familiar with some basic automata theory and universal algebra. The references, credits, and suggestions for further reading are given at the end of each chapter.