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 is about scientific theories of a particular kind - theories of mathematical physics. Examples of such theories are classical and relativis tic particle mechanics, classical electrodynamics, classical thermodynamics, statistical mechanics, hydrodynamics, and quantum mechanics. Roughly, these are theories in which a certain mathematical structure is employed to make statements about some fragment of the world. Most of the book is simply an elaboration of this rough characterization of theories of mathematical physics. It is argued that each theory of mathematical physics has associated with it a certain characteristic mathematical struc ture. This structure may be used in a variety of ways to make empirical claims about putative applications of the theory. Typically - though not necessarily - the way this structure is used in making such claims requires that certain elements in the structure play essentially different roles. Some playa "theoretical" role; others playa "non-theoretical" role. For example, in classical particle mechanics, mass and force playa theoretical role while position plays a non-theoretical role. Some attention is given to showing how this distinction can be drawn and describing precisely the way in which the theoretical and non-theoretical elements function in the claims of the theory. An attempt is made to say, rather precisely, what a theory of mathematical physics is and how you tell one such theory from anothe- what the identity conditions for these theories are.
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.
Well-Structured Mathematical Logic does for logic what Structured Programming did for computation: make large-scale work possible. From the work of George Boole onward, traditional logic was made to look like a form of symbolic algebra. In this work, the logic undergirding conventional mathematics resembles well-structured computer programs. A very important feature of the new system is that it structures the expression of mathematics in much the same way that people already do informally. In this way, the new system is simultaneously machine-parsable and user-friendly, just as Structured Programming is for algorithms. Unlike traditional logic, the new system works with you, not against you, as you use it to structure--and understand--the mathematics you work with on a daily basis. The book provides a complete guide to its subject matter. It presents the major results and theorems one needs to know in order to use the new system effectively. Two chapters provide tutorials for the reader in the new way that symbols move when logical calculations are performed in the well-structured system. Numerous examples and discussions are provided to illustrate the system's many results and features. Well-Structured Mathematical Logic is accessible to anyone who has at least some knowledge of traditional logic to serve as a foundation, and is of interest to all who need a system of pliant, user-friendly mathematical logic to use in their work in mathematics and computer science.
In mathematics, we know there are some concepts - objects, constructions, structures, proofs - that are more complex and difficult to describe than others. Computable structure theory quantifies and studies the complexity of mathematical structures, structures such as graphs, groups, and orderings. Written by a contemporary expert in the subject, this is the first full monograph on computable structure theory in 20 years. Aimed at graduate students and researchers in mathematical logic, it brings new results of the author together with many older results that were previously scattered across the literature and presents them all in a coherent framework, making it easier for the reader to learn the main results and techniques in the area for application in their own research. This volume focuses on countable structures whose complexity can be measured within arithmetic; a forthcoming second volume will study structures beyond arithmetic.
"English is so illogical!" It is generally believed that English is a language of exceptions. For many, learning to spell and read is frustrating. For some, it is impossible... especially for the 29% of Americans who are functionally illiterate. But what if the problem is not the language itself, but the rules we were taught? What if we could see the complexity of English as a powerful tool rather than a hindrance? --Denise Eide Uncovering the Logic of English challenges the notion that English is illogical by systematically explaining English spelling and answering questions like "Why is there a silent final E in have, large, and house?" and "Why is discussion spelled with -sion rather than -tion?" With easy-to-read examples and anecdotes, this book describes: - the phonograms and spelling rules which explain 98% of English words - how English words are formed and how this knowledge can revolutionize vocabulary development - how understanding the reasons behind English spelling prevents students from needing to guess The author's inspiring commentary makes a compelling case that understanding the logic of English could transform literacy education and help solve America's literacy crisis. Thorough and filled with the latest linguistic and reading research, Uncovering the Logic of English demonstrates why this systematic approach should be as foundational to our education as 1+1=2.