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.

Here is an introductory textbook which is designed to be useful not only to intending logicians but also to mathematicians in general. Based on Dr Hamilton's lectures to third and fourth year undergraduate mathematicians at the University of Stirling it has been written to introduce student or professional mathematicians, whose background need cover no more than a typical first year undergraduate mathematics course, to the techniques and principal results of mathematical logic. In presenting the subject matter without bias towards particular aspects, applications or developments, an attempt has been made to place it in the context of mathematics and to emphasise the relevance of logic to the mathematician. Starting at an elementart level, the text progresses from informal discussion to the precise description and use of formal mathematical and logical systems. The early chapters cover propositional and predicate calculus. The later chapters deal with Goedel's theorem on the incompleteness of arithmetic and with various undecidability and unsolvability results, including a discussion of Turing machines and abstract computability. Each section ends with exercises designed to clarify and consolidate the material in that section. Hints or solutions to many of these are provided at the end of the book. The revision of this very successful textbook includes new sections on Skolemisation and applying well-formed formulas to logic programming. Some corrections have been made and extra exercises added.

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

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.

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.

In recent years the interplay between model theory and other branches of mathematics has led to many deep and intriguing results. In this, the first book on the topic, the theme is the interplay between model theory and the theory of modules. The book is intended to be a self-contained introduction to the subject and introduces the requisite model theory and module theory as it is needed. Dr Prest develops the basic ideas concerning what can be said about modules using the information which may be expressed in a first-order language. Later chapters discuss stability-theoretic aspects of modules, and structure and classification theorems over various types of rings and for certain classes of modules. Both algebraists and logicians will enjoy this account of an area in which algebra and model theory interact in a significant way. The book includes numerous examples and exercises and consequently will make an ideal introduction for graduate students coming to this subject for the first time.

Cryptology: Classical and Modern, Second Edition proficiently introduces readers to the fascinating field of cryptology. The book covers classical methods including substitution, transposition, Alberti, Vigenere, and Hill ciphers. It also includes coverage of the Enigma machine, Turing bombe, and Navajo code. Additionally, the book presents modern methods like RSA, ElGamal, and stream ciphers, as well as the Diffie-Hellman key exchange and Advanced Encryption Standard. When possible, the book details methods for breaking both classical and modern methods. The new edition expands upon the material from the first edition which was oriented for students in non-technical fields. At the same time, the second edition supplements this material with new content that serves students in more technical fields as well. Thus, the second edition can be fully utilized by both technical and non-technical students at all levels of study. The authors include a wealth of material for a one-semester cryptology course, and research exercises that can be used for supplemental projects. Hints and answers to selected exercises are found at the end of the book. Features: Requires no prior programming knowledge or background in college-level mathematics Illustrates the importance of cryptology in cultural and historical contexts, including the Enigma machine, Turing bombe, and Navajo code Gives straightforward explanations of the Advanced Encryption Standard, public-key ciphers, and message authentication Describes the implementation and cryptanalysis of classical ciphers, such as substitution, transposition, shift, affine, Alberti, Vigenere, and Hill

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.

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 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.

In this 1987 text Professor Jech gives a unified treatment of the various forcing methods used in set theory, and presents their important applications. Product forcing, iterated forcing and proper forcing have proved powerful tools when studying the foundations of mathematics, for instance in consistency proofs. The book is based on graduate courses though some results are also included, making the book attractive to set theorists and logicians.

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 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.

Logic is one of the most popular approaches to artificial intelligence. A potential obstacle to the use of logic is its high computational complexity, as logical inference is an extraordinarily powerful computational device.
This book is concerned with computational aspects of the logical approach to AI. The focus is on two strategies for achieving computational tractability in knowledge representation and reasoning by language restriction and approximation. Several formalisms for knowledge representation are taken into account; among the computational problems studied are checking satisfiability and entailment of formulae, finding a model, and approximating and compiling a logical for

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.

This volume constitutes the proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods, TABLEAU '95, held at Schloss Rheinfels, St. Goar, Germany in May 1995.
Originally tableau calculi and their relatives were favored primarily as a pedagogical device because of their advantages at the presentation level. The 23 full revised papers in this book bear witness that these methods have now gained fundamental importance in theorem proving, particularly as competitors for resolution methods. The book is organized in sections on extensions, modal logic, intuitionistic logic, the connection method and model elimination, non-clausal proof procedures, linear logic, higher-order logic, and applications"

This volume presents the proceedings of the Second International Conference on Typed Lambda Calculi and Applications, held in Edinburgh, UK in April 1995.
The book contains 29 full revised papers selected from 58 submissions and comprehensively reports the state of the art in the field. The following topics are addressed: proof theory of type systems, logic and type systems, typed lambda calculi as models of (higher-order) computation, semantics of type systems, proof verification via type systems, type systems of programming languages, and typed term rewriting systems.

This volume presents the thoroughly revised proceedings of the IJCAI '93 Workshop on Executable Modal and Temporal Logics held in Chambery, France in August 1993.
The direct execution of logical statements, through languages such as PROLOG, has proved remarkably successful within CS and AI. In recent years a variety of nonclassical logics have been introduced and several executable forms of these logics have been applied to programming.
This volume addresses a range of approaches to executable modal and temporal logics, not only from a logical point of view, but also from programming language and application standpoints; in addition, an introductory survey and an annotated bibliography are presented.

The book is a fairly complete and up-to-date survey of projectivity and its generalizations in the class of Boolean algebras. Although algebra adds its own methods and questions, many of the results presented were first proved by topologists in the more general setting of (not necessarily zero-dimensional) compact spaces.
An appendix demonstrates the application of advanced set-theoretic methods to the field.
The intended readers are Boolean and universal algebraists. The book will also be useful for general topologists wanting to learn about kappa-metrizable spaces and related classes. The text is practically self-contained but assumes experience with the basic concepts and techniques of Boolean algebras.