New corrected printing of a well-established text on logic at the introductory level.

The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The authors not only provide a thorough description of the theory, but also detail its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory.

Originally published in 1938. This compact treatise is a complete treatment of Aristotle’s logic as containing negative terms. It begins with defining Aristotelian logic as a subject-predicate logic confining itself to the four forms of categorical proposition known as the A, E, I and O forms. It assigns conventional meanings to these categorical forms such that subalternation holds. It continues to discuss the development of the logic since the time of its founder and address traditional logic as it existed in the twentieth century. The primary consideration of the book is the inclusion of negative terms - obversion, contraposition etc. – within traditional logic by addressing three questions, of systematization, the rules, and the interpretation.

This book develops the theory of typed feature structures and provides a logical foundation for logic programming and constraint-based reasoning systems.

Quantum mechanics is said to be the most successful physical theory ever. It is, in fact, unique in its success when applied to concrete physical problems. On the other hand, however, it raises profound conceptual problems that are equally unprecedented. Quantum logic, the topic of this volume, can be described as an attempt to cast light on the puzzle of quantum mechanics from the point of view of logic. Since its inception in the famous 1936 paper by Birkhoff and von Neumann entitled, "The logic of quantum mechanics, quantum logic has undergone an enormous development. Various schools of thought and approaches have emerged, and there are a variety of technical results. The chapters of this volume constitute a comprehensive presentation of the main schools, approaches and results in the field of quantum logic. - Authored by eminent scholars in the field - Material presented is of recent origin representing the frontier of the subject - Provides the most comprehensive and varied discussion of Quantum Mechanics available

Discrete Structure, Logic, and Computability introduces the beginning computer science student to some of the fundamental ideas and techniques used by computer scientists today, focusing on discrete structures, logic, and computability. The emphasis is on the computational aspects, so that the reader can see how the concepts are actually used. Because of logic's fundamental importance to computer science, the topic is examined extensively in three phases that cover informal logic, the technique of inductive proof; and formal logic and its applications to computer science.