Oxford Logic Guides – serie

The publication of Rasiowa and Sikorski's The Mathematics of Metamathematics (1970), Rasiowa's An Algebraic Approach to Non-Classical Logics (1974), and Wójcicki's Theory of Logical Calculi (1988) created a niche in the field of mathematical and philosophical logic. This in-depth study of the concept of a consequence relation, culminating in the concept of a Lindenbaum-Tarski algebra, fills this niche. Citkin and Muravitsky consider the problem of obtaining confirmation that a statement is a consequence of a set of statements as prerequisites, on the one hand, and the problem of demonstrating that such confirmation does not exist in the structure under consideration, on the other hand. For the second part of this problem, the concept of the Lindenbaum-Tarski algebra plays a key role, which becomes even more important when the considered consequence relation is placed in the context of decidability. This role is traced in the book for various formal objective languages. The work also includes helpful exercises to aid the reader's assimilation of the book's material. Intended for advanced undergraduate and graduate students in mathematics and philosophy, this book can be used to teach special courses in logic with an emphasis on algebraic methods, for self-study, and also as a reference work.

A sentence of first-order logic is satisfiable if it is true in some structure, and finitely satisfiable if it is true in some finite structure. The question arises as to whether there exists an algorithm for determining whether a given formula of first-order logic is satisfiable, or indeed finitely satisfiable. This question was answered negatively in 1936 by Church and Turing (for satisfiability) and in 1950 by Trakhtenbrot (for finite satisfiability).In contrast, the satisfiability and finite satisfiability problems are algorithmically solvable for restricted subsets---or, as we say, fragments---of first-order logic, a fact which is today of considerable interest in Computer Science. This book provides an up-to-date survey of the principal axes of research, charting the limits of decision in first-order logic and exploring the trade-off between expressive power and complexity of reasoning. Divided into three parts, the book considers for which fragments of first-order logic there is an effective method for determining satisfiability or finite satisfiability. Furthermore, if these problems are decidable for some fragment, what is their computational complexity? Part I focusses on fragments defined by restricting the set of available formulas. Topics covered include the Aristotelian syllogistic and its relatives, the two-variable fragment, the guarded fragment, the quantifier-prefix fragments and the fluted fragment. Part II investigates logics with counting quantifiers. Starting with De Morgan's numerical generalization of the Aristotelian syllogistic, we proceed to the two-variable fragment with counting quantifiers and its guarded subfragment, explaining the applications of the latter to the problem of query answering in structured data. Part III concerns logics characterized by semantic constraints, limiting the available interpretations of certain predicates. Taking propositional modal logic and graded modal logic as our cue, we return to the satisfiability problem for two-variable first-order logic and its relatives, but this time with certain distinguished binary predicates constrained to be interpreted as equivalence relations or transitive relations. The work finishes, slightly breaching the bounds of first-order logic proper, with a chapter on logics interpreted over trees.

Now in it's fourth edition, this classic work on logic presents the student with a clear, concise introduction to the subject of logic and its apllications. The first part of the book introduces the concepts and principles which make up the elements of logic, demonstrating that the concepts of logic are found in all branches of mathematics, and that logical laws are constantly applied in mathematical reasoning. The book goes on to show the applications of logic in mathematical theory building using concrete examples, drawing upon the concepts and principles presented in the first section. An introduction to the theory of real numbers is also presented. Exercises are included, designed to assist in the assimilation of the concepts and principles. Throughout the conceptual side or logic is stressed.Thoroughly revised by the author's son, the book remains a fundametal guide to modern mathematica logic and is a very important addition to this highly successful series.

Kurt Godel, the greatest logician of our time, startled the world of mathematics in 1931 with his Theorem of Undecidability, which showed that some statements in mathematics are inherently "undecidable". His work on the completeness of logic, the incompleteness of number theory, and the consistency of the axiom of choice and the continuum theory brought him further worldwide fame.In this introductory volume, Raymond Smullyan, himself a well-known logician, guides the reader through the fascinating world of Godel's incompleteness theorems. The level of presentation is suitable for anyone with a basic acquaintance with mathematical logic. As a clear, concise introduction to a difficult but essential subject, the book will appeal to mathematicians, philosophers, and computer scientists.

This work is a sequel to the author's Gödel's Incompleteness Theorems, though it can be read independently by anyone familiar with Gödel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.

Per Martin-Löf's work on the development of constructive type theory has been of huge significance in the fields of logic and the foundations of mathematics. It is also of broader philosophical significance, and has important applications in areas such as computing science and linguistics. This volume draws together contributions from researchers whose work builds on the theory developed by Martin-Löf over the last twenty-five years. As well as celebrating the anniversary of the birth of the subject it covers many of the diverse fields which are now influenced by type theory. It is an invaluable record of areas of current activity, but also contains contributions from N. G. de Bruijn and William Tait, both important figures in the early development of the subject. Also published for the first time is one of Per Martin-Löf's earliest papers.

Change, Choice and Inference develops logical theories that are necessary both for the understanding of adaptable human reasoning and for the design of intelligent systems. The book shows that reasoning processes - the drawing on inferences and changing one's beliefs - can be viewed as belonging to the realm of practical reason by embedding logical theories into the broader context of the theory of rational choice. The book unifies lively and significant strands of research in logic, philosophy, economics and artificial intelligence. It elaborates on the relevant theories and provides a mathematically precise foundation for the thesis that large parts of theoretical reason can be subsumed under practical reason.

Modern applications of logic, in mathematics, theoretical computer science, and linguistics, require combined systems involving many different logics working together. In this book the author offers a basic methodology for combining-or fibring-systems. This means that many existing complex systems can be broken down into simpler components, hence making them much easier to manipulate. Using this methodology the book discusses ways of obtaining a wide variety of multimodal, modal intuitionistic, modal substructural and fuzzy systems in a uniform way. It also covers self-fibred languages which allow formulae to apply to themselves. The book also studies sufficient conditions for transferring properties of the component logics into properties of the combined system.

This is a long-awaited new edition of one of the best known Oxford Logic Guides. The book gives an informal but thorough introduction to intuitionistic mathematics, leading the reader gently through the fundamental mathematical and philosophical concepts. The treatment of various topics has been completely revised for this second edition. Brouwer's proof of the Bar Theorem has been reworked, the account of valuation systems simplified, and the treatment of generalized Beth Trees and the completeness of intuitionistic first-order logic rewritten. Readers are assumed to have some knowledge of classical formal logic and a general awareness of the history of intuitionism. From reviews of the first edition: This excellent book can be recommended to the student of mathematics or philosophy wishing to get a comprehensive and reliable introduction to modern intuitionism. Zentralblatt für Mathematik The relevance of this book extends well beyond the confines of the philosophy of mathematics, right to the centre of debates in the philosophy of language. Philosophical Books . . . a valuable and original contribution to the philosophy of mathematics. Journal of Symbolic Logic

This book is a specialized monograph on interpolation and definability, a notion central in pure logic and with significant meaning and applicability in all areas where logic is applied, especially computer science, artificial intelligence, logic programming, philosophy of science and natural language.Suitable for researchers and graduate students in mathematics, computer science and philosophy, this is the latest in the prestigous world-renowned Oxford Logic Guides, which contains Michael Dummet's Elements of intuitionism (second edition), J. M. Dunn and G. Hardegree's Algebraic Methods in Philosophical Logic, H. Rott's Change, Choice and Inference: A Study of Belief Revision and Nonmonotonic Reasoning, P. T. Johnstone's Sketches of an Elephant: A Topos Theory Compendium: Volumes 1 and 2, and David J. Pym and Eike Ritter's Reductive Logic and Proof Search: Proof theory, semantics and control.

The book covers elementary aspects of category theory and topos theory. It has few mathematical prerequisites, and uses categorical methods throughout rather than beginning with set theoretic foundations. It works with key notions such as cartesian closedness, adjunctions, regular categories, and the internal logic of a topos. Full statements and elementary proofs are given for the central theorems, including the fundamental theorem of toposes, the sheafification theorem, and the construction of Grothendieck toposes over any topos as base. Three chapters discuss applications of toposes in detail, namely to sets, to basic differential geometry, and to recursive analysis.

Set theory is concerned with the foundation of mathematics. In the original formulations of set theory, there were paradoxes contained in the idea of the "set of all sets". Current standard theory (Zermelo-Fraenkel) avoids these paradoxes by restricting the way sets may be formed by other sets, specifically to disallow the possibility of forming the set of all sets. In the 1930s, Quine proposed a different form of set theory in which the set of all sets - the universal set - is allowed, but other restrictions are placed on these axioms. Since then, the steady interest expressed in these non-standard set theories has been boosted by their relevance to computer science.The second edition still concentrates largely on Quine's New Foundations, reflecting the author's belief that this provides the richest and most mysterious of the various systems dealing with set theories with a universal set. Also included is an expanded and completely revised account of the set theories of Church-Oswald and Mitchell, with descriptions of permutation models and extensions that preserve power sets. Dr Foster here presents the reader with a useful and readable introduction for those interested in this topic, and a reference work for those already involved in this area.

Topos Theory is a subject that stands at the junction of geometry, mathematical logic and theoretical computer science, and it derives much of its power from the interplay of ideas drawn from these different areas. Because of this, an account of topos theory which approaches the subject from one particular direction can only hope to give a partial picture; the aim of this compendium is to present as comprehensive an account as possible of all the main approaches and thereby to demonstrate the overall unity of the subject. The material is organized in such a way that readers interested in following a particular line of approach may do so by starting at an appropriate point in the text.

This book is a specialized monograph on the development of the mathematical and computational metatheory of reductive logic and proof-search, areas of logic that are becoming important in computer science. A systematic foundational text on these emerging topics, it includes proof-theoretic, semantic/model-theoretic and algorithmic aspects. The scope ranges from the conceptual background to reductive logic, through its mathematical metatheory, to its modern applications in the computational sciences.Suitable for researchers and graduate students in mathematical, computational and philosophical logic, and in theoretical computer science and artificial intelligence, this is the latest in the prestigous world-renowned Oxford Logic Guides, which contains Michael Dummet's Elements of intuitionism (2nd Edition), Dov M. Gabbay, Mark A. Reynolds, and Marcelo Finger's Temporal Logic Mathematical Foundations and Computational Aspects , J. M. Dunn and G. Hardegree's Algebraic Methods in Philosophical Logic, H. Rott's Change, Choice and Inference: A Study of Belief Revision and Nonmonotonic Reasoning , and P. T. Johnstone's Sketches of an Elephant: A Topos Theory Compendium: Volumes 1 and 2 .

This comprehensive text demonstrates how various notions of logic can be viewed as notions of universal algebra. It is aimed primarily for logisticians in mathematics, philosophy, computer science and linguistics with an interest in algebraic logic, but is also accessible to those from a non-logistics background. It is suitable for researchers, graduates and advanced undergraduates who have an introductory knowledge of algebraic logic providing more advanced concepts, as well as more theoretical aspects. The main theme is that standard algebraic results (representations) translate into standard logical results (completeness). Other themes involve identification of a class of algebras appropriate for classical and non-classical logic studies, including: gaggles, distributoids, partial- gaggles, and tonoids. An imporatant sub title is that logic is fundamentally information based, with its main elements being propositions, that can be understood as sets of information states. Logics are considered in various senses e.g. systems of theorems, consequence relations and, symmetric consequence relations.

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.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 to the field.

Nonstandard models of arithmetic are of interest to mathematicians through the presence of infinite (or nonstandard) integers and the various properties they inherit from the finite integers. Since their introduction in the 1930s (by Skolem and Gödel ), they have come to play an important role in model theory, and in combinatorics through independence results such as the Paris-Harrington theorem. This book is an introduction to these developments, and stresses the interplay between the first-order theory, recursion-theoretic aspects, and the structural properties of these models.Prerequisites have been kept to a minimum. A basic grounding in elementary model theory and a familiarity with the notions of recursive, primitive recursive, and r.e. sets will be sufficient. Consequently, the book should be suitable for postgraduate students coming to the subject for the first time and a variety of exercises of varying degrees of difficulty will help to further the reader's understanding. Beginning with Gödel's incompleteness theorem, the book covers the prime models, cofinal extensions, end extensions, Gaifman's construction of a definable type, Tennenbaum's theorem, Friedman's theorem and subsequent work on indicators, and culminates in a chapter on recursive saturation and resplendency.

Cantor's ideas formed the basis for set theory and also for the mathematical treatment of the concept of infinity. The philosophical and heuristic framework he developed had a lasting effect on modern mathematics, and is the recurrent theme of this volume. Hallett explores Cantor's ideas and, in particular, their ramifications for Zermelo-Frankel set theory.

The central contention of this book is that second-order logic has a central role to play in laying the foundations of mathematics. In order to develop the argument fully, the author presents a detailed development of higher-order logic, including a comprehensive discussion of its semantics.Professor Shapiro demonstrates the prevalence of second-order notions in mathematics is practised, and also the extent to which mathematical concepts can be formulated in second-order languages . He shows how first-order languages are insufficient to codify many concepts in contemporary mathematics, and thus that higher-order logic is needed to fully reflect current mathematics.Throughout, the emphasis is on discussing the philosophical and historical issues associated with this subject, and the implications that they have for foundational studies. For the most part, the author assumes little more than a familiarity with logic as might be gained from a beginning graduate course which includes the incompleteness of arithmetic and the Lowenheim-Skolem theorems. All those concerned with the foundations of mathematics will find this a thought-provoking discussion of some of the central issues in this subject.

Topos Theory is a subject that stands at the junction of geometry, mathematical logic and theoretical computer science, and it derives much of its power from the interplay of ideas drawn from these different areas. Because of this, an account of topos theory which approaches the subject from one particular direction can only hope to give a partial picture; the aim of this compendium is to present as comprehensive an account as possible of all the main approaches and thereby to demonstrate the overall unity of the subject. The material is organized in such a way that readers interested in following a particular line of approach may do so by starting at an appropriate point in the text.

Topos theory provides an important setting and language for much of mathematical logic and set theory. It is well known that a typed language can be given for a topos which allows a topos to be regarded as a category of sets. This enables a fruitful interplay between category theory and set theory.However, one stumbling block to a logical approach to topos theory has been the treatment of geometric morphisms. This book presents a convenient and natural solution to this problem by developing the notion of a frame relative to an elementary topos. The authors show how this technique enables a logical approach to be taken to topics such as category theory relative to a topos and the relative Giraud theorem.The work is essentially self-contained except that the authors presuppose a familiarity with basic category theory and topos theory.

This book is an exposition of the central features of one of the most developed and sophisticated parts of modern model theory. Geometric stability theory studies the fine structure of models of stable theories. An ever present theme is the existence and structure of definable groups. Fundamental applications to a classification theory are included in the text. Recent years have seen other surprising applications to, among other things, diophantine geometry. This book will be invaluable to anyone interested in modern model theory, such as working model theorists and graduate students in logic.

The book is devoted to the theory of groups of finite Morley rank. These groups arise in model theory and generalize the concept of algebraic groups over algebraically closed fields. The book contains almost all the known results in the subject. Trying to attract pure group theorists in the subject and to prepare the graduate student to start the research in the area, the authors adopted an algebraic and self evident point of view rather than a model theoretic one, and developed the theory from scratch. All the necessary model theoretical and group theoretical notions are explained in length. The book is full of exercises and examples and one of its chapters contains a discussion of open problems and a program for further research.

The main purpose of this book is to present a unified treatment of fixed points as they occur in Gödel's incompleteness proofs, recursion theory, combinatory logic, semantics, and metamathematics. The book provides a survey of introductory material and a summary of recent research. The first chapters are of an introductory nature and consist mainly of exercises with solutions given to most of them.

This book principally concerns the rapidly growing area of what might be termed "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. Issuing from a two-year NSF and Czech Academy of Sciences grant supporting a month-long workshop and 3-day conference in San Diego (1990) and Prague (1991), the book contains refereed articles concerning the existence of the most general unifier, a special case of Kreisel's conjecture on length-of-proof, propositional logic proof size, a new alternating logtime algorithm for boolean formula evaluation and relation to branching programs, interpretability between fragments of arithmetic, feasible interpretability, provability logic, open induction, Herbrand-type theorems, isomorphism between first and second order bounded arithmetics, forcing techniques in bounded arithmetic, ordinal arithmetic in Λ Δ o . Also included is an extended abstract of J P Ressayre's new approach concerning the model completeness of the theory of real closed expotential fields. Additional features of the book include (1) the transcription and translation of a recently discovered 1956 letter from K Godel to J von Neumann, asking about a polynomial time algorithm for the proof in k-symbols of predicate calculus formulas (equivalent to the P-NP question), (2) an OPEN PROBLEM LIST consisting of 7 fundamental and 39 technical questions contributed by many researchers, together with a bibliography of relevant references.

This is the second volume of this respected work in temporal logic. Whereas volume 1 dealt primarily with basic concepts and methods, volume 2 discusses the more applicable aspects of temporal logics. The first four chapters continue the more theoretical presentations in volume 1, covering automata, branching time and labelled deduction. The rest of the book discusses temporal databases, temporal execution and programming, actions and planning.

This long awaited book gives a thorough account of the mathematical foundations of Temporal Logic, one of the most important areas of logic in computer science.The book, which consists of fifteen chapters, moves on from giving a solid introduction in semantical and axiomatic approaches to temporal logic to covering the central topics of predicate temporal logic, meta-languages, general theories of axiomatization, many dimensional systems, propositional quantifiers, expressive power, Henkin dimension, temporalization of other logics, and decidability results.Much of the research presented here is frontline in the new results and in the unifying methodology. This is an indispensable reference work for both the pure logician and the theoretical computer scientist.

For a novice this book is a mathematically-oriented introduction to modal logic, the discipline within mathematical logic studying mathematical models of reasoning which involve various kinds of modal operators - `like it is necessary' in philosophy, `it is believed' in cognitive science, `it is provable' in mathematics and `it is true after executing a program' in computer science. It is an advanced text which starts with very fundamental concepts and gradually proceeds to the front line of current research, introducing in full details the modern semantical and algebraic apparatus and covering practically all classical results in the field. It contains both numerous exercises and open problems, and presupposes only minimal knowledge in mathematics. A specialist can use the book as a source of references. For the first time results and methods of many directions in propositional modal logic - from completeness and duality to algorithmic problems - are collected and systematically presented in one volume. Unlike other books, modal logic is treated here as a uniform theory rather than a collection of a few particular systems. It is the only book presenting the theory of superintuitionistic logics.

Is the continuum hypothesis still open? If we interpret it as finding the laws of cardinal arithmetic (really exponentiation since addition and multiplication were classically solved), it was thought to be essentially solved by the independence results of Gödel and Cohen (and Easton) with some isolated positive results (like Galvin-Hajnal). It was expected that only more independence results remained to be proved.The author has come to change his view: we should stress Π]*N0 (not 2]Π) and mainly look at the cofinalities rather than cardinalities, in particular pp (μ), pcf (α). Their properties are investigated here and conventional cardinal arithmetic is reduced to 2]*N (*N - regular, cases totally independent) and various cofinalities. This enables us to get new results for the conventional cardinal arithmetic, thus supporting the interest in our view. We also find other applications, extend older methods of using normal fiters and prove the existence of Jonsson algebra.