The Handbook of Logic in Computer Science is a six-volume, internationally authored work which offers a comprehensive treatment of the application of logic to theoretical computer science. Each volume is comprised of an average of five 100-page monographs and presents an in-depth overview of one of the field's major topics. Current volume topics include mathematical and computational structures; forthcoming volumes will cover semantic structures, semantic modelling, theoretical methods in specification and verification, and logical methods in computer science. The result of five years of...

The Handbook of Logic in Computer Science is a multi-volume work covering all the major areas of the application of logic to theoretical computer science. It comprises six volumes, each containing five or six chapters giving an in-depth overview of one of the major topics in the field. The handbook is the result of many years of cooperative effort by eminent researchers in the area, and will no doubt be the standard reference work in logic and theoretical computer science for years to come. Volume 4: Semantic Modelling covers the fundamental topics of semantic modelling in logic and...

Logic is now widely recognized as one of the foundational disciplines of computing, and its applications reach almost every aspect of the subject, from software engineering and hardware to programming languages and AI. The Handbook of Logic in Computer Science is a multi-volume work covering all the major areas of application of logic to theoretical computer science. The handbook comprises six volumes, each containing five or six chapters giving an in-depth overview of one of the major topics in field. It is the result of many years of cooperative effort by some of the most eminent frontline...

Predicate transformation semantics is the best specification method for the development of correct and well-structured computer programs. This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction, and unbounded nondeterminacy. The author develops their theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with programming methodology. He gives proofs of the programming rules for partial and total correctness of...

The author presents a theory whereby nets, terms and formulas represent concurrent process at three levels of abstractions: Petri nets are used to describe all details of the operational machine behavior of processes. Algebraic process terms such as Calculus of Communicating Systems (CCS) or Communicating Sequential Processes (CSP) two of the main models for parallel programming, are used to describe the architecture of processes, i.e. how they can be composed from subprocesses. Logical formulas of a first-order trace logic are used to describe the safety and liveness aspects of the...

Classical logic has proved inadequate in various areas of computer science, artificial intelligence, mathematics, philosopy and linguistics. This is an introduction to extensions of first-order logic, based on the principle that many-sorted logic (MSL) provides a unifying framework in which to place, for example, second-order logic, type theory, modal and dynamic logics and MSL itself. The aim is two fold: only one theorem-prover is needed; proofs of the metaproperties of the different existing calculi can be avoided by borrowing them from MSL. To make the book accessible to readers from...

This book develops the theory of typed feature structures, a data structure that generalizes both first-order terms and feature structures of unification-based grammars to include inheritance, typing, inequality, cycles, and intensionality.

Logic and Computation is concerned with techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). Cambridge LCF is a computer program for reasoning about computation. It combines methods of mathematical logic with domain theory, the basis of the denotational approach to specifying the meaning of statements in a programming language. This book consists of two parts. Part I outlines the mathematical preliminaries: elementary logic and domain theory. They are explained at an intuitive level, giving references to more advanced reading....

Belief revision is a topic of much interest in theoretical computer science and logic, and it forms a central problem in research into artificial intelligence. In simple terms: how do you update a database of knowledge in the light of new information? What if the new information is in conflict with something that was previously held to be true? An intelligent system should be able to accommodate all such cases. This book contains a collection of research articles on belief revision that are completely up to date and an introductory chapter that presents a survey of current research in the...

This book discusses recent research in the theoretical foundations of several subjects of importance for the design of hardware, and for computer science in general. The physical technologies of very large scale integration (VLSI) are having major effects on the electronic industry. The potential diversity and complexity of digital systems have begun a revolution in the technologies of digital design, involving the application of concepts and methods to do with algorithms and programming. In return, the problems of VLSI design have led to new subjects becoming of importance in computer...