Term rewriting techniques are applicable to various fields of computer science, including software engineering, programming languages, computer algebra, program verification, automated theorem proving and Boolean algebra. These powerful techniques can be successfully applied in all areas that demand efficient methods for reasoning with equations. One of the major problems encountered is the characterization of classes of rewrite systems that have a desirable property, like confluence or termination. In a system that is both terminating and confluent, every computation leads to a result that is unique, regardless of the order in which the rewrite rules are applied. This volume provides a comprehensive and unified presentation of termination and confluence, as well as related properties. Topics and features: *unified presentation and notation for important advanced topics *comprehensive coverage of conditional term-rewriting systems *state-of-the-art survey of modularity in term rewriting *presentation of unified framework for term and graph rewriting *up-to-date discussion of transformational methods for proving termination of logic programs, including the TALP system This unique book offers a comprehensive and unified view of the subject that is suitable for all computer scientists, program designers, and software engineers who study and use term rewriting techniques. Practitioners, researchers and professionals will find the book an essential and authoritative resource and guide for the latest developments and results in the field.

Alfred Tarski was one of the two giants of the twentieth-century development of logic, along with Kurt Goedel. The four volumes of this collection contain all of Tarski's published papers and abstracts, as well as a comprehensive bibliography. Here will be found many of the works, spanning the period 1921 through 1979, which are the bedrock of contemporary areas of logic, whether in mathematics or philosophy. These areas include the theory of truth in formalized languages, decision methods and undecidable theories, foundations of geometry, set theory, and model theory, algebraic logic, and universal algebra.

The book is intended for students who want to learn how to prove theorems and be better prepared for the rigors required in more advance mathematics. One of the key components in this textbook is the development of a methodology to lay bare the structure underpinning the construction of a proof, much as diagramming a sentence lays bare its grammatical structure. Diagramming a proof is a way of presenting the relationships between the various parts of a proof. A proof diagram provides a tool for showing students how to write correct mathematical proofs.

This is a thorough and comprehensive treatment of the theory of NP-completeness in the framework of algebraic complexity theory. Coverage includes Valiant's algebraic theory of NP-completeness; interrelations with the classical theory as well as the Blum-Shub-Smale model of computation, questions of structural complexity; fast evaluation of representations of general linear groups; and complexity of immanants.

George Boole (1815-1864) is well known to mathematicians for his research and textbooks on the calculus, but his name has spread world-wide for his innovations in symbolic logic and the development and applications made since his day. The utility of "Boolean algebra" in computing has greatly increased curiosity in the nature and extent of his achievements. His work is most accessible in his two books on logic, "A mathematical analysis of logic" (1947) and "An investigation of the laws of thought" (1954). But at various times he wrote manuscript essays, especially after the publication of the second book; several were intended for a non-technical work, "The Philosophy of logic," which he was not able to complete. This volume contains an edited selection which not only relates them to Boole's publications and the historical context of his time, but also describes their strange history of family, followers and scholars have treid to confect an edition. The book will appeal to logicians, mathematicians and philosophers, and those interested in the histories of the corresponding subjects; and also students of the early Victorian Britain in which they were written.

This volume presents a unified approach to the mathematical theory of a wide class of non-additive set functions, the so called null-additive set functions, which also includes classical measure theory. It includes such important set functions as capacities, triangular set functions, some fuzzy measures, submeasures, decomposable measures, possibility measures, distorted probabilities, autocontinuous set functions, etc. The usefulness of the theory is demonstrated by applications in nonlinear differential and difference equations; fractal geometry in the theory of chaos; the approximation of functions in modular spaces by nonlinear singular integral operators; and in the theory of diagonal theorems as a universal method for proving general and fundamental theorems in functional analysis and measure theory. Audience: This book will be of value to researchers and postgraduate students in mathematics, as well as in such diverse fields as knowledge engineering, artificial intelligence, game theory, statistics, economics, sociology and industry.

The book is devoted to various constructions of sets which are nonmeasurable with respect to invariant (more generally, quasi-invariant) measures. Our starting point is the classical Vitali theorem stating the existence of subsets of the real line which are not measurable in the Lebesgue sense. This theorem stimulated the development of the following interesting topics in mathematics:
1. Paradoxical decompositions of sets in finite-dimensional Euclidean spaces;
2. The theory of non-real-valued-measurable cardinals;
3. The theory of invariant (quasi-invariant)
extensions of invariant (quasi-invariant) measures.
These topics are under consideration in the book. The role of nonmeasurable sets (functions) in point set theory and real analysis is underlined and various classes of such sets (functions) are investigated . Among them there are: Vitali sets, Bernstein sets, Sierpinski sets, nontrivial solutions of the Cauchy functional equation, absolutely nonmeasurable sets in uncountable groups, absolutely nonmeasurable additive functions, thick uniform subsets of the plane, small nonmeasurable sets, absolutely negligible sets, etc. The importance of properties of nonmeasurable sets for various aspects of the measure extension problem is shown. It is also demonstrated that there are close relationships between the existence of nonmeasurable sets and some deep questions of axiomatic set theory, infinite combinatorics, set-theoretical topology, general theory of commutative groups. Many open attractive problems are formulated concerning nonmeasurable sets and functions.
. highlights the importance of nonmeasurable sets (functions) for general measure extension problem.
. Deep connections of the topic with set theory, real analysis, infinite combinatorics, group theory and geometry of Euclidean spaces shown and underlined.
. self-contained and accessible for a wide audience of potential readers.
. Each chapter ends with exercises which provide valuable additional information about nonmeasurable sets and functions.
. Numerous open problems and questions."

The present volume of the Handbook of the History of Logic brings together two of the most important developments in 20th century non-classical logic. These are many-valuedness and non-monotonicity. On the one approach, in deference to vagueness, temporal or quantum indeterminacy or reference-failure, sentences that are classically non-bivalent are allowed as inputs and outputs to consequence relations. Many-valued, dialetheic, fuzzy and quantum logics are, among other things, principled attempts to regulate the flow-through of sentences that are neither true nor false. On the second, or non-monotonic, approach, constraints are placed on inputs (and sometimes on outputs) of a classical consequence relation, with a view to producing a notion of consequence that serves in a more realistic way the requirements of real-life inference.
Many-valued logics produce an interesting problem. Non-bivalent inputs produce classically valid consequence statements, for any choice of outputs. A major task of many-valued logics of all stripes is to fashion an appropriately non-classical relation of consequence.
The chief preoccupation of non-monotonic (and default) logicians is how to constrain inputs and outputs of the consequence relation. In what is called "left non-monotonicity," it is forbidden to add new sentences to the inputs of true consequence-statements. The restriction takes notice of the fact that new information will sometimes override an antecedently (and reasonably) derived consequence. In what is called "right non-monotonicity," limitations are imposed on outputs of the consequence relation. Most notably, perhaps, is the requirement that the rule of or-introduction not be givenfree sway on outputs. Also prominent is the effort of paraconsistent logicians, both preservationist and dialetheic, to limit the outputs of inconsistent inputs, which in classical contexts are wholly unconstrained.
In some instances, our two themes coincide. Dialetheic logics are a case in point. Dialetheic logics allow certain selected sentences to have, as a third truth value, the classical values of truth and falsity together. So such logics also admit classically inconsistent inputs. A central task is to construct a right non-monotonic consequence relation that allows for these many-valued, and inconsistent, inputs.
The Many Valued and Non-Monotonic Turn in Logic is an indispensable research tool for anyone interested in the development of logic, including researchers, graduate and senior undergraduate students in logic, history of logic, mathematics, history of mathematics, computer science, AI, linguistics, cognitive science, argumentation theory, and the history of ideas.
- Detailed and comprehensive chapters covering the entire range of modal logic
- Contains the latest scholarly discoveries and interprative insights that answers many questions in the field of logic

We welcome Volume 20, Formal Aspects of Context. Context has always been recognised as strongly relevant to models in language, philosophy, logic and artifi cial intelligence. In recent years theoretical advances in these areas and especially in logic have accelerated the study of context in the international community. An annual conference is held and many researchers have come to realise that many of the old puzzles should be reconsidered with proper attention to context. The volume editors and contributors are from among the most active front-line researchers in the area and the contents shows how wide and vigorous this area is. There are strong scientific connections with earlier volumes in the series. I am confident that the appearance of this book in our series will help secure the study of context as an important area of applied logic. D.M.Gabbay INTRODUCTION This book is a result of the First International and Interdisciplinary Con ference on Modelling and Using Context, which was organised in Rio de Janeiro in January 1997, and contains a selection of the papers presented there, refereed and revised through a process of anonymous peer review. The treatment of contexts as bona-fide objects of logical formalisation has gained wide acceptance in recent years, following the seminal impetus by McCarthy in his 'lUring award address."

Despite decades of work in evolutionary algorithms, there remains a lot of uncertainty as to when it is beneficial or detrimental to use recombination or mutation. This book provides a characterization of the roles that recombination and mutation play in evolutionary algorithms. It integrates prior theoretical work and introduces new theoretical techniques for studying evolutionary algorithms. An aggregation algorithm for Markov chains is introduced which is useful for studying not only evolutionary algorithms specifically, but also complex systems in general. Practical consequences of the theory are explored and a novel method for comparing search and optimization algorithms is introduced. A focus on discrete rather than real-valued representations allows the book to bridge multiple communities, including evolutionary biologists and population geneticists.

Mathematics has stood as a bridge between the Humanities and the Sciences since the days of classical antiquity. For Plato, mathematics was evidence of Being in the midst of Becoming, garden variety evidence apparent even to small children and the unphilosophical, and therefore of the highest educational significance. In the great central similes of The Republic it is the touchstone ofintelligibility for discourse, and in the Timaeus it provides in an oddly literal sense the framework of nature, insuring the intelligibility ofthe material world. For Descartes, mathematical ideas had a clarity and distinctness akin to the idea of God, as the fifth of the Meditations makes especially clear. Cartesian mathematicals are constructions as well as objects envisioned by the soul; in the Principles, the work ofthe physicist who provides a quantified account ofthe machines of nature hovers between description and constitution. For Kant, mathematics reveals the possibility of universal and necessary knowledge that is neither the logical unpacking ofconcepts nor the record of perceptual experience. In the Critique ofPure Reason, mathematics is one of the transcendental instruments the human mind uses to apprehend nature, and by apprehending to construct it under the universal and necessary lawsofNewtonian mechanics.

From the very beginning of their investigation of human reasoning, philosophers have identified two other forms of reasoning, besides deduction, which we now call abduction and induction. Deduction is now fairly well understood, but abduction and induction have eluded a similar level of understanding. The papers collected here address the relationship between abduction and induction and their possible integration. The approach is sometimes philosophical, sometimes that of pure logic, and some papers adopt the more task-oriented approach of AI. The book will command the attention of philosophers, logicians, AI researchers and computer scientists in general.

Providing the first comprehensive treatment of the subject, this groundbreaking work is solidly founded on a decade of concentrated research, some of which is published here for the first time, as well as practical, ''hands on'' classroom experience. The clarity of presentation and abundance of examples and exercises make it suitable as a graduate level text in mathematics, decision making, artificial intelligence, and engineering courses.

Modal logics, originally conceived in philosophy, have recently found many applications in computer science, artificial intelligence, the foundations of mathematics, linguistics and other disciplines. Celebrated for their good computational behaviour, modal logics are used as effective formalisms for talking about time, space, knowledge, beliefs, actions, obligations, provability, etc. However, the nice computational properties can drastically change if we combine some of these formalisms into a many-dimensional system, say, to reason about knowledge bases developing in time or moving objects.

To study the computational behaviour of many-dimensional modal logics is the main aim of this book. On the one hand, it is concerned with providing a solid mathematical foundation for this discipline, while on the other hand, it shows that many seemingly different applied many-dimensional systems (e.g., multi-agent systems, description logics with epistemic, temporal and dynamic operators, spatio-temporal logics, etc.) fit in perfectly with this theoretical framework, and so their computational behaviour can be analyzed using the developed machinery.

We start with concrete examples of applied one- and many-dimensional modal logics such as temporal, epistemic, dynamic, description, spatial logics, and various combinations of these. Then we develop a mathematical theory for handling a spectrum of 'abstract' combinations of modal logics - fusions and products of modal logics, fragments of first-order modal and temporal logics - focusing on three major problems: decidability, axiomatizability, and computational complexity. Besides the standard methods of modal logic, the technical toolkit includes the method of quasimodels, mosaics, tilings, reductions to monadic second-order logic, algebraic logic techniques. Finally, we apply the developed machinery and obtained results to three case studies from the field of knowledge representation and reasoning: temporal epistemic logics for reasoning about multi-agent systems, modalized description logics for dynamic ontologies, and spatio-temporal logics.

The genre of the book can be defined as a research monograph. It brings the reader to the front line of current research in the field by showing both recent achievements and directions of future investigations (in particular, multiple open problems). On the other hand, well-known results from modal and first-order logic are formulated without proofs and supplied with references to accessible sources.

The intended audience of this book is logicians as well as those researchers who use logic in computer science and artificial intelligence. More specific application areas are, e.g., knowledge representation and reasoning, in particular, terminological, temporal and spatial reasoning, or reasoning about agents. And we also believe that researchers from certain other disciplines, say, temporal and spatial databases or geographical information systems, will benefit from this book as well.

Key Features:

Integrated approach to modern modal and temporal logics and their applications in artificial intelligence and computer science

Written by internationally leading researchers in the field of pure and applied logic

Combines mathematical theory of modal logic and applications in artificial intelligence and computer science

Numerous open problems for further research

Well illustrated with pictures and tables
"

I am very happy to have this opportunity to introduce Luca Vigano's book on Labelled Non-Classical Logics. I put forward the methodology of labelled deductive systems to the participants of Logic Colloquium'90 (Labelled Deductive systems, a Position Paper, In J. Oikkonen and J. Vaananen, editors, Logic Colloquium '90, Volume 2 of Lecture Notes in Logic, pages 66-68, Springer, Berlin, 1993), in an attempt to bring labelling as a recognised and significant component of our logic culture. It was a response to earlier isolated uses of labels by various distinguished authors, as a means to achieve local proof theoretic goals. Labelling was used in many different areas such as resource labelling in relevance logics, prefix tableaux in modal logics, annotated logic programs in logic programming, proof tracing in truth maintenance systems, and various side annotations in higher-order proof theory, arithmetic and analysis. This widespread local use of labels was an indication of an underlying logical pattern, namely the simultaneous side-by-side manipulation of several kinds of logical information. It was clear that there was a need to establish the labelled deductive systems methodology. Modal logic is one major area where labelling can be developed quickly and sys tematically with a view of demonstrating its power and significant advantage. In modal logic the labels can play a double role."

This book is about stochastic Petri nets (SPNs), which have proven to be a popular tool for modelling and performance analysis of complex discrete-event stochastic systems. The focus is on methods for modelling a system as an SPN with general firing times and for studying the long-run behavior of the resulting SPN model using computer simulation. Modelling techniques are illustrated in the context of computer, manufacturing, telecommunication, workflow, and transportation systems. The simulation discussion centers on the theory that underlies estimation procedures such as the regenerative method, the method of batch means, and spectral methods.Tying these topics together are conditions on the building blocks of an SPN under which the net is stable over time and specified estimation procedures are valid. In addition, the book develops techniques for comparing the modelling power of different discrete-event formalisms. These techniques provide a means for making principled choices between alternative modelling frameworks and also can be used to extend stability results and limit theorems from one framework to another. As an overview of fundamental modelling, stability, convergence, and estimation issues for discrete-event systems, this book will be of interest to researchers and graduate students in Applied Mathematics, Operations Research, Applied Probability, and Statistics. This book also will be of interest to practitioners of Industrial, Computer, Transportation, and Electrical Engineering, because it provides an introduction to a powerful set of tools both for modelling and for simulation-based performance analysis. Peter J. Haas is a member of the Research Staff at the IBM Almaden Research Center in San Jose, California. He also teaches Computer Simulation at Stanford University and is an Associate Editor (Simulation Area) for Operations Research.

"Mathematics in Kant's Critical Philosophy" provides a much needed reading (and re-reading) of Kant's theory of the construction of mathematical concepts through a fully contextualized analysis. In this work Lisa Shabel convincingly argues that it is only through an understanding of the relevant eighteenth century mathematics textbooks, and the related mathematical practice, can the material and context necessary for a successful interpretation of Kant's philosophy be provided. This is borne out through sustained readings of Euclid and Woolf in particular, which, when brought together with Kant's work, allows for the elucidation of several key issues and the reinterpretation of many hitherto opaque and long debated passages.

Time is a fascinating subject and has long since captured mankind's imagination, from the ancients to modern man, both adult and child alike. It has been studied across a wide range of disciplines, from the natural sciences to philosophy and logic. Today, thirty plus years since Prior's work in laying out foundations for temporal logic, and two decades on from Pnueli's seminal work applying of temporal logic in specification and verification of computer programs, temporal logic has a strong and thriving international research community within the broad disciplines of computer science and artificial intelligence. Areas of activity include, but are certainly not restricted to: Pure Temporal Logic, e. g. temporal systems, proof theory, model theory, expressiveness and complexity issues, algebraic properties, application of game theory; Specification and Verification, e. g. of reactive systems, ofreal-time components, of user interaction, of hardware systems, techniques and tools for verification, execution and prototyping methods; Temporal Databases, e. g. temporal representation, temporal query ing, granularity of time, update mechanisms, active temporal data bases, hypothetical reasoning; Temporal Aspects in AI, e. g. modelling temporal phenomena, in terval temporal calculi, temporal nonmonotonicity, interaction of temporal reasoning with action/knowledge/belief logics, temporal planning; Tense and Aspect in Natural Language, e. g. models, ontologies, temporal quantifiers, connectives, prepositions, processing tempo ral statements; Temporal Theorem Proving, e. g. translation methods, clausal and non-clausal resolution, tableaux, automata-theoretic approaches, tools and practical systems."

This is a monograph about logic. Specifically, it presents the mathe matical theory of the logic of bunched implications, BI: I consider Bl's proof theory, model theory and computation theory. However, the mono graph is also about informatics in a sense which I explain. Specifically, it is about mathematical models of resources and logics for reasoning about resources. I begin with an introduction which presents my (background) view of logic from the point of view of informatics, paying particular attention to three logical topics which have arisen from the development of logic within informatics: * Resources as a basis for semantics; * Proof-search as a basis for reasoning; and * The theory of representation of object-logics in a meta-logic. The ensuing development represents a logical theory which draws upon the mathematical, philosophical and computational aspects of logic. Part I presents the logical theory of propositional BI, together with a computational interpretation. Part II presents a corresponding devel opment for predicate BI. In both parts, I develop proof-, model- and type-theoretic analyses. I also provide semantically-motivated compu tational perspectives, so beginning a mathematical theory of resources. I have not included any analysis, beyond conjecture, of properties such as decidability, finite models, games or complexity. I prefer to leave these matters to other occasions, perhaps in broader contexts.

Unique selling point: * Industry standard book for merchants, banks, and consulting firms looking to learn more about PCI DSS compliance. Core audience: * Retailers (both physical and electronic), firms who handle credit or debit cards (such as merchant banks and processors), and firms who deliver PCI DSS products and services. Place in the market: * Currently there are no PCI DSS 4.0 books

Domain theory is a rich interdisciplinary area at the intersection of logic, computer science, and mathematics. This volume contains selected papers presented at the International Symposium on Domain Theory which took place in Shanghai in October 1999. Topics of papers range from the encounters between topology and domain theory, sober spaces, Lawson topology, real number computability and continuous functionals to fuzzy modelling, logic programming, and pi-calculi. This book is a valuable reference for researchers and students interested in this rapidly developing area of theoretical computer science.

Per Martin-Loef'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-Loef 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-Loef's earliest papers.

hiS volume in the Synthese Library Series is the result of a conference T held at the University of Roskilde, Denmark, October 31st-November 1st, 1997. The aim was to provide a forum within which philosophers, math ematicians, logicians and historians of mathematics could exchange ideas pertaining to the historical and philosophical development of proof theory. Hence the conference was called Proof Theory: History and Philosophical Significance. To quote from the conference abstract: Proof theory was developed as part of Hilberts Programme. According to Hilberts Programme one could provide mathematics with a firm and se cure foundation by formalizing all of mathematics and subsequently prove consistency of these formal systems by finitistic means. Hence proof theory was developed as a formal tool through which this goal should be fulfilled. It is well known that Hilbert's Programme in its original form was unfeasible mainly due to Gtldel's incompleteness theorems. Additionally it proved impossible to formalize all of mathematics and impossible to even prove the consistency of relatively simple formalized fragments of mathematics by finitistic methods. In spite of these problems, Gentzen showed that by extending Hilbert's proof theory it would be possible to prove the consistency of interesting formal systems, perhaps not by finitis tic methods but still by methods of minimal strength. This generalization of Hilbert's original programme has fueled modern proof theory which is a rich part of mathematical logic with many significant implications for the philosophy of mathematics."

The forms and scope of logic rest on assumptions of how language and reasoning connect to experience. In this volume an analysis of meaning and truth provides a foundation for studying modern propositional and predicate logics. Chapters on propositional logic, parsing propositions, and meaning, truth and reference give a basis for criteria that can be used to judge formalizations of ordinary language arguments. Over 120 worked examples of formalizations of propositions and arguments illustrate the scope and limitations of modern logic, as analyzed in chapters on identity, quantifiers, descriptive names, functions, and second-order logic. The chapter on second-order logic illustrates how different conceptions of predicates and propositions do not lead to a common basis for quantification over predicates, as they do for quantification over things. Notable for its clarity of presentation, and supplemented by many exercises, this volume is suitable for philosophers, linguists, mathematicians, and computer scientists who wish to better understand the tools they use in formalizing reasoning.