Model theory is used in every theoretical branch of analytic philosophy: in philosophy of mathematics, in philosophy of science, in philosophy of language, in philosophical logic, and in metaphysics. But these wide-ranging uses of model theory have created a highly fragmented literature. On the one hand, many philosophically significant results are found only in mathematics textbooks: these are aimed squarely at mathematicians; they typically presuppose that the reader has a serious background in mathematics; and little clue is given as to their philosophical significance. On the other hand, the philosophical applications of these results are scattered across disconnected pockets of papers. The first aim of this book, then, is to explore the philosophical uses of model theory, focusing on the central topics of reference, realism, and doxology. Its second aim is to address important questions in the philosophy of model theory, such as: sameness of theories and structure, the boundaries of logic, and the classification of mathematical structures. Philosophy and Model Theory will be accessible to anyone who has completed an introductory logic course. It does not assume that readers have encountered model theory before, but starts right at the beginning, discussing philosophical issues that arise even with conceptually basic model theory. Moreover, the book is largely self-contained: model-theoretic notions are defined as and when they are needed for the philosophical discussion, and many of the most philosophically significant results are given accessible proofs.

Stig Kanger (1924-1988) made important contributions to logic and formal philosophy. Kanger's dissertation Provability in Logic, 1957, contained significant results in proof theory as well as the first fully worked out model-theoretic interpretation of quantified modal logic. It is generally accepted nowadays that Kanger was one of the originators of possible worlds semantics for modal logic. Kanger's most original achievements were in the areas of general proof theory, the semantics of modal and deontic logic, and the logical analysis of the concept of rights. He also contributed to action theory, preference logic, and the theory of measurement. This is the first of two volumes dedicated to the work of Stig Kanger. The present volume is a complete collection of Kanger's philosophical papers. The second volume contains critical essays on Kanger's work, as well as biographical essays on Kanger written by colleagues and friends.

Logic plays a central conceptual role in modern mathematics. However, mathematical logic has grown into one of the most recondite areas of mathematics. As a result, most of modern logic is inaccessible to all but the specialist. This new book is a resource that provides a quick introduction and review of the key topics in logic for the computer scientist, engineer, or mathematician.

Handbook of Logic and Proof Techniques for Computer Science presents the elements of modern logic, including many current topics, to the reader having only basic mathematical literacy. Computer scientists will find specific examples and important ideas such as axiomatics, recursion theory, decidability, independence, completeness, consistency, model theory, and P/NP completeness. The book contains definitions, examples and discussion of all of the key ideas in basic logic, but also makes a special effort to cut through the mathematical formalism, difficult notation, and esoteric terminology that is typical of modern mathematical logic. T

This handbook delivers cogent and self-contained introductions to critical advanced topics, including:

* Godels completeness and incompleteness theorems

* Methods of proof, cardinal and ordinal numbers, the continuum hypothesis, the axiom of choice, model theory, and number systems and their construction

* Extensive treatment of complexity theory and programming applications

* Applications to algorithms in Boolean algebra

* Discussion of set theory and applications of logic

The book is an excellent resource for the working mathematical scientist. The graduate student or professional in computer science and engineering or the systems scientist whoneeds to have a quick sketch of a key idea from logic will find it here in this self-contained, accessible, and easy-to-use reference.

1. The ?rst edition of this book was published in 1977. The text has been well received and is still used, although it has been out of print for some time. In the intervening three decades, a lot of interesting things have happened to mathematical logic: (i) Model theory has shown that insights acquired in the study of formal languages could be used fruitfully in solving old problems of conventional mathematics. (ii) Mathematics has been and is moving with growing acceleration from the set-theoretic language of structures to the language and intuition of (higher) categories, leaving behind old concerns about in?nities: a new view of foundations is now emerging. (iii) Computer science, a no-nonsense child of the abstract computability theory, has been creatively dealing with old challenges and providing new ones, such as the P/NP problem. Planning additional chapters for this second edition, I have decided to focus onmodeltheory, the conspicuousabsenceofwhichinthe ?rsteditionwasnoted in several reviews, and the theory of computation, including its categorical and quantum aspects. The whole Part IV: Model Theory, is new. I am very grateful to Boris I. Zilber, who kindly agreed to write it. It may be read directly after Chapter II. The contents of the ?rst edition are basically reproduced here as Chapters I-VIII. Section IV.7, on the cardinality of the continuum, is completed by Section IV.7.3, discussing H. Woodin's discovery.

This monograph looks at causal nets from a philosophical point of view. The author shows that one can build a general philosophical theory of causation on the basis of the causal nets framework that can be fruitfully used to shed new light on philosophical issues. Coverage includes both a theoretical as well as application-oriented approach to the subject. The author first counters David Hume's challenge about whether causation is something ontologically real. The idea behind this is that good metaphysical concepts should behave analogously to good theoretical concepts in scientific theories. In the process, the author offers support for the theory of causal nets as indeed being a correct theory of causation. Next, the book offers an application-oriented approach to the subject. The author shows that causal nets can investigate philosophical issues related to causation. He does this by means of two exemplary applications. The first consists of an evaluation of Jim Woodward's interventionist theory of causation. The second offers a contribution to the new mechanist debate. Introductory chapters outline all the formal basics required. This helps make the book useful for those who are not familiar with causal nets, but interested in causation or in tools for the investigation of philosophical issues related to causation.

Proof theory and category theory were first drawn together by Lambek some 30 years ago but, until now, the most fundamental notions of category theory (as opposed to their embodiments in logic) have not been explained systematically in terms of proof theory. Here it is shown that these notions, in particular the notion of adjunction, can be formulated in such as way as to be characterised by composition elimination. Among the benefits of these composition-free formulations are syntactical and simple model-theoretical, geometrical decision procedures for the commuting of diagrams of arrows. Composition elimination, in the form of Gentzen's cut elimination, takes in categories, and techniques inspired by Gentzen are shown to work even better in a purely categorical context than in logic. An acquaintance with the basic ideas of general proof theory is relied on only for the sake of motivation, however, and the treatment of matters related to categories is also in general self contained. Besides familiar topics, presented in a novel, simple way, the monograph also contains new results. It can be used as an introductory text in categorical proof theory.

A comprehensive and user-friendly guide to the use of logic in mathematical reasoning

Mathematical Logic presents a comprehensive introduction to formal methods of logic and their use as a reliable tool for deductive reasoning. With its user-friendly approach, this book successfully equips readers with the key concepts and methods for formulating valid mathematical arguments that can be used to uncover truths across diverse areas of study such as mathematics, computer science, and philosophy.

The book develops the logical tools for writing proofs by guiding readers through both the established "Hilbert" style of proof writing, as well as the "equational" style that is emerging in computer science and engineering applications. Chapters have been organized into the two topical areas of Boolean logic and predicate logic. Techniques situated outside formal logic are applied to illustrate and demonstrate significant facts regarding the power and limitations of logic, such as:

Logic can certify truths and only truths.

Logic can certify all absolute truths (completeness theorems of Post and Godel).

Logic cannot certify all "conditional" truths, such as those that are specific to the Peano arithmetic. Therefore, logic has some serious limitations, as shown through Godel's incompleteness theorem.

Numerous examples and problem sets are provided throughout the text, further facilitating readers' understanding of the capabilities of logic to discover mathematical truths. In addition, an extensive appendix introduces Tarski semantics and proceeds with detailed proofs of completeness and first incompleteness theorems, while also providing a self-contained introduction to thetheory of computability.

With its thorough scope of coverage and accessible style, Mathematical Logic is an ideal book for courses in mathematics, computer science, and philosophy at the upper-undergraduate and graduate levels. It is also a valuable reference for researchers and practitioners who wish to learn how to use logic in their everyday work.

Arising from the 1996 Cape Town conference in honour of the mathematician Bernhard Banaschewski, this collection of 30 refereed papers represents current developments in category theory, topology, topos theory, universal algebra, model theory, and diverse ordered and algebraic structures. Banaschewski's influence is reflected here, particularly in the contributions to pointfree topology at the levels of nearness, uniformity, and asymmetry. The unifying theme of the volume is the application of categorical methods. The contributing authors are: D. Baboolar, P. Bankston, R. Betti, D. Bourn, P. Cherenack, D. Dikranjan/H.-P. KA1/4nzi, X. Dong/W. Tholen, M. ErnA(c), T.H. Fay, T.H. Fay/S.V. Joubert, D.N. Georgiou/B.K. Papadopoulos, K.A. Hardie/K.H. Kamps/R.W. Kieboom, H. Herrlich/A. Pultr, K.M. Hofmann, S.S. Hong/Y.K. Kim, J. Isbell, R. Jayewardene/O. Wyler, P. Johnstone, R. Lowen/P. Wuyts, E. Lowen-Colebunders/C. Verbeeck, R. Nailana, J. Picado, T. Plewe, J. Reinhold, G. Richter, H. RArl, S.-H. Sun, Tozzi/V. TrnkovA, V. Valov/D. Vuma, and S. Veldsman. Audience: This volume will be of interest to mathematicians whose research involves category theory and its applications to topology, order, and algebra.

The approach to probability theory followed in this book (which differs radically from the usual one, based on a measure-theoretic framework) characterizes probability as a linear operator rather than as a measure, and is based on the concept of coherence, which can be framed in the most general view of conditional probability. It is a flexible' and unifying tool suited for handling, e.g., partial probability assessments (not requiring that the set of all possible outcomes' be endowed with a previously given algebraic structure, such as a Boolean algebra), and conditional independence, in a way that avoids all the inconsistencies related to logical dependence (so that a theory referring to graphical models more general than those usually considered in bayesian networks can be derived). Moreover, it is possible to encompass other approaches to uncertain reasoning, such as fuzziness, possibility functions, and default reasoning.
The book is kept self-contained, provided the reader is familiar with the elementary aspects of propositional calculus, linear algebra, and analysis.

The papers on rough set theory and its applications placed in this volume present a wide spectrum of problems representative to the present. stage of this theory. Researchers from many countries reveal their rec.ent results on various aspects of rough sets. The papers are not confined only to mathematical theory but also include algorithmic aspects, applications and information about software designed for data analysis based on this theory. The volume contains also list of selected publications on rough sets which can be very useful to every one engaged in research or applications in this domain and sometimes perhaps unaware of results of other authors. The book shows that rough set theory is a vivid and vigorous domain with serious results to its credit and bright perspective for future developments. It lays on the crossroads of fuzzy sets, theory of evidence, neural networks, Petri nets and many other branches of AI, logic and mathematics. These diverse connec tions seem to be a very fertile feature of rough set theory and have essentially contributed to its wide and rapid expansion. It is worth mentioning that its philosophical roots stretch down from Leibniz, Frege and Russell up to Popper. Therefore many concepts dwelled on in rough set theory are not entirely new, nevertheless the theory can be viewed as an independent discipline on its own rights. Rough set theory has found many interesting real life applications in medicine, banking, industry and others."

Formal methods for the specification and verification of hardware and software systems are becoming more and more important as systems increase in size and complexity. The aim of the book is to illustrate progress in formal methods, based on Petri net formalisms. It contains a collection of examples arising from different fields, such as flexible manufacturing, telecommunication and workflow management systems.The book covers the main phases in the life cycle of design and implementation of a system, i.e., specification, model checking techniques for verification, analysis of properties, code generation, and execution of models. These techniques and their tool support are discussed in detail including practical issues. Amongst others, fundamental concepts such as composition, abstraction, and reusability of models, model verification, and verification of properties are systematically introduced.

The logician Kurt Goedel in 1951 established a disjunctive thesis about the scope and limits of mathematical knowledge: either the mathematical mind is not equivalent to a Turing machine (i.e., a computer), or there are absolutely undecidable mathematical problems. In the second half of the twentieth century, attempts have been made to arrive at a stronger conclusion. In particular, arguments have been produced by the philosopher J.R. Lucas and by the physicist and mathematician Roger Penrose that intend to show that the mathematical mind is more powerful than any computer. These arguments, and counterarguments to them, have not convinced the logical and philosophical community. The reason for this is an insufficiency if rigour in the debate. The contributions in this volume move the debate forward by formulating rigorous frameworks and formally spelling out and evaluating arguments that bear on Goedel's disjunction in these frameworks. The contributions in this volume have been written by world leading experts in the field.

This book presents the latest research, conducted by leading philosophers and scientists from various fields, on the topic of top-down causation. The chapters combine to form a unique, interdisciplinary perspective, drawing upon George Ellis's extensive research and novel perspectives on topics including downwards causation, weak and strong emergence, mental causation, biological relativity, effective field theory and levels in nature. The collection also serves as a Festschrift in honour of George Ellis' 80th birthday. The extensive and interdisciplinary scope of this book makes it vital reading for anyone interested in the work of George Ellis and current research on the topics of causation and emergence.

Semigroups, Automata, Universal Algebra, Varieties

An accessible explanation of Kurt Goedel's groundbreaking work in mathematical logic In 1931 Kurt Goedel published his fundamental paper, "On Formally Undecidable Propositions of Principia Mathematica and Related Systems." This revolutionary paper challenged certain basic assumptions underlying much research in mathematics and logic. Goedel received public recognition of his work in 1951 when he was awarded the first Albert Einstein Award for achievement in the natural sciences-perhaps the highest award of its kind in the United States. The award committee described his work in mathematical logic as "one of the greatest contributions to the sciences in recent times." However, few mathematicians of the time were equipped to understand the young scholar's complex proof. Ernest Nagel and James Newman provide a readable and accessible explanation to both scholars and non-specialists of the main ideas and broad implications of Goedel's discovery. It offers every educated person with a taste for logic and philosophy the chance to understand a previously difficult and inaccessible subject. New York University Press is proud to publish this special edition of one of its bestselling books. With a new introduction by Douglas R. Hofstadter, this book will appeal students, scholars, and professionals in the fields of mathematics, computer science, logic and philosophy, and science.

The author provides an introduction to automated reasoning, and in particular to resolution theorem proving using the prover OTTER. He presents a new clausal version of von Neumann-Bernays-Goedel set theory, and lists over 400 theorems proved semiautomatically in elementary set theory. He presents a semiautomated proof that the composition of homomorphisms is a homomorphism, thus solving a challenge problem. The author next develops Peano's arithmetic, and gives more than 1200 definitions and theorems in elementary number theory. He gives part of the proof of the fundamental theorem of arithmetic (unique factorization), and gives and OTTER-generated proof of Euler's generalization of Fermat's theorem. Next he develops Tarski's geometry within OTTER. He obtains proofs of most of the challenge problems appearing in the literature, and offers further challenges. He then formalizes the modal logic calculus K4, in order to obtain very high level automated proofs of Loeb's theorem, and of Goedel's two incompleteness theorems. Finally he offers thirty-one unsolved problems in elementary number theory as challenge problems.

Robert A. Rankin, one of the world's foremost authorities on modular forms and a founding editor of The Ramanujan Journal, died on January 27, 2001, at the age of 85. Rankin had broad interests and contributed fundamental papers in a wide variety of areas within number theory, geometry, analysis, and algebra. To commemorate Rankin's life and work, the editors have collected together 25 papers by several eminent mathematicians reflecting Rankin's extensive range of interests within number theory. Many of these papers reflect Rankin's primary focus in modular forms. It is the editors' fervent hope that mathematicians will be stimulated by these papers and gain a greater appreciation for Rankin's contributions to mathematics.
This volume would be an inspiration to students and researchers in the areas of number theory and modular forms.

The present volume of the "Handbook of the History of Logic" is designed to establish 19th century Britain as a substantial force in logic, developing new ideas, some of which would be overtaken by, and other that would anticipate, the century's later capitulation to the mathematization of logic.
"British Logic in the Nineteenth Century" is indispensable reading and a definitive research resource for anyone with an interest in the history of logic.
- Detailed and comprehensive chapters covering the entire range of modal logic
- Contains the latest scholarly discoveries and interpretative insights that answer many questions in the field of logic

This contributed volume collects papers related to the Logic in Question workshop, which has taken place annually at Sorbonne University in Paris since 2011. Each year, the workshop brings together historians, philosophers, mathematicians, linguists, and computer scientists to explore questions related to the nature of logic and how it has developed over the years. As a result, chapter authors provide a thorough, interdisciplinary exploration of topics that have been studied in the workshop. Organized into three sections, the first part of the book focuses on historical questions related to logic, the second explores philosophical questions, and the third section is dedicated to mathematical discussions. Specific topics include: * logic and analogy* Chinese logic* nineteenth century British logic (in particular Boole and Lewis Carroll)* logical diagrams * the place and value of logic in Louis Couturat's philosophical thinking* contributions of logical analysis for mathematics education* the exceptionality of logic* the logical expressive power of natural languages* the unification of mathematics via topos theory Logic in Question will appeal to pure logicians, historians of logic, philosophers, linguists, and other researchers interested in the history of logic, making this volume a unique and valuable contribution to the field.

This book discusses the theory of triangular norms and surveys several applied fields in which triangular norms play a significant part: probabilistic metric spaces, aggregation operators, many-valued logics, fuzzy logics, sets and control, and non-additive measures together with their corresponding integrals. It includes many graphical illustrations and gives a well-balanced picture of theory and applications. It is for mathematicians, computer scientists, applied computer scientists and engineers.

Harish-Chandra¿s general Plancherel inversion theorem admits a much shorter presentation for spherical functions. Previous expositions have dealt with a general, wide class of Lie groups. This has made access to the subject difficult for outsiders, who may wish to connect some aspects with several if not all other parts of mathematics. In this book, the essential features of Harish-Chandra theory are exhibited on SLn(R), but hundreds of pages of background are replaced by short direct verifications. The material is accessible to graduate students with no background in Lie groups and representation theory.

Roy T Cook examines the Yablo paradox-a paradoxical, infinite sequence of sentences, each of which entails the falsity of all others later than it in the sequence-with special attention paid to the idea that this paradox provides us with a semantic paradox that involves no circularity. The three main chapters of the book focus, respectively, on three questions that can be (and have been) asked about the Yablo construction. First we have the Characterization Problem, which asks what patterns of sentential reference (circular or not) generate semantic paradoxes. Addressing this problem requires an interesting and fruitful detour through the theory of directed graphs, allowing us to draw interesting connections between philosophical problems and purely mathematical ones. Next is the Circularity Question, which addresses whether or not the Yablo paradox is genuinely non-circular. Answering this question is complicated: although the original formulation of the Yablo paradox is circular, it turns out that it is not circular in any sense that can bear the blame for the paradox. Further, formulations of the paradox using infinitary conjunction provide genuinely non-circular constructions. Finally, Cook turns his attention to the Generalizability Question: can the Yabloesque pattern be used to generate genuinely non-circular variants of other paradoxes, such as epistemic and set-theoretic paradoxes? Cook argues that although there are general constructions-unwindings-that transform circular constructions into Yablo-like sequences, it turns out that these sorts of constructions are not 'well-behaved' when transferred from semantic puzzles to puzzles of other sorts. He concludes with a short discussion of the connections between the Yablo paradox and the Curry paradox.

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.

Contents and treatment are fresh and very different from the standard treatments Presents a fully constructive version of what it means to do algebra The exposition is not only clear, it is friendly, philosophical, and considerate even to the most naive or inexperienced reader