A First Course in Logic is an introduction to first-order logic suitable for first and second year mathematicians and computer scientists. There are three components to this course: propositional logic; Boolean algebras; and predicate/first-order, logic. Logic is the basis of proofs in mathematics - how do we know what we say is true? - and also of computer science - how do I know this program will do what I think it will? Surprisingly little mathematics is needed to learn and understand logic (this course doesn't involve any calculus). The real mathematical prerequisite is an ability to manipulate symbols: in other words, basic algebra. Anyone who can write programs should have this ability.

Inverse problems are concerned with determining causes for observed or desired effects. Problems of this type appear in many application fields both in science and in engineering. The mathematical modelling of inverse problems usually leads to ill-posed problems, i.e., problems where solutions need not exist, need not be unique or may depend discontinuously on the data. For this reason, numerical methods for solving inverse problems are especially difficult, special methods have to be developed which are known under the term "regularization methods." This volume contains twelve survey papers about solution methods for inverse and ill-posed problems and about their application to specific types of inverse problems, e.g., in scattering theory, in tomography and medical applications, in geophysics and in image processing. The papers have been written by leading experts in the field and provide an up-to-date account of solution methods for inverse problems.

"Deduction" is an efficient and elegant presentation of classical first-order logic. It presents a truth tree system based on the work of Jeffrey, as well as a natural deduction system inspired by that of Kalish and Montague. Both are very natural and easy to learn. The definition of a formula excludes free variables, and the deduction system uses "Show" lines; the combination allows rules to be stated very simply.

The book's main innovation is its final part, which contains chapters on extensions and revisions of classical logic: modal logic, many-valued logic, fuzzy logic, intuitionistic logic, counterfactuals, deontic logic, common-sense reasoning, and quantified modal logic. These have been areas of great logical and philosophical interest over the past 40 years, but few other textbooks treat them in any depth. "Deduction" makes these areas accessible to introductory students. All chapters have discussions of the underlying semantics and present both truth tree and deduction systems.

New features in this edition, in addition to truth tree systems for classical and nonclassical logics, include new and simpler rules for modal logic, deontic logic, and counterfactuals; discussions of many-valued, fuzzy, and intuitionistic logics; an introduction to common-sense reasoning (nonmonotonic logic); and extensively reworked problem sets, designed to lead students gradually from easier to more difficult problems. This new edition also features web-based programs that make use of the book's methods. Each program is set up to give students symbolization problems, give them hints, grade their work, and do problems for them.

The 1998Annual Conference of the EuropeanAssociation for Computer Science Logic, CSL'98, was held in Brno, Czech Republic, during August 24-28, 1998. CSL'98wasthe12thinaseriesofworkshopsandthe7thtobeheldasthe Annual Conference of the EACSL. The conference was organized at Masaryk University in Brno by the Faculty of Informatics in cooperation with universities in Aaachen, Caen, Haagen, Linz, Metz, Pisa, Szeged, Vienna, and other institutions. CSL'98 formed one part of a federated conferences event, the other part being MFCS'98, the 23rd Int- national Symposium on the Mathematical Foundations of Computer Science. This federated conferences event consisted of common plenary sessions, invited talks, several parallel technical programme tracks, a dozen satellite workshops organized in parallel, and tutorials. The Federated CSL/MFCS'98 Conferences event included 19 invited talks, four of them joint CSL/MFCS'98 talks (D. Harel, W. Maass, Y. Matiyasevic, and M. Yannakakis), four for CSL (P. Hajek, J. Mitchell, Th. Schwentick, and J. Tiuryn), and eleven for MFCS. Last but not least, two tutorials were organized by CSL on the day preceding the symposium on "Inference Rules in Fragments of Arithmetic" by Lev Beklemishev and on "Proofs, Types, and Safe Mobile Code" by Greg Morrisett. A total of 345 persons attended the Federated CSL/MFCS'98 Conference which was a great success. The program committee of CSL'98 selected 27 of 74 papers submitted for the conference.From the 27 papers selected for presentation,25 havebeen accepted, following the standard refereeeing procedure, for publication in the present p- ceedings. Three invited speakers submitted papers, that were likewise refereeed and accepted.

This volume contains the proceedings of the 20th International Conference on Application and Theory of Petri Nets. The aim of the Petri net conferences is to create a forum for the dissemination of the latest results in the application and theory of Petri nets. Typically there are some 150-200 participants and usually one third of these come from industry, while the rest are from universities and research institutions. The conferences and a number of other activitiesare co- dinatedbyasteering committeeformedby: G.Balbo (Italy), J. Billington(A- tralia), C. Girault (France), K. Jensen (Denmark), S. Kumagai (Japan), G. De Michelis (Italy), T. Murata (U.S.A.), C.A. Petri (Germany; honorary member) W. Reisig (Germany), G. Roucairol (France), G. Rozenberg (The Netherlands; chair), M. Silva (Spain). The 1999 Petri net conference took place in Williamsburg, Virginia, and was organized by the Department of Computer Science of The College of William and Mary, Williamsburg. This was the second time the conference had been organized in the United States. We received 45 submissions from 15 countries on 5 continents of which 21 accepted for presentation. The submitted papers were evaluated by a program committee with the following members: W. van der Aalst (The Netherlands), P. Azema (France), W. Brauer (Germany), S. Christensen (Denmark), A. Desrochers (U.S.A.), S. Donatelli (Italy; co-chair), C. Girault (France), L. Gomes (Portugal), J. Hillston (United Kingdom), E

This book constitutes the refereed proceedings of the 4th International Conference on Typed Lambda Calculi and Applications, TLCA'99, held in L'Aquila, Italy in April 1999. The 25 revised full papers presented were carefully reviewed and selected from a total of 50 submissions. Also included are two invited demonstrations. The volume reports research results on various aspects of typed lambda calculi. Among the topics addressed are noncommutative logics, type theory, algebraic data types, logical calculi, abstract data types, and subtyping.

Cellular Automata (CA), about to enter their fifties, are coming of age, seen by the breadth and quality of CA-related research carried out worldwide, as well as by the appearance of interesting applications to real world problems. The papers collected in this book, presented at ACRI 98 (Third Conference on Cellular Automata for Research and Industry -7-9 October 1998), further demonstrate the vitality of this line ofresearch. Until some years ago, a researcher interested in dynamical modelling of spatially of the partial extended systems had only one language at his disposal, namely that differential equations (PDE). These are wonderful tools to use when an analytical solution can be found or a perturbative approach can provide a good approximation of the observed phenomena. The use of digital computers has enormously expanded the explanatory and predictive power of partial differential equations by allowing one to treat cases which had been outside the scope of a "pen and pencil" approach. However, it has also opened up a way to new formalisms which are able to describe interesting phenomena and are, at the same time, well-suited for digital simulation.

Introduction Model theorists have often joked in recent years that the part of mathemat- ical logic known as "pure model theory" (or stability theory), as opposed to the older and more traditional "model theory applied to algebra" , turns out to have more and more to do with other subjects ofmathematics and to yield gen- uine applications to combinatorial geometry, differential algebra and algebraic geometry. We illustrate this by presenting the very striking application to diophantine geometry due to Ehud Hrushovski: using model theory, he has given the first proof valid in all characteristics of the "Mordell-Lang conjecture for function fields" (The Mordell-Lang conjecture for function fields, Journal AMS 9 (1996), 667-690). More recently he has also given a new (model theoretic) proof of the Manin-Mumford conjecture for semi-abelian varieties over a number field. His proofyields the first effective bound for the cardinality ofthe finite sets involved (The Manin-Mumford conjecture, preprint). There have been previous instances of applications of model theory to alge- bra or number theory, but these appl~cations had in common the feature that their proofs used a lot of algebra (or number theory) but only very basic tools and results from the model theory side: compactness, first-order definability, elementary equivalence...

Quantum Logic deals with the foundations of quantum mechanics and, related to it, the behaviour of finite, discrete deterministic systems. The quantum logical approach is particulalry suitable for the investigation and exclusion of certain hidden parameter models of quantum mechanics. Conversely, it can be used to embed quantum universes into classical ones. It is also highly relevant for the characterization of finite automation. This book has been written with a broad readership in mind. Great care has been given to the motivation of the concepts and to the explicit and detailed discussions of examples.

This book constitutes the refereed proceedings of the 5th Kurt G del Colloquium on Computational Logic and Proof Theory, KGC '97, held in Vienna, Austria, in August 1997.
The volume presents 20 revised full papers selected from 38 submitted papers. Also included are seven invited contributions by leading experts in the area. The book documents interdisciplinary work done in the area of computer science and mathematical logics by combining research on provability, analysis of proofs, proof search, and complexity.

This book constitutes the refereed proceedings of the 18th International Conference on the Application and Theory of Petri Nets, ICATPN'97, held in Toulouse, France, in June 1997.
The 22 revised full papers presented in the volume were selected from a total of 61 submissions; also included are three invited contributions. All relevant topics in the area are addressed. Besides a variety of Petri net classes, workflow management, telecommunication networking, constraint satisfaction, program semantics, concurrency, and temporal logic are among the topics addressed.

This book constitutes the refereed proceedings of the First International Joint Conference on Qualitative and Quantitative Practical Reasoning, ECSQARU-FAPR'97, held in Bad Honnef, Germany, in June 1997.
The volume presents 33 revised full papers carefully selected for inclusion in the book by the program committee as well as 12 invited contributions. Among the various aspects of human practical reasoning addressed in the papers are nonmonotonic logics, default reasoning, modal logics, belief function theory, Bayesian networks, fuzzy logic, possibility theory, inference algorithms, dynamic reasoning with partial models, and user modeling approaches.

This book constitutes the refereed proceedings of the 4th International Symposium on Logical Foundations of Computer Science, LFCS'97, held in Yaroslavl, Russia, in July 1997.
The volume presents 42 revised refereed papers carefully selected by the program committee. All current issues of computer science logic are addressed. There is a certain emphasis on reporting the progress achieved by scientists from various parts of the former Soviet Union; but there are also many other strong papers from the international research community.

This book constitutes the refereed proceedings of the Third Italian Conference on Algorithms and Complexity, CIAC'97, held in Rome, Italy in March 1997.
The 25 revised full papers included in the volume were carefully selected from a total of 74 submissions; also included is an invited paper and an invited abstract. All in all, the papers present an interesting snapshot of current research activities and recent results in theory and applications of sequential, distributed, and parallel algorithms, data structures, and computational complexity.

This book constitutes the refereed proceedings of the Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, held in Nancy, France, in April 1997.
The 24 revised full papers presented in the book were carefully selected from a total of 54 submissions. The book reports the main research advances achieved in the area of typed lambda calculi since the predecessor conference, held in 1995, and competently reflects the state of the art in the area.

Nonmonotonic logics were created as an abstraction of some types of common sense reasoning, analogous to the way classical logic serves to formalize ideal reasoning about mathematical objects. These logics are nonmonotonic in the sense that enlarging the set of axioms does not necessarily imply an enlargement of the set of formulas deducible from these axioms. Such situations arise naturally, for example, in the use of information of different degrees of reliability.
This book emphasizes basic concepts by outlining connections between different formalisms of nonmonotonic logic, and gives a coherent presentation of recent research results and reasoning techniques. It provides a self-contained state-of-the-art survey of the area addressing researchers in AI lo

This book constitutes the strictly refereed post-workshop proceedings of the First International Workshop on Implementing Automata, WIA'96, held in London, Ontario, Canada, in August 1996.
The volume presents 13 revised full papers together with an introduction and survey. The papers explore the use of software tools in formal language theory; various issues involved in the implementation of automata of all types are discussed. As the first book focusing on implementing automata, this collection of research papers defines the state of the art in the area. Generally speaking, the book advocates the practice of theory in computer science.

This is the first volume in a suite of short, inexpensive, paperbound volumes intended for student usage as textbooks, or course supplements, and for purchase as single-copy reference works for professionals in specific disciplines, and, in some cases, for interdisciplinary use. This title focuses on cellular automata simulations while using Mathematica, thus its audience is a generally broad one, although physicists, life scientists and engineers will find this title to be of particular interest.
Those familiar with Gaylord's previous book, coauthored with Paul Wellin, "Computer Simulations with Mathematica - Explorations in Complex Biological and Physical Systems," also published by TELOS, will find this new title to be an in-depth extension of some topics dealt with in that book. Modeling Nature: Cellular Automata Simulations with Mathematica, however, contains simulations not found in the Gaylord-Wellin volume. This book will have a DOS-diskette packaged with it, enabling cross-platform access to the code. These data files will also be made accessible online via the Internet at telospub.com FTP and WWW sites.

The purpose of this monograph is to develop a very general approach to the algebra ization of sententiallogics, to show its results on a number of particular logics, and to relate it to other existing approaches, namely to those based on logical matrices and the equational consequence developed by Blok, Czelakowski, Pigozzi and others. The main distinctive feature of our approachlies in the mathematical objects used as models of a sententiallogic: We use abstract logics, while the dassical approaches use logical matrices. Using models with more structure allows us to reflect in them the metalogical properties of the sentential logic. Since an abstract logic can be viewed as a "bundle" or family of matrices, one might think that the new models are essentially equivalent to the old ones; but we believe, after an overall appreciation of the work done in this area, that it is precisely the treatment of an abstract logic as a single object that gives rise to a useful -and beautiful- mathematical theory, able to explain the connections, not only at the logical Ievel but at the metalogical Ievel, between a sentential logic and the particular dass of models we associate with it, namely the dass of its full models. Traditionally logical matrices have been regarded as the most suitable notion of model in the algebraic studies of sentential logics; and indeed this notion gives sev eral completeness theorems and has generated an interesting mathematical theory."

This books presents the refereed proceedings of the Fifth International Workshop on Analytic Tableaux and Related Methods, TABLEAUX '96, held in Terrasini near Palermo, Italy, in May 1996.
The 18 full revised papers included together with two invited papers present state-of-the-art results in this dynamic area of research. Besides more traditional aspects of tableaux reasoning, the collection also contains several papers dealing with other approaches to automated reasoning. The spectrum of logics dealt with covers several nonclassical logics, including modal, intuitionistic, many-valued, temporal and linear logic.

Originally published in 1969. This book is for undergraduates whether specializing in philosophy or not. It assumes no previous knowledge of logic but aims to show how logical notions arise from, or are abstracted from, everyday discourse, whether technical or non-technical. It sets out a knowledge of principles and, while not historical, gives an account of the reasons for which modern systems have emerged from the traditional syllogistic logic, demonstrating how certain central ideas have developed. The text explains the connections between everyday reasoning and formal logic and works up to a brief sketch of systems of propositional calculus and predicate-calculus, using both the axiomatic method and the method of natural deduction. It provides a self-contained introduction but for those who intend to study the subject further it contains many suggestions and a sound basis for more advanced study.

This book constitutes the refereed proceedings of the 13th International Conference on Automated Deduction, CADE-13, held in July/August 1996 in New Brunswick, NJ, USA, as part of FLoC '96.
The volume presents 46 revised regular papers selected from a total of 114 submissions in this category; also included are 15 selected system descriptions and abstracts of two invited talks. The CADE conferences are the major forum for the presentation of new results in all aspects of automated deduction. Therefore, the volume is a timely report on the state-of-the-art in the area.

This book constitutes the refereed proceedings of the 17th International Conference on Application and Theory of Petri Nets, held in Osaka, Japan, in June 1996.
The 26 revised full papers included in the book together with three invited presentations were selected from a total of 78 submissions. The book addresses the current theoretical and applicational aspects of the various types of Petri Nets and competently reflects the state of the art in the area.

This book constitutes the proceedings of the 8th International Conference on Higher Order Logic Theorem Proving and Its Applications, held in Aspen Grove, Utah, USA in September 1995.
The 26 papers selected by the program committee for inclusion in this volume document the advances in the field achieved since the predecessor conference. The papers presented fall into three general categories: representation of formalisms in higher order logic; applications of mechanized higher order logic; and enhancements to the HOL and other theorem proving systems.

This book constitutes the proceedings of the 16th International Conference on Application and Theory of Petri Nets, held in Torino, Italy in June 1995
The 26 revised refereed papers presented were selected from 73 submissions from 22 countries; in addition there are abstracts or full papers of the three invited talks. All theoretical and applicational aspects are addressed by the contributors coming from industry and academia. This volume representatively documents the progress achieved in this application-oriented area of research and development since the predecessor conference held one year earlier.