01 - Introduction - Language Proof and Logic
01 - Introduction - Language Proof and Logic
2 / Introduction
laws of logic
science can be any more certain than its weakest link. If there is something arbitrary about logic, then the same must hold of all rational inquiry. Thus it becomes crucial to understand just what the laws of logic are, and even more important, why they are laws of logic. These are the questions that one takes up when one studies logic itself. To study logic is to use the methods of rational inquiry on rationality itself. Over the past century the study of logic has undergone rapid and important advances. Spurred on by logical problems in that most deductive of disciplines, mathematics, it developed into a discipline in its own right, with its own concepts, methods, techniques, and language. The Encyclopedia Brittanica lists logic as one of the seven main branches of knowledge. More recently, the study of logic has played a major role in the development of modern day computers and programming languages. Logic continues to play an important part in computer science; indeed, it has been said that computer science is just logic implemented in electrical engineering. This book is intended to introduce you to some of the most important concepts and tools of logic. Our goal is to provide detailed and systematic answers to the questions raised above. We want you to understand just how the laws of logic follow inevitably from the meanings of the expressions we use to make claims. Convention is crucial in giving meaning to a language, but once the meaning is established, the laws of logic follow inevitably. More particularly, we have two main aims. The rst is to help you learn a new language, the language of rst-order logic. The second is to help you learn about the notion of logical consequence, and about how one goes about establishing whether some claim is or is not a logical consequence of other accepted claims. While there is much more to logic than we can even hint at in this book, or than any one person could learn in a lifetime, we can at least cover these most basic of issues.
FOL
Introduction
these is pronounced efohel, not fall, and is the name we will use. Certain elements of fol go back to Aristotle, but the language as we know it today has emerged over the past hundred years. The names chiey associated with its development are those of Gottlob Frege, Giuseppe Peano, and Charles Sanders Peirce. In the late nineteenth century, these three logicians independently came up with the most important elements of the language, known as the quantiers. Since then, there has been a process of standardization and simplication, resulting in the language in its present form. Even so, there remain certain dialects of fol, diering mainly in the choice of the particular symbols used to express the basic notions of the language. We will use the dialect most common in mathematics, though we will also tell you about several other dialects along the way. Fol is used in dierent ways in dierent elds. In mathematics, it is used in an informal way quite extensively. The various connectives and quantiers nd their way into a great deal of mathematical discourse, both formal and informal, as in a classroom setting. Here you will often nd elements of fol interspersed with English or the mathematicians native language. If youve ever taken calculus you have probably seen such formulas as: > 0 > 0 . . . Here, the unusual, rotated letters are taken directly from the language fol. In philosophy, fol and enrichments of it are used in two dierent ways. As in mathematics, the notation of fol is used when absolute clarity, rigor, and lack of ambiguity are essential. But it is also used as a case study of making informal notions (like grammaticality, meaning, truth, and proof) precise and rigorous. The applications in linguistics stem from this use, since linguistics is concerned, in large part, with understanding some of these same informal notions. In articial intelligence, fol is also used in two ways. Some researchers take advantage of the simple structure of fol sentences to use it as a way to encode knowledge to be stored and used by a computer. Thinking is modeled by manipulations involving sentences of fol. The other use is as a precise specication language for stating axioms and proving results about articial agents. In computer science, fol has had an even more profound inuence. The very idea of an articial language that is precise yet rich enough to program computers was inspired by this language. In addition, all extant programming languages borrow some notions from one or another dialect of fol. Finally, there are so-called logic programming languages, like Prolog, whose programs are sequences of sentences in a certain dialect of fol. We will discuss the
4 / Introduction
articial languages
logical basis of Prolog a bit in Part III of this book. Fol serves as the prototypical example of what is known as an articial language. These are languages that were designed for special purposes, and are contrasted with so-called natural languages, languages like English and Greek that people actually speak. The design of articial languages within the symbolic sciences is an important activity, one that is based on the success of fol and its descendants. Even if you are not going to pursue logic or any of the symbolic sciences, the study of fol can be of real benet. That is why it is so widely taught. For one thing, learning fol is an easy way to demystify a lot of formal work. It will also teach you a great deal about your own language, and the laws of logic it supports. First, fol, while very simple, incorporates in a clean way some of the important features of human languages. This helps make these features much more transparent. Chief among these is the relationship between language and the world. But, second, as you learn to translate English sentences into fol you will also gain an appreciation of the great subtlety that resides in English, subtlety that cannot be captured in fol or similar languages, at least not yet. Finally, you will gain an awareness of the enormous ambiguity present in almost every English sentence, ambiguity which somehow does not prevent us from understanding each other in most situations.
logical consequence
Introduction
neither are the principles of logic. If your beliefs about a close friend logically imply that he would never spread rumors behind your back, but you nd that he has, then your beliefs need revision. Logical consequence is central, not only to the sciences, but to virtually every aspect of everyday life. One of our major concerns in this book is to examine this notion of logical consequence as it applies specically to the language fol. But in so doing, we will also learn a great deal about the relation of logical consequence in natural languages. Our main concern will be to learn how to recognize when a specic claim follows logically from others, and conversely, when it does not. This is an extremely valuable skill, even if you never have occasion to use fol again after taking this course. Much of our lives are spent trying to convince other people of things, or being convinced of things by other people, whether the issue is ination and unemployment, the kind of car to buy, or how to spend the evening. The ability to distinguish good reasoning from bad will help you recognize when your own reasoning could be strengthened, or when that of others should be rejected, despite supercial plausibility. It is not always obvious when one claim is a logical consequence of others, but powerful methods have been developed to address this problem, at least for fol. In this book, we will explore methods of proofhow we can prove that one claim is a logical consequence of anotherand also methods for showing that a claim is not a consequence of others. In addition to the language fol itself, these two methods, the method of proof and the method of counterexample, form the principal subject matter of this book.