1 Proofs Using Truth Tables 2 Proofs Using Inference Rules

Total Page：16

File Type：pdf, Size：1020Kb

1 Proofs Using Truth Tables 2 Proofs Using Inference Rules

Summer 2016 Lecture 7: Inference Rules 1 Proofs using Truth Tables How you prove a logical equivalence with a truth table: Implication Law • Start by creating the truth table: p ! q ≡ :p _ q p q :p p ! q :p _ q T T F T T T F F F F F T T T T F F T T T • Write down which columns prove the equivalence. In this case columns 4 and 5 are the same, thus proving the equivalence. How you prove a rule of inference with a truth table: Similar idea but with a more involved set up Hypothetical Syllogism • Notice that I have 3 free variables, p, q and r. That means I have 23 = 8 rows. If you want to use integers instead, that’s fine, remember 1 is True and 0 is False. (p ! q) ^ (q ! r) ! (p ! r) p q r p ! q q ! r p ! r (p ! q) ^ (q ! r) (p ! q) ^ (q ! r) ! (p ! r) T T T T T T T T T T F T F F F T T F T F T T F T T F F F T F F T F T T T T T T T F T F T F T F T F F T T T T T T F F F T T T T T • Write down which columns prove the equivalence. The last column in the logical equivalence is a tautology, thus proving the logical equivalence. You can set up all logical equivalences in the same fashion. 2 Proofs using Inference Rules How you should set these problems up for this recitation and for the homework: • You should have separate columns for the step, the statement and the reason. • You will always use all of the axioms (Given). • State the reason (the rule you used) and also state the steps used. Given: :p ^ q, r ! p, :r ! s, s ! t Prove: t Step Statement Reason 1 :p ^ q Given 2 :p Simplification (1) 3 r ! p Given 4 :r Modus Tollens (2,3) 5 :r ! s Given 6 s Modus Ponens (4,5) 7 r Given 8 s ! t Modus ponens (6, 7) Problem 1. How many rows would the previous inference proof take using a truth table? Problem 2. Show that the hypotheses "If you send me an email message, then I will finish writing the program," "If you do not send me an email message, then I will go to sleep early," and "If I go to sleep early, then I will wake up feeling refreshed" lead to the conclusion "If I do not finish writing the program, then I will wake up feeling refreshed." Let: p: q: r: s: Given: Prove: Hint, you may want to use the contrapositive definition we learned yesterday! Step Statement Reason Problem 3. Given: (p ^ q) ! r, :s ! q, p, :s Prove: r Step Statement Reason Page 2 3 Proofs using Logical Equivalences With these proofs, you are trying to make the two sides of the equation match each other by other equivalences (the bottom half of the page). • Begin with exactly the left-hand side statement • End with exactly what is on the right • Justify EVERY step with a logical equivalence • Each step should derive from the last, there is no need to state the previous step number. Prove: p ! q ,:q !:p Step Statement Reason 1 p ! q Given 2 ,:p ^ q Implication Law #1 3 , q ^ :p Commutative Law 4 ,:(:q) ^ :p Double Negation 5 ,:q !:p Implication Law #1 Problem 4. Prove: (p ^ :q) _ q , p _ q Need commutative law Step Statement Reason Page 3.

Copy Link

Recommended publications

Reliability of Mathematical Inference
Reliability of mathematical inference Jeremy Avigad Department of Philosophy and Department of Mathematical Sciences Carnegie Mellon University January 2020 Formal logic and mathematical proof An important mathematical goal is to get the answers right: • Our calculations are supposed to be correct. • Our proofs are supposed to be correct. Mathematical logic offers an idealized account of correctness, namely, formal derivability. Informal proof is viewed as an approximation to the ideal. • A mathematician can be called on to expand definitions and inferences. • The process has to terminate with fundamental notions, assumptions, and inferences. Formal logic and mathematical proof Two objections: • Few mathematicians can state formal axioms. • There are various formal foundations on offer. Slight elaboration: • Ordinary mathematics relies on an informal foundation: numbers, tuples, sets, functions, relations, structures, . • Formal logic accounts for those (and any of a number of systems suffice). Formal logic and mathematical proof What about intuitionstic logic, or large cardinal axioms? Most mathematics today is classical, and does not require strong assumptions. But even in those cases, the assumptions can be make explicit and formal. Formal logic and mathematical proof So formal derivability provides a standard of correctness. Azzouni writes: The first point to observe is that formalized proofs have become the norms of mathematical practice. And that is to say: should it become clear that the implications (of assumptions to conclusion) of an informal proof cannot be replicated by a formal analogue, the status of that informal proof as a successful proof will be rejected. Formal verification, a branch of computer science, provides corroboration: computational proof assistants make formalization routine (though still tedious).
[Show full text]
Misconceived Relationships Between Logical Positivism and Quantitative Research: an Analysis in the Framework of Ian Hacking
DOCUMENT RESUME ED 452 266 TM 032 553 AUTHOR Yu, Chong Ho TITLE Misconceived Relationships between Logical Positivism and Quantitative Research: An Analysis in the Framework of Ian Hacking. PUB DATE 2001-04-07 NOTE 26p. PUB TYPE Opinion Papers (120) ED 2S PRICE MF01/PCO2 Plus Postage. 'DESCRIPTORS *Educational Research; *Research Methodology IDENTIFIERS *Logical Positivism ABSTRACT Although quantitative research methodology is widely applied by psychological researchers, there is a common misconception that quantitative research is based on logical positivism. This paper examines the relationship between quantitative research and eight major notions of logical positivism:(1) verification;(2) pro-observation;(3) anti-cause; (4) downplaying explanation;(5) anti-theoretical entities;(6) anti-metaphysics; (7) logical analysis; and (8) frequentist probability. It is argued that the underlying philosophy of modern quantitative research in psychology is in sharp contrast to logical positivism. Putting the labor of an out-dated philosophy into quantitative research may discourage psychological researchers from applying this research approach and may also lead to misguided dispute between quantitative and qualitative researchers. What is needed is to encourage researchers and students to keep an open mind to different methodologies and apply skepticism to examine the philosophical assumptions instead of accepting them unquestioningly. (Contains 1 figure and 75 references.)(Author/SLD) Reproductions supplied by EDRS are the best that can be made from the original document. Misconceived relationships between logical positivism and quantitative research: An analysis in the framework of Ian Hacking Chong Ho Yu, Ph.D. Arizona State University April 7, 2001 N N In 4-1 PERMISSION TO REPRODUCE AND DISSEMINATE THIS MATERIALHAS BEEN GRANTED BY Correspondence: TO THE EDUCATIONAL RESOURCES Chong Ho Yu, Ph.D.
[Show full text]
Applying Logic to Philosophical Theology: a Formal Deductive Inference of Affirming God's Existence from Assuming the A-Priori
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Tomsk State University Repository Вестник Томского государственного университета Философия. Социология. Политология. 2020. № 55 ОНТОЛОГИЯ, ЭПИСТЕМОЛОГИЯ, ЛОГИКА УДК 16 + 17 + 2 + 51-7 DOI: 10.17223/1998863Х/55/1 V.O. Lobovikov1 APPLYING LOGIC TO PHILOSOPHICAL THEOLOGY: A FORMAL DEDUCTIVE INFERENCE OF AFFIRMING GOD’S EXISTENCE FROM ASSUMING THE A-PRIORI-NESS OF KNOWLEDGE IN THE SIGMA FORMAL AXIOMATIC THEORY For the first time a precise definition is given to the Sigma formal axiomatic theory, which is a result of logical formalization of philosophical epistemology; and an interpretation of this formal theory is offered. Also, for the first time, a formal deductive proof is constructed in Sigma for a formula, which represents (in the offered interpretation) the statement of God’s Existence under the condition that knowledge is a priori. Keywords: formal axiomatic epistemology theory; two-valued algebra of formal axiology; formal-axiological equivalence; a-priori knowledge; existence of God. 1. Introduction Since Socrates, Plato, Aristotle, Stoics, Cicero, and especially since the very beginning of Christianity philosophy, the possibility or impossibility of logical proving God’s existence has been a nontrivial problem of philosophical theology. Today the literature on this topic is immense. However, even in our days, the knot- ty problem remains unsolved as all the suggested options of solving it are contro- versial from some point of view. Some respectable researchers (let us call them “pessimists”) believed that the logical proving of God’s existence in theoretical philosophy was impossible on principle, for instance, Occam, Hume [1], and Kant [2] believed that any rational theoretic-philosophy proof of His existence was a mistake (illusion), consequently, a search for the logical proving of His existence was wasting resources and, hence, harmful; only faith in God was relevant and useful; reason was irrelevant and use- less.
[Show full text]
Propositional Logic (PDF)
Mathematics for Computer Science Proving Validity 6.042J/18.062J Instead of truth tables, The Logic of can try to prove valid formulas symbolically using Propositions axioms and deduction rules Albert R Meyer February 14, 2014 propositional logic.1 Albert R Meyer February 14, 2014 propositional logic.2 Proving Validity Algebra for Equivalence The text describes a for example, bunch of algebraic rules to the distributive law prove that propositional P AND (Q OR R) ≡ formulas are equivalent (P AND Q) OR (P AND R) Albert R Meyer February 14, 2014 propositional logic.3 Albert R Meyer February 14, 2014 propositional logic.4 1 Algebra for Equivalence Algebra for Equivalence for example, The set of rules for ≡ in DeMorgan’s law the text are complete: ≡ NOT(P AND Q) ≡ if two formulas are , these rules can prove it. NOT(P) OR NOT(Q) Albert R Meyer February 14, 2014 propositional logic.5 Albert R Meyer February 14, 2014 propositional logic.6 A Proof System A Proof System Another approach is to Lukasiewicz’ proof system is a start with some valid particularly elegant example of this idea. formulas (axioms) and deduce more valid formulas using proof rules Albert R Meyer February 14, 2014 propositional logic.7 Albert R Meyer February 14, 2014 propositional logic.8 2 A Proof System Lukasiewicz’ Proof System Lukasiewicz’ proof system is a Axioms: particularly elegant example of 1) (¬P → P) → P this idea. It covers formulas 2) P → (¬P → Q) whose only logical operators are 3) (P → Q) → ((Q → R) → (P → R)) IMPLIES (→) and NOT. The only rule: modus ponens Albert R Meyer February 14, 2014 propositional logic.9 Albert R Meyer February 14, 2014 propositional logic.10 Lukasiewicz’ Proof System Lukasiewicz’ Proof System Prove formulas by starting with Prove formulas by starting with axioms and repeatedly applying axioms and repeatedly applying the inference rule.
[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]
From Fuzzy Sets to Crisp Truth Tables1 Charles C. Ragin
From Fuzzy Sets to Crisp Truth Tables1 Charles C. Ragin Department of Sociology University of Arizona Tucson, AZ 85721 USA [email protected] Version: April 2005 1. Overview One limitation of the truth table approach is that it is designed for causal conditions are simple presence/absence dichotomies (i.e., Boolean or "crisp" sets). Many of the causal conditions that interest social scientists, however, vary by level or degree. For example, while it is clear that some countries are democracies and some are not, there are many in-between cases. These countries are not fully in the set of democracies, nor are they fully excluded from this set. Fortunately, there is a well-developed mathematical system for addressing partial membership in sets, fuzzy-set theory. Section 2 of this paper provides a brief introduction to the fuzzy-set approach, building on Ragin (2000). Fuzzy sets are especially powerful because they allow researchers to calibrate partial membership in sets using values in the interval between 0 (nonmembership) and 1 (full membership) without abandoning core set theoretic principles, for example, the subset relation. Ragin (2000) demonstrates that the subset relation is central to the analysis of multiple conjunctural causation, where several different combinations of conditions are sufficient for the same outcome. While fuzzy sets solve the problem of trying to force-fit cases into one of two categories (membership versus nonmembership in a set), they are not well suited for conventional truth table analysis. With fuzzy sets, there is no simple way to sort cases according to the combinations of causal conditions they display because each case's array of membership scores may be unique.
[Show full text]
The Routledge Companion to Islamic Philosophy Reasoning in the Qurn
This article was downloaded by: 10.3.98.104 On: 25 Sep 2021 Access details: subscription number Publisher: Routledge Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office: 5 Howick Place, London SW1P 1WG, UK The Routledge Companion to Islamic Philosophy Richard C. Taylor, Luis Xavier López-Farjeat Reasoning in the Qurn Publication details https://www.routledgehandbooks.com/doi/10.4324/9781315708928.ch2 Rosalind Ward Gwynne Published online on: 03 Sep 2015 How to cite :- Rosalind Ward Gwynne. 03 Sep 2015, Reasoning in the Qurn from: The Routledge Companion to Islamic Philosophy Routledge Accessed on: 25 Sep 2021 https://www.routledgehandbooks.com/doi/10.4324/9781315708928.ch2 PLEASE SCROLL DOWN FOR DOCUMENT Full terms and conditions of use: https://www.routledgehandbooks.com/legal-notices/terms This Document PDF may be used for research, teaching and private study purposes. Any substantial or systematic reproductions, re-distribution, re-selling, loan or sub-licensing, systematic supply or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date. The publisher shall not be liable for an loss, actions, claims, proceedings, demand or costs or damages whatsoever or howsoever caused arising directly or indirectly in connection with or arising out of the use of this material. 2 REASONING- IN THE QURʾAN Rosalind Ward Gwynne Introduction Muslims consider the Qurʾa-n to be the revealed speech of God—sublime, inimitable and containing information that only God knows. It has been analyzed in every pos- sible way—theologically, linguistically, legally, metaphorically—and some of these analyses have presented their results as the conclusions of reasoning in the Qurʾa-n itself, whether explicit or implicit.
[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]
Logical Inference and Its Dynamics
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by PhilPapers Logical Inference and Its Dynamics Carlotta Pavese 1 Duke University Philosophy Department Abstract This essay advances and develops a dynamic conception of inference rules and uses it to reexamine a long-standing problem about logical inference raised by Lewis Carroll's regress. Keywords: Inference, inference rules, dynamic semantics. 1 Introduction Inferences are linguistic acts with a certain dynamics. In the process of making an inference, we add premises incrementally, and revise contextual assump- tions, often even just provisionally, to make them compatible with the premises. Making an inference is, in this sense, moving from one set of assumptions to another. The goal of an inference is to reach a set of assumptions that supports the conclusion of the inference. This essay argues from such a dynamic conception of inference to a dynamic conception of inference rules (section x2). According to such a dynamic con- ception, inference rules are special sorts of dynamic semantic values. Section x3 develops this general idea into a detailed proposal and section x4 defends it against an outstanding objection. Some of the virtues of the dynamic con- ception of inference rules developed here are then illustrated by showing how it helps us re-think a long-standing puzzle about logical inference, raised by Lewis Carroll [3]'s regress (section x5). 2 From The Dynamics of Inference to A Dynamic Conception of Inference Rules Following a long tradition in philosophy, I will take inferences to be linguistic acts. 2 Inferences are acts in that they are conscious, at person-level, and 1 I'd like to thank Guillermo Del Pinal, Simon Goldstein, Diego Marconi, Ram Neta, Jim Pryor, Alex Rosenberg, Daniel Rothschild, David Sanford, Philippe Schlenker, Walter Sinnott-Armstrong, Seth Yalcin, Jack Woods, and three anonymous referees for helpful suggestions on earlier drafts.
[Show full text]
Lecture 1: Propositional Logic
Lecture 1: Propositional Logic Syntax Semantics Truth tables Implications and Equivalences Valid and Invalid arguments Normal forms Davis-Putnam Algorithm 1 Atomic propositions and logical connectives An atomic proposition is a statement or assertion that must be true or false. Examples of atomic propositions are: “5 is a prime” and “program terminates”. Propositional formulas are constructed from atomic propositions by using logical connectives. Connectives false true not and or conditional (implies) biconditional (equivalent) A typical propositional formula is The truth value of a propositional formula can be calculated from the truth values of the atomic propositions it contains. 2 Well-formed propositional formulas The well-formed formulas of propositional logic are obtained by using the construction rules below: An atomic proposition is a well-formed formula. If is a well-formed formula, then so is . If and are well-formed formulas, then so are , , , and . If is a well-formed formula, then so is . Alternatively, can use Backus-Naur Form (BNF) : formula ::= Atomic Proposition formula formula formula formula formula formula formula formula formula formula 3 Truth functions The truth of a propositional formula is a function of the truth values of the atomic propositions it contains. A truth assignment is a mapping that associates a truth value with each of the atomic propositions . Let be a truth assignment for . If we identify with false and with true, we can easily determine the truth value of under . The other logical connectives can be handled in a similar manner. Truth functions are sometimes called Boolean functions. 4 Truth tables for basic logical connectives A truth table shows whether a propositional formula is true or false for each possible truth assignment.
[Show full text]
Propositional Logic, Truth Tables, and Predicate Logic (Rosen, Sections 1.1, 1.2, 1.3) TOPICS
Propositional Logic, Truth Tables, and Predicate Logic (Rosen, Sections 1.1, 1.2, 1.3) TOPICS • Propositional Logic • Logical Operations • Equivalences • Predicate Logic Logic? What is logic? Logic is a truth-preserving system of inference Truth-preserving: System: a set of If the initial mechanistic statements are transformations, based true, the inferred on syntax alone statements will be true Inference: the process of deriving (inferring) new statements from old statements Proposi0onal Logic n A proposion is a statement that is either true or false n Examples: n This class is CS122 (true) n Today is Sunday (false) n It is currently raining in Singapore (???) n Every proposi0on is true or false, but its truth value (true or false) may be unknown Proposi0onal Logic (II) n A proposi0onal statement is one of: n A simple proposi0on n denoted by a capital leJer, e.g. ‘A’. n A negaon of a proposi0onal statement n e.g. ¬A : “not A” n Two proposi0onal statements joined by a connecve n e.g. A ∧ B : “A and B” n e.g. A ∨ B : “A or B” n If a connec0ve joins complex statements, parenthesis are added n e.g. A ∧ (B∨C) Truth Tables n The truth value of a compound proposi0onal statement is determined by its truth table n Truth tables deﬁne the truth value of a connec0ve for every possible truth value of its terms Logical negaon n Negaon of proposi0on A is ¬A n A: It is snowing. n ¬A: It is not snowing n A: Newton knew Einstein. n ¬A: Newton did not know Einstein.
[Show full text]
Valid Arguments
CHAPTER 3 Logic Copyright © 2015, 2011, 2007 Pearson Education, Inc. Section 3.7, Slide 1 3.7 Arguments and Truth Tables Copyright © 2015, 2011, 2007 Pearson Education, Inc. Section 3.7, Slide 2 Objectives 1. Use truth tables to determine validity. 2. Recognize and use forms of valid and invalid arguments. Copyright © 2015, 2011, 2007 Pearson Education, Inc. Section 3.7, Slide 3 Arguments An Argument consists of two parts: Premises: the given statements. Conclusion: the result determined by the truth of the premises. Valid Argument: The conclusion is true whenever the premises are assumed to be true. Invalid Argument: Also called a fallacy Truth tables can be used to test validity. Copyright © 2015, 2011, 2007 Pearson Education, Inc. Section 3.7, Slide 4 Testing the Validity of an Argument with a Truth Table Copyright © 2015, 2011, 2007 Pearson Education, Inc. Section 3.7, Slide 5 Example: Did the Pickiest Logician in the Galaxy Foul Up? In Star Trek, the spaceship Enterprise is hit by an ion storm, causing the power to go out. Captain Cook wonders if Mr. Scott is aware of the problem. Mr. Spock replies, “If Mr. Scott is still with us, the power should be on momentarily.” Moments later the ship’s power comes back on. Argument: If Mr. Scott is still with us, then the power will come on. The power comes on. Therefore, Mr. Scott is still with us. Determine whether the argument is valid or invalid. Copyright © 2015, 2011, 2007 Pearson Education, Inc. Section 3.7, Slide 6 Example continued Solution Step 1: p: Mr.
[Show full text]