The last twenty years have witnessed an accelerated development of pure and ap plied logic, particularly in response to the urgent needs of computer science. Many traditional logicians have developed interest in applications and in parallel a new generation of researchers in logic has arisen from the computer science community. A new attitude to applied logic has evolved, where researchers tailor a logic for their own use in the same way they define a computer language, and where auto mated deduction for the logic and its fragments is as important as the logic itself. In such a climate there is a need to emphasise algorithmic logic methodologies alongside any individual logics. Thus the tableaux method or the resolution method are as central to todays discipline of logic as classical logic or intuitionistic logic are. From this point of view, J. Goubault and I. Mackie's book on Proof Theory and Automated Deduction is most welcome. It covers major algorithmic methodolo gies as well as a variety of logical systems. It gives a wide overview for the ap plied consumer of logic while at the same time remains relatively elementary for the beginning student. A decade ago I put forward my view that a logical system should be presented as a point in a grid. One coordinate is its philosphy, motivation, its accepted theorems and its required non-theorems. The other coordinate is the algorithmic methodol ogy and execution chosen for its effective presentation. Together these two aspects constitute a 'logic'."

Lattice (Boolean) functions are algebraic functions defined over an arbitrary lattice (Boolean algebra), while lattice (Boolean) equations are equations expressed in terms of lattice (Boolean) functions.This self-contained monograph surveys recent developments of Boolean functions and equations, as well as lattice functions and equations in more general classes of lattices; a special attention is paid to consistency conditions and reproductive general solutions.The contents include:- equational compactness in semilattices and Boolean algebras;- the theory of Post functions and equations (which is very close to that of Boolean functions and equations);- a revision of Boolean fundamentals;- closure operators on Boolean functions;- the decomposition of Boolean functions;- quadratic truth equations;- Boolean differential calculus;- Boolean geometry and other topics.There is also a chapter on equations in a very general sense. Applications refer to graph theory, automata theory, synthesis of circuits, fault detection, databases, marketing and others.

One of the most striking development of the last decades in the study of minimal surfaces, constant mean surfaces and harmonic maps is the discovery that many classical problems in differential geometry - including these examples - are actually integrable systems. This theory grew up mainly after the important discovery of the properties of the Korteweg-de Vries equation in the sixties. After C. Gardner, J. Greene, M. Kruskal et R. Miura 44] showed that this equation could be solved using the inverse scattering method and P. Lax 62] reinterpreted this method by his famous equation, many other deep observations have been made during the seventies, mainly by the Russian and the Japanese schools. In particular this theory was shown to be strongly connected with methods from algebraic geom etry (S. Novikov, V. B. Matveev, LM. Krichever. . . ), loop techniques (M. Adler, B. Kostant, W. W. Symes, M. J. Ablowitz . . . ) and Grassmannian manifolds in Hilbert spaces (M. Sato . . . ). Approximatively during the same period, the twist or theory of R. Penrose, built independentely, was applied successfully by R. Penrose and R. S. Ward for constructing self-dual Yang-Mills connections and four-dimensional self-dual manifolds using complex geometry methods. Then in the eighties it became clear that all these methods share the same roots and that other instances of integrable systems should exist, in particular in differential ge ometry. This led K."

Modern logic is an active agent all across the university today, connecting disciplines, and transcending traditional boundaries. This book demonstrates this general role in the special setting of a conference at Tsinghua University, where modern logic was already taught in the 1930s by pioneers like Jin Yeulin. This boon contains an unusual dialogue between Chinese logicians and international colleagues representing a wide range of disciplines, including philosophy, mathematics, linguistics computer science, cognitive science, and the social sciences. The focus of this encounter is not only to advance logic in its university-wide role but also to look for its application in modern society.

This unified approach to the foundations of mathematics in the theory of sets covers both conventional and finitary (constructive) mathematics. It is based on a philosophical, historical and mathematical analysis of the relation between the concepts of "natural number" and "set". The book contains an investigation of the logic of quantification over the universe of sets and a discussion of its role in second order logic, and the analysis of proof by induction and definition by recursion. The book should appeal to both philosophers and mathematicians with an interest in the foundations of mathematics.

In The Moment of Proof, Benson attempts to convey to general readers the feeling of Eureka, the joy of discovery that mathematicians feel when they first encounter an elegant proof. The book is packed with intriguing puzzles: Loyd's Fifteen Puzzle, the Monty Hall Problem, the Prisoner's Dilemma, and more. Every fan of mathematical puzzles will be enthralled by this book.

This is the second volume in a series of well-respected works in temporal science and is by the same authors as the first. Volume one dealt primarily with basic concepts and methods, volume two discuses the more applicable aspects of temporal logics. The first four chapters continue the more theoretical presentations from volume one, covering automata, branching time and labelled deduction. The rest of the book is devoted to discussions of temporal databases, temporal execution and programming, actions and planning. With its inclusion of cutting-edge results and unifying methodologies, this book, and its companion are an indispensable reference for both the pure logician and the theoretical computer scientist.

Stewart Shapiro presents a distinctive original view of the foundations of mathematics, arguing that second-order logic has a central role to play in laying these foundations. He gives an accessible account of second-order and higher-order logic, paying special attention to philosophical and historical issues. Foundations without Foundationalism is a key contribution both to philosophy of mathematics and to mathematical logic.

'In this excellent treatise Shapiro defends the use of second-order languages and logic as frameworks for mathematics. His coverage of the wide range of logical and philosophical . . . is thorough, clear, and persuasive.' Michael D. Resnik, History and Philosophy of Logic

This is a classic introduction to set theory, suitable for students with no previous knowledge of the subject. Providing complete, up-to-date coverage, the book is based in large part on courses given over many years by Professor Hajnal. The first part introduces all the standard notions of the subject; the second part concentrates on combinatorial set theory. Exercises are included throughout and a new section of hints has been added to assist the reader.

Together, Models and Computability and its sister volume Sets and Proofs will provide readers with a comprehensive guide to the current state of mathematical logic. All the authors are leaders in their fields and are drawn from the invited speakers at 'Logic Colloquium '97' (the major international meeting of the Association of Symbolic Logic). It is expected that the breadth and timeliness of these two volumes will prove an invaluable and unique resource for specialists, post-graduate researchers, and the informed and interested nonspecialist.

This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory of certain topological spaces that have proved of use in the modeling of various families of typed lambda calculi considered as core programming languages and as meta-languages for denotational semantics. This theory is now known as Domain Theory, and was founded as a subject by Scott and Plotkin. One of the main concerns is to establish links between mathematical structures and more syntactic approaches to semantics, often referred to as operational semantics, which is also described. This dual approach has the double advantage of motivating computer scientists to do some mathematics and of interesting mathematicians in unfamiliar application areas from computer science.

Four goals of the book: Offer a tutorial on mathematical ideas which underlie our research Serve as a manual for users of the Nuprl system Give an overview of the project for those interested in applications of the results and for those inclined to basic research in the area Present research which has arisen as we have worked on the Nuprl system

The study of stable groups connects model theory, algebraic geometry and group theory. It analyzes groups that possess a certain general dependence relation and tries to derive structural properties from this. These may be group-theoretic (nilpotency or solubility of a given group), algebro-geometric (identification of a group as an algebraic group), or model-theoretic (description of the definable sets). In this book, the general theory of stable groups is developed from the beginning (including a chapter on preliminaries in group theory and model theory), concentrating on the model- and group-theoretic aspects. It brings together the various extensions of the original finite rank theory under a unified perspective and provides a coherent exposition of the current knowledge in the field.

This volume surveys recent interactions between model theory and other branches of mathematics, notably group theory. Beginning with an introductory chapter describing relevant background material, the book contains contributions from many leading international figures in this area. Topics described include automorphism groups of algebraically closed fields, the model theory of pseudo-finite fields and applications to the subgroup structure of finite Chevalley groups. Model theory of modules, and aspects of model theory of various classes of groups, including free groups, are also discussed. The book also contains the first comprehensive survey of finite covers. Many new proofs and simplifications of recent results are presented and the articles contain many open problems. This book will be a suitable guide for graduate students and a useful reference for researchers working in model theory and algebra.

This book gives an introduction to theories of computability from a mathematically sophisticated point of view. It treats not only 'the' theory of computability (created by Alan Turing and others in the 1930s), but also a variety of other theories (of Boolean functions, automata and formal languages). These are addressed from the classical perspective of their generation by grammars and from the modern perspective as rational cones. The treatment of the classical theory of computable functions and relations takes the form of a tour through basic recursive function theory, starting with an axiomatic foundation and developing the essential methods in order to survey the most memorable results of the field. This authoritative account by one of the leading lights of the subject will prove exceptionally useful reading for graduate students, and researchers in theoretical computer science and mathematics.

The publication of the seminal special issue on nonmonotonic logics by the Artificial Intelligence Journal in 1980 resulted in a new area of research in knowledge representation and changed the mainstream paradigm of logic that originated in antiquity. It led to discoveries of connections between logic, knowledge representation and computation, and attracted not only computer scientists but also logicians, mathematicians and philosophers. Nonmonotonic reasoning concerns situations when information is incomplete or uncertain. Thus, conclusions drawn lack iron-clad certainty that comes with classical logic reasoning. New information, even if the original one is retained, may change conclusions. Formal ways to capture mechanisms involved in nonmonotonic reasoning, and to exploit them for computation as in the answer set programming paradigm are at the heart of this research area. The conference NonMon@30 - Thirty Years of Nonmonotonic Reasoning, held in Lexington, KY, USA, October 22-25, 2010, aimed to sum up the experience of the first 30 years of nonmonotonic logics and to map paths into the future. It comprised eighteen invited talks and several technical presentations. The present volume consists of the texts based on twelve of the invited presentations. These papers offer unique insights into the key questions that have been driving the development of nonmonotonic reasoning and suggest problems worthy of consideration in the future. They paint the picture of the field that has a well-established tradition, and remains vibrant and relevant to long-term goals of artificial intelligence.

The automatic verification of large parts of mathematics has been an aim of many mathematicians from Leibniz to Hilbert. While Gödel's first incompleteness theorem showed that no computer program could automatically prove certain true theorems in mathematics, the advent of electronic computers and sophisticated software means in practice there are many quite effective systems for automated reasoning that can be used for checking mathematical proofs. This book describes the use of a computer program to check the proofs of several celebrated theorems in metamathematics including those of Gödel and Church-Rosser. The computer verification using the Boyer-Moore theorem prover yields precise and rigorous proofs of these difficult theorems. It also demonstrates the range and power of automated proof checking technology. The mechanization of metamathematics itself has important implications for automated reasoning, because metatheorems can be applied as labor-saving devices to simplify proof construction.

The theory of sets of multiples, a subject which lies at the intersection of analytic and probabilistic number theory, has seen much development since the publication of 'Sequences' by Halberstam and Roth nearly thirty years ago. The area is rich in problems, many of them still unsolved or arising from current work. The author sets out to give a coherent, essentially self-contained account of the existing theory and at the same time to bring the reader to the frontiers of research. One of the fascinations of the theory is the variety of methods applicable to it, which include Fourier analysis, group theory, high and ultra-low moments, probability and elementary inequalities, as well as several branches of number theory. This Tract is the first devoted to the subject, and will be of value to number theorists, whether they be research workers or graduate students.

This important book provides a new unifying methodology for logic. It replaces the traditional view of logic as manipulating sets of formulas by the notion of structured families of labelled formulas, the labels having algebraic structure. This simple device has far reaching consequences for the methodology of logics and their semantics. The book studies the main features of such systems as well as many applications. The framework of Labelled Deductive Systems is of interest to a large variety of readers. At one extreme there is the pure mathematical logician who likes exact formal definitions and dry theorems, who probably specializes in one logic and methodology. At the other extreme there is the practical consumer of logic, who likes to absorb the intutions and use labelling as needed to advance the cause of applications. The book begins with an intuitive presentation of LDS in the context of traditional current views of monotonic and nonmonotonic logics. It is less orientated towards the pure logician and more towards the practical consumer of logic. The main part of the book presents the formal theory of LDS for the formal logician. The author has tried to avoid the style of definition-lemma-theorem and has put in some explanation.

The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource.

This volume gives an overview of linear logic in five parts: category theory; complexity and expressivity; proof theory; proof nets; and the geometry of interaction. The book includes a general introduction to linear logic that will ensure this book's use by the novice as well as the expert. Mathematicians and computer scientists will learn much from this book.

This book, written by one of the most distinguished of contemporary philosophers of mathematics, is a fully rewritten and updated successor to the author's earlier The Unprovability of Consistency (1979). Its subject is the relation between provability and modal logic, a branch of logic invented by Aristotle but much disparaged by philosophers and virtually ignored by mathematicians. Here it receives its first scientific application since its invention.

This book covers elementary aspects of category theory and topos theory. It assumes little mathematical background, using categorical methods throughout rather than beginning with set theoretical foundations. It gives a clear exposition of key concepts and gives complete elementary proofs of theorems, including the fundamental theorem of toposes and the sheafification theorem. It ends with topos theoretic descriptions of sets, of basic differential geometry, and of recursive analysis. This book will be essential reading for third year undergraduates and graduates studying logics and category theory as part of a course on mathematics, computer science, or philosophy.

Techniques for reasoning about actions an change in the physical world is one of the classical research topics in artificial intelligence. It is motivated by the needs of autonomous robots which must be able to anticipate their immediate future, to plan their future actions, and to figure out what went wrong in case of problems. It is also motivated by the needs of common-sense reasoning for example in the understanding of natural language texts, where processes and change over time is an ever-present phenomenon. The same set of problems arises in several other areas of computing such as in conceptual modelling for data bases, and in the rapidly growing area of intelligent control. The present research monograph presents and uses a novel methodology for reasoning about actions and change. Traditional research contributions have proposed new logic variants which were only supported by episodical examples. THe work described here uses a systematic methodology for identifying the exact range of applicability of a given logic. For a number of previously proposed logics, as well as for some new ones, the present work characterizes exactly the class where it does not. This book will be a necessary source of reference for researchers in knowledge representation, cognitive robotics, and intelligent control in the years to come. Particularly because of its emphasis on a strict and systematic methodology, it can also be recommended as a textbook for graduate university courses in these areas.

Future Data and Knowledge Base Systems will require new functionalities: richer data modelling capabilities, more powerful query languages, and new concepts of query answers. Future query languages will include functionalities such as hypothetical reasoning, abductive reasoning, modal reasoning, and metareasoning, involving knowledge and belief. Intentional answers will lead to cooperative query answering in which the answer to a query takes into consideration user's expectations. Non-classical logic plays an important role in this book for the formalization of new queries and new answers. It is shown how logic permits precise definitions for concepts like cooperative answers, subjective queries, or reliable sources of information, and gives a precise framework for reasoning about these complex concepts. It is worth noting that advances in knowledge management are not just an application domain for existing results in logic, but also require new developments in logic. The book is organized into 10 chapters which cover the areas of cooperative query answering (in the first three chapters), metareasoning and abductive reasoning (chapters 5 to 7), and, finally, hypothetical and subjunctive reasoning (last three chapters).