DOCSLIB.ORG

Deduction (I) Tautologies, Contradictions And

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Deduction (I) Tautologies, Contradictions And D (I) T, & L L October , Tautologies, contradictions and contingencies Consider the truth table of the following formula: p (p ∨ p) () If you look at the final column, you will notice that the truth value of the whole formula depends on the way a truth value is assigned to p: the whole formula is true if p is true and false if p is false. Contrast the truth table of (p ∨ p) in () with the truth table of (p ∨ ¬p) below: p ¬p (p ∨ ¬p) () If you look at the final column, you will notice that the truth value of the whole formula does not depend on the way a truth value is assigned to p. The formula is always true because of the meaning of the connectives. Finally, consider the truth table table of (p ∧ ¬p): p ¬p (p ∧ ¬p) () This time the formula is always false no matter what truth value p has. Tautology A statement is called a tautology if the final column in its truth table contains only ’s. Contradiction A statement is called a contradiction if the final column in its truth table contains only ’s. Contingency A statement is called a contingency or contingent if the final column in its truth table contains both ’s and ’s. Let’s consider some examples from the book. Can you figure out which of the following sentences are tautologies, which are contradictions and which contingencies? Hint: the answer is the same for all the formulas with a single row. () a. (p ∨ ¬p), (p → p), (p → (q → p)), ¬(p ∧ ¬p) b. ¬(p ∨ ¬p), (p ∧ ¬p) c. p, ((p → q) → p) Substitutions salva veritate The truth value of any tautology or contradiction does not depend on the truth value of its atomic statements. It follows that we can freely substitute for the atomic statements of any tautology or contradiction without affecting the truth value of the whole. If we substitute (q → r) for p in (p ∨ ¬p), we still have a tautology: q r (q → r) ¬(q → r) ((q → r) ∨ ¬(q → r)) () A sometimes quick way to tell whether a given statement is a tautology: try to construct a line in a truth table whose final value is . This is an application of a general reasoning strategy called reductio ad absurdum (Latin for “re- duced to an absurdity”). A proof by reductio consists on deriving a contradictory result from a given assumption and concluding that, since the assumption led to such a result, it has to be wrong. The method works quite well with complicated statements. Consider, for instance the following one: () ((p → (q → p)) We can prove it is a tautology. Here’s how. Assume ((p → (q → p)) is not a tautology. . Then some rows in its truth-table must end in s. Given the truth table of “→”, that means that in such a row, p has to be true and (q → p) false. Given the truth table of the implication, that means that in such a row q is true and p is false. But then we have concluded that p is true and false in some row! . Since p can’t be both true and false in the same row, we conclude that the assumption that ((p → (q → p)) is not a tautology must be wrong. ∴ It must be a tautology. Logical equivalence, logical consequence and laws . Logical equivalence Two statements are logically equivalent if they have the same truth-values for all possible values for their atomic statements. Here’s an example. ¬(p ∨ q) is logically equivalent to (¬p ∧ ¬q), as you can see in the following truth-tables: p q ¬p ¬q ¬(p ∨ q) () p q ¬p ¬q (¬p ∧ ¬q) () If we connect two logically equivalent statements by means of a biconditional, we end up with a tautology: p q ¬p ¬q ¬(p ∨ q) (¬p ∧ ¬q) ¬(p ∨ q) ↔ (¬p ∧ ¬q) () Logically equivalent statements can freely replace one another in any statement without affecting its truth value. It is customary to write “P ⇔ Q” to denote logical equivalence between any two statements P, Q. Logical consequence A statement Q is a logical consequence of a statement P if whenever the final row of P’s truth-table has a , the final row of Q’s truth table also has a . Here’s an example:q is a logical consequence of ((p ∨ q) ∧ ¬p) p ¬p q (p ∨ q) ((p ∨ q) ∧ ¬p) () If Q is a logical consequence of P, then “P → Q” is a tautology: p ¬p q (p ∨ q) ((p ∨ q) ∧ ¬p) (((p ∨ q) ∧ ¬p)) → q () It is customary to write “P ⇒ Q” to say that Q is a logical consequence of P. Logical equivalence preserves truth and falsity. Logical consequence preserves truth but not falsity. If the antecedent if a tautologous conditional is true, then the consequent must also be true, but if the antecedent is false, the consequent may be either true or false. We have said that if P is logically equivalent to Q, then they can be freely substituted in any statement without affecting its truth value. But if Q is a logical consequence of P, we cannot in general substitute Q for P in a larger formula without affecting its truth value. We can verify that (p ∧ ¬p) ⇒ p, but let’s convince ourselves that we cannot substitute p for (p ∧ ¬p) in ((p ∧ ¬p) → q) without affecting its truth value. Laws of statement logic It is handy to have a small number of logical equivalences from which all others can be derived. The book (page ) lists some. It is possible to verify them. Consider, for instance the following equivalence: () (p → q) ⇔ (¬p ∨ q) If the statements (p → q) and (¬p∨q) are logically equivalent, the statement (p → q) ↔ (¬p∨q) should be a tautology. Let’s check that out. Since logically equivalent statements can be substituted for each other salva veritate, we can use the laws of statement logic to transform a complex statement into a simpler one. Here’s an example from the book: () . (p → (¬q ∨ p)) . (¬p ∨ (¬q ∨ p)) (Conditional Law) . ((¬q ∨ p) ∨ ¬p))(Commutative Law) . (¬q ∨ (p ∨ ¬p)) (Associative Law) . ¬q ∨ T (Complement Law) . T (Identity Law) Substitution of logical equivalents statements can be carried out without affecting the truth value of the formula containing them. The principle is sometimes called the Rule of Substitution. .
Load more

Recommended publications
  • Chapter 5: Methods of Proof for Boolean Logic
    Chapter 5: Methods of Proof for Boolean Logic § 5.1 Valid inference steps Conjunction elimination Sometimes called simplification. From a conjunction, infer any of the conjuncts. • From P ∧ Q, infer P (or infer Q). Conjunction introduction Sometimes called conjunction. From a pair of sentences, infer their conjunction. • From P and Q, infer P ∧ Q. § 5.2 Proof by cases This is another valid inference step (it will form the rule of disjunction elimination in our formal deductive system and in Fitch), but it is also a powerful proof strategy. In a proof by cases, one begins with a disjunction (as a premise, or as an intermediate conclusion already proved). One then shows that a certain consequence may be deduced from each of the disjuncts taken separately. One concludes that that same sentence is a consequence of the entire disjunction. • From P ∨ Q, and from the fact that S follows from P and S also follows from Q, infer S. The general proof strategy looks like this: if you have a disjunction, then you know that at least one of the disjuncts is true—you just don’t know which one. So you consider the individual “cases” (i.e., disjuncts), one at a time. You assume the first disjunct, and then derive your conclusion from it. You repeat this process for each disjunct. So it doesn’t matter which disjunct is true—you get the same conclusion in any case. Hence you may infer that it follows from the entire disjunction. In practice, this method of proof requires the use of “subproofs”—we will take these up in the next chapter when we look at formal proofs.
    [Show full text]
  • In Defence of Constructive Empiricism: Metaphysics Versus Science
    To appear in Journal for General Philosophy of Science (2004) In Defence of Constructive Empiricism: Metaphysics versus Science F.A. Muller Institute for the History and Philosophy of Science and Mathematics Utrecht University, P.O. Box 80.000 3508 TA Utrecht, The Netherlands E-mail: [email protected] August 2003 Summary Over the past years, in books and journals (this journal included), N. Maxwell launched a ferocious attack on B.C. van Fraassen's view of science called Con- structive Empiricism (CE). This attack has been totally ignored. Must we con- clude from this silence that no defence is possible against the attack and that a fortiori Maxwell has buried CE once and for all, or is the attack too obviously flawed as not to merit exposure? We believe that neither is the case and hope that a careful dissection of Maxwell's reasoning will make this clear. This dis- section includes an analysis of Maxwell's `aberrance-argument' (omnipresent in his many writings) for the contentious claim that science implicitly and per- manently accepts a substantial, metaphysical thesis about the universe. This claim generally has been ignored too, for more than a quarter of a century. Our con- clusions will be that, first, Maxwell's attacks on CE can be beaten off; secondly, his `aberrance-arguments' do not establish what Maxwell believes they estab- lish; but, thirdly, we can draw a number of valuable lessons from these attacks about the nature of science and of the libertarian nature of CE. Table of Contents on other side −! Contents 1 Exordium: What is Maxwell's Argument? 1 2 Does Science Implicitly Accept Metaphysics? 3 2.1 Aberrant Theories .
    [Show full text]
  • Boolean Satisfiability Solvers: Techniques and Extensions
    Boolean Satisfiability Solvers: Techniques and Extensions Georg WEISSENBACHER a and Sharad MALIK a a Princeton University Abstract. Contemporary satisfiability solvers are the corner-stone of many suc- cessful applications in domains such as automated verification and artificial intelli- gence. The impressive advances of SAT solvers, achieved by clever engineering and sophisticated algorithms, enable us to tackle Boolean Satisfiability (SAT) problem instances with millions of variables – which was previously conceived as a hope- less problem. We provide an introduction to contemporary SAT-solving algorithms, covering the fundamental techniques that made this revolution possible. Further, we present a number of extensions of the SAT problem, such as the enumeration of all satisfying assignments (ALL-SAT) and determining the maximum number of clauses that can be satisfied by an assignment (MAX-SAT). We demonstrate how SAT solvers can be leveraged to solve these problems. We conclude the chapter with an overview of applications of SAT solvers and their extensions in automated verification. Keywords. Satisfiability solving, Propositional logic, Automated decision procedures 1. Introduction Boolean Satisfibility (SAT) is the problem of checking if a propositional logic formula can ever evaluate to true. This problem has long enjoyed a special status in computer science. On the theoretical side, it was the first problem to be classified as being NP- complete. NP-complete problems are notorious for being hard to solve; in particular, in the worst case, the computation time of any known solution for a problem in this class increases exponentially with the size of the problem instance. On the practical side, SAT manifests itself in several important application domains such as the design and verification of hardware and software systems, as well as applications in artificial intelligence.
    [Show full text]
  • Leibniz's Ontological Proof of the Existence of God and the Problem Of
    Leibniz’s Ontological Proof of the Existence of God and the Problem of »Impossible Objects« Wolfgang Lenzen (Osnabrück) Abstract The core idea of the ontological proof is to show that the concept of existence is somehow contained in the concept of God, and that therefore God’s existence can be logically derived – without any further assumptions about the external world – from the very idea, or definition, of God. Now, G.W. Leibniz has argued repeatedly that the traditional versions of the ontological proof are not fully conclusive, because they rest on the tacit assumption that the concept of God is possible, i.e. free from contradiction. A complete proof will rather have to consist of two parts. First, a proof of premise (1) God is possible. Second, a demonstration of the “remarkable proposition” (2) If God is possible, then God exists. The present contribution investigates an interesting paper in which Leibniz tries to prove proposition (2). It will be argued that the underlying idea of God as a necessary being has to be interpreted with the help of a distinguished predicate letter ‘E’ (denoting the concept of existence) as follows: (3) g =df ιxE(x). Principle (2) which Leibniz considered as “the best fruit of the entire logic” can then be formalized as follows: (4) ◊E(ιxE(x)) → E(ιxE(x)). At first sight, Leibniz’s proof appears to be formally correct; but a closer examination reveals an ambiguity in his use of the modal notions. According to (4), the possibility of the necessary being has to be understood in the sense of something which possibly exists.
    [Show full text]
  • Contrastive Empiricism
    Elliott Sober Contrastive Empiricism I Despite what Hegel may have said, syntheses have not been very successful in philosophical theorizing. Typically, what happens when you combine a thesis and an antithesis is that you get a mishmash, or maybe just a contradiction. For example, in the philosophy of mathematics, formalism says that mathematical truths are true in virtue of the way we manipulate symbols. Mathematical Platonism, on the other hand, holds that mathematical statements are made true by abstract objects that exist outside of space and time. What would a synthesis of these positions look like? Marks on paper are one thing, Platonic forms an­ other. Compromise may be a good idea in politics, but it looks like a bad one in philosophy. With some trepidation, I propose in this paper to go against this sound advice. Realism and empiricism have always been contradictory tendencies in the philos­ ophy of science. The view I will sketch is a synthesis, which I call Contrastive Empiricism. Realism and empiricism are incompatible, so a synthesis that merely conjoined them would be a contradiction. Rather, I propose to isolate important elements in each and show that they combine harmoniously. I will leave behind what I regard as confusions and excesses. The result, I hope, will be neither con­ tradiction nor mishmash. II Empiricism is fundamentally a thesis about experience. It has two parts. First, there is the idea that experience is necessary. Second, there is the thesis that ex­ perience suffices. Necessary and sufficient for what? Usually this blank is filled in with something like: knowledge of the world outside the mind.
    [Show full text]
  • Sets, Propositional Logic, Predicates, and Quantifiers
    COMP 182 Algorithmic Thinking Sets, Propositional Logic, Luay Nakhleh Computer Science Predicates, and Quantifiers Rice University !1 Reading Material ❖ Chapter 1, Sections 1, 4, 5 ❖ Chapter 2, Sections 1, 2 !2 ❖ Mathematics is about statements that are either true or false. ❖ Such statements are called propositions. ❖ We use logic to describe them, and proof techniques to prove whether they are true or false. !3 Propositions ❖ 5>7 ❖ The square root of 2 is irrational. ❖ A graph is bipartite if and only if it doesn’t have a cycle of odd length. ❖ For n>1, the sum of the numbers 1,2,3,…,n is n2. !4 Propositions? ❖ E=mc2 ❖ The sun rises from the East every day. ❖ All species on Earth evolved from a common ancestor. ❖ God does not exist. ❖ Everyone eventually dies. !5 ❖ And some of you might already be wondering: “If I wanted to study mathematics, I would have majored in Math. I came here to study computer science.” !6 ❖ Computer Science is mathematics, but we almost exclusively focus on aspects of mathematics that relate to computation (that can be implemented in software and/or hardware). !7 ❖Logic is the language of computer science and, mathematics is the computer scientist’s most essential toolbox. !8 Examples of “CS-relevant” Math ❖ Algorithm A correctly solves problem P. ❖ Algorithm A has a worst-case running time of O(n3). ❖ Problem P has no solution. ❖ Using comparison between two elements as the basic operation, we cannot sort a list of n elements in less than O(n log n) time. ❖ Problem A is NP-Complete.
    [Show full text]
  • On Axiomatizations of General Many-Valued Propositional Calculi
    On axiomatizations of general many-valued propositional calculi Arto Salomaa Turku Centre for Computer Science Joukahaisenkatu 3{5 B, 20520 Turku, Finland asalomaa@utu.fi Abstract We present a general setup for many-valued propositional logics, and compare truth-table and axiomatic stipulations within this setup. Results are obtained concerning cases, where a finitary axiomatization is (resp. is not) possible. Related problems and examples are discussed. 1 Introduction Many-valued systems of logic are constructed by introducing one or more truth- values between truth and falsity. Truth-functions associated with the logical connectives then operate with more than two truth-values. For instance, the truth-function D associated with the 3-valued disjunction might be defined for the truth-values T;I;F (true, intermediate, false) by D(x; y) = max(x; y); where T > I > F: If the truth-function N associated with negation is defined by N(T ) = F; N(F ) = T;N(I) = I; the law of the excluded middle is not valid, provided \validity" means that the truth-value t results for all assignments of values for the variables. On the other hand, many-valuedness is not so obvious if the axiomatic method is used. As such, an ordinary axiomatization is not many-valued. Truth-tables are essential for the latter. However, in many cases it is possi- ble to axiomatize many-valued logics and, conversely, find many-valued models for axiom systems. In this paper, we will investigate (for propositional log- ics) interconnections between such \truth-value stipulations" and \axiomatic stipulations". A brief outline of the contents of this paper follows.
    [Show full text]
  • Mathematical Logic Part One
    Mathematical Logic Part One An Important Question How do we formalize the logic we've been using in our proofs? Where We're Going ● Propositional Logic (Today) ● Basic logical connectives. ● Truth tables. ● Logical equivalences. ● First-Order Logic (Today/Friday) ● Reasoning about properties of multiple objects. Propositional Logic A proposition is a statement that is, by itself, either true or false. Some Sample Propositions ● Puppies are cuter than kittens. ● Kittens are cuter than puppies. ● Usain Bolt can outrun everyone in this room. ● CS103 is useful for cocktail parties. ● This is the last entry on this list. More Propositions ● I came in like a wrecking ball. ● I am a champion. ● You're going to hear me roar. ● We all just entertainers. Things That Aren't Propositions CommandsCommands cannotcannot bebe truetrue oror false.false. Things That Aren't Propositions QuestionsQuestions cannotcannot bebe truetrue oror false.false. Things That Aren't Propositions TheThe firstfirst halfhalf isis aa validvalid proposition.proposition. I am the walrus, goo goo g'joob JibberishJibberish cannotcannot bebe truetrue oror false. false. Propositional Logic ● Propositional logic is a mathematical system for reasoning about propositions and how they relate to one another. ● Every statement in propositional logic consists of propositional variables combined via logical connectives. ● Each variable represents some proposition, such as “You liked it” or “You should have put a ring on it.” ● Connectives encode how propositions are related, such as “If you liked it, then you should have put a ring on it.” Propositional Variables ● Each proposition will be represented by a propositional variable. ● Propositional variables are usually represented as lower-case letters, such as p, q, r, s, etc.
    [Show full text]
  • Solving the Boolean Satisfiability Problem Using the Parallel Paradigm Jury Composition
    Philosophæ doctor thesis Hoessen Benoît Solving the Boolean Satisfiability problem using the parallel paradigm Jury composition: PhD director Audemard Gilles Professor at Universit´ed'Artois PhD co-director Jabbour Sa¨ıd Assistant Professor at Universit´ed'Artois PhD co-director Piette C´edric Assistant Professor at Universit´ed'Artois Examiner Simon Laurent Professor at University of Bordeaux Examiner Dequen Gilles Professor at University of Picardie Jules Vernes Katsirelos George Charg´ede recherche at Institut national de la recherche agronomique, Toulouse Abstract This thesis presents different technique to solve the Boolean satisfiability problem using parallel and distributed architec- tures. In order to provide a complete explanation, a careful presentation of the CDCL algorithm is made, followed by the state of the art in this domain. Once presented, two proposi- tions are made. The first one is an improvement on a portfo- lio algorithm, allowing to exchange more data without loosing efficiency. The second is a complete library with its API al- lowing to easily create distributed SAT solver. Keywords: SAT, parallelism, distributed, solver, logic R´esum´e Cette th`ese pr´esente diff´erentes techniques permettant de r´esoudre le probl`eme de satisfaction de formule bool´eenes utilisant le parall´elismeet du calcul distribu´e. Dans le but de fournir une explication la plus compl`ete possible, une pr´esentation d´etaill´ee de l'algorithme CDCL est effectu´ee, suivi d'un ´etatde l'art. De ce point de d´epart,deux pistes sont explor´ees. La premi`ereest une am´eliorationd'un algorithme de type portfolio, permettant d'´echanger plus d'informations sans perte d’efficacit´e.
    [Show full text]
  • 12 Propositional Logic
    CHAPTER 12 ✦ ✦ ✦ ✦ Propositional Logic In this chapter, we introduce propositional logic, an algebra whose original purpose, dating back to Aristotle, was to model reasoning. In more recent times, this algebra, like many algebras, has proved useful as a design tool. For example, Chapter 13 shows how propositional logic can be used in computer circuit design. A third use of logic is as a data model for programming languages and systems, such as the language Prolog. Many systems for reasoning by computer, including theorem provers, program verifiers, and applications in the field of artificial intelligence, have been implemented in logic-based programming languages. These languages generally use “predicate logic,” a more powerful form of logic that extends the capabilities of propositional logic. We shall meet predicate logic in Chapter 14. ✦ ✦ ✦ ✦ 12.1 What This Chapter Is About Section 12.2 gives an intuitive explanation of what propositional logic is, and why it is useful. The next section, 12,3, introduces an algebra for logical expressions with Boolean-valued operands and with logical operators such as AND, OR, and NOT that Boolean algebra operate on Boolean (true/false) values. This algebra is often called Boolean algebra after George Boole, the logician who first framed logic as an algebra. We then learn the following ideas. ✦ Truth tables are a useful way to represent the meaning of an expression in logic (Section 12.4). ✦ We can convert a truth table to a logical expression for the same logical function (Section 12.5). ✦ The Karnaugh map is a useful tabular technique for simplifying logical expres- sions (Section 12.6).
    [Show full text]
  • Logic, Proofs
    CHAPTER 1 Logic, Proofs 1.1. Propositions A proposition is a declarative sentence that is either true or false (but not both). For instance, the following are propositions: “Paris is in France” (true), “London is in Denmark” (false), “2 < 4” (true), “4 = 7 (false)”. However the following are not propositions: “what is your name?” (this is a question), “do your homework” (this is a command), “this sentence is false” (neither true nor false), “x is an even number” (it depends on what x represents), “Socrates” (it is not even a sentence). The truth or falsehood of a proposition is called its truth value. 1.1.1. Connectives, Truth Tables. Connectives are used for making compound propositions. The main ones are the following (p and q represent given propositions): Name Represented Meaning Negation p “not p” Conjunction p¬ q “p and q” Disjunction p ∧ q “p or q (or both)” Exclusive Or p ∨ q “either p or q, but not both” Implication p ⊕ q “if p then q” Biconditional p → q “p if and only if q” ↔ The truth value of a compound proposition depends only on the value of its components. Writing F for “false” and T for “true”, we can summarize the meaning of the connectives in the following way: 6 1.1. PROPOSITIONS 7 p q p p q p q p q p q p q T T ¬F T∧ T∨ ⊕F →T ↔T T F F F T T F F F T T F T T T F F F T F F F T T Note that represents a non-exclusive or, i.e., p q is true when any of p, q is true∨ and also when both are true.
    [Show full text]
  • Logic, Sets, and Proofs David A
    Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Statements. A logical statement is a mathematical statement that is either true or false. Here we denote logical statements with capital letters A; B. Logical statements be combined to form new logical statements as follows: Name Notation Conjunction A and B Disjunction A or B Negation not A :A Implication A implies B if A, then B A ) B Equivalence A if and only if B A , B Here are some examples of conjunction, disjunction and negation: x > 1 and x < 3: This is true when x is in the open interval (1; 3). x > 1 or x < 3: This is true for all real numbers x. :(x > 1): This is the same as x ≤ 1. Here are two logical statements that are true: x > 4 ) x > 2. x2 = 1 , (x = 1 or x = −1). Note that \x = 1 or x = −1" is usually written x = ±1. Converses, Contrapositives, and Tautologies. We begin with converses and contrapositives: • The converse of \A implies B" is \B implies A". • The contrapositive of \A implies B" is \:B implies :A" Thus the statement \x > 4 ) x > 2" has: • Converse: x > 2 ) x > 4. • Contrapositive: x ≤ 2 ) x ≤ 4. 1 Some logical statements are guaranteed to always be true. These are tautologies. Here are two tautologies that involve converses and contrapositives: • (A if and only if B) , ((A implies B) and (B implies A)). In other words, A and B are equivalent exactly when both A ) B and its converse are true.
    [Show full text]