Propositional Logic. Chrysippos (3 rd Head of Stoic Academy). Main early logician. AKA Modern Logic AKA Symbolic Logic. AKA Boolean Logic.
|
|
- Hollie Matthews
- 5 years ago
- Views:
Transcription
1 Propositional Logic. Modern Logic. Boolean Logic. AKA Modern Logic AKA Symbolic Logic. AKA Boolean Logic. Chrysippos (3 rd Head of Stoic Academy). Main early logician
2 Stoic Philosophers Zeno ff301bc. Taught Philosophy under the Stoia Poikile (Painted Porch). Zeno Famous for logical paradoxes: This statement is false This school of philosophy persisted until 529 AD when the Christian Emperor Justinian ordered all philosophy schools closed. We know that several hundred Texts were written by Stoic Logicians. NONE SURVIVE.
3 Stoic Philosophers Stoic Philosophers were adamant that reason, rather then passion, was the correct attitude for someone seeking wisdom (and happiness). freedom is secured not by the fulfilling of one's desires, but by the removal of desire (Epictus). Thus in modern English, we call someone Stoic who is dispassionate, especially in the face of hardship.
4 Propositional VS Predicate Logic Propositional Stoics. More variety in allowable expressions. Arguments have variable forms. Allows more then one operator (if then, and, or, not). Less simple proofs. Scorned and Burned by Early Christians. Rediscovered in late 19 th Century. Predicate Aristotle. Very limited expressions. Arguments have fixed form (3 line syllogisms) Only operator set membership Very simple proofs for validity. Scorned and Burned by the Early Christians. Rediscovered in Early Medieval Period.
5 Atomic Propositions The simplest possible propositions. I am walking = Atomic I am walking and texting. Not atomic. I am walking and I am texting. Two atomic propositions conjoined. A statement is Atomic if no logical connectives are in the statement: words like and, or, if then, but, not.
6 Propositional operators. And Or conjunction. disjunction If then conditional Not negation Other logical relationships can be reduced to combinations of these.
7 Truth Values Every statement is either true or false. In ordinary language we represent a statement as true by merely writing, speaking etc. By convention, it is raining means: It is true that it is raining. To deny, we negate. it is not raining.
8 Propositional Notation Any atomic statement can be represented by a variable letter (usually uppercase). Ex. Phil is a Philosophy prof. P. To say that it is true that Phil is a Philosophy Prof. we merely write P. read as P is true. To deny that Phil is a philosophy prof. we write not-p or ~P, read as P is false
9 Examples of Notation There are 11 minors released from the Chilean mine = M Two junior and two senior faculty were present at the appeal hearing. = J and S. J = two junior faculty were present. S = two senior faculty were present. Either I will pass the course or drop out of the U. P or D.
10 Truth Tables We can represent all the possible truth values for any combination of statements using a truth table. One row represents one possible permutation of truth values. For one statement, there would be 2 rows. For two statements, this would double to 4 rows. For 3 statements this would double to 8 rows. Reasonable limit to usefulness.
11 Uses for truth tables Define operators. This is what we will be doing today. Analyze statements. Statements have different possible truth values. Analyze arguments. Valid arguments never have a false conclusion with all true premises.
12 Truth table for negation. Every statement is either true or false. A negated statement has the opposite truth value to the un-negated statement. Symbol for negation is the tilde: ~ P (possible values) T F ~P (result) F T
13 Truth table for Conjunction A conjunction is true when both conjuncts are true, otherwise false. Symbol for conjuction is the dot: P Q P Q (result) T T T T F F F T F F F F
14 Truth table for Disjunction A disjunction is true when either, or both, disjuncts are true, otherwise false. Symbol for disjunction is the wedge: v P Q P v Q (result) T T T T F T F T T F F F
15 Possible Equivocation on or Sometimes when we say or we mean: One or the other, or both. Eg. You can have cake or ice cream. This is the inclusive sense of or. Othertimes we mean: One or the other but not both: eg. you can have apple or pumpkin pie. This is the exclusive sense of or. In Symbolic logic we presume the inclusive sense. The exclusive sense can be represented by a combination of symbols.
16 Conditional Statements Statement form: If ANTECEDENT then CONSEQUENT. Interpretation = material conditional No implied relationship. Eg. If you have money then you ll get a car. Is this true or false when you have no money but you still get a car?
17 Categorical Equivalents Recall A form statements like: All A s are B s. These can be converted to Conditional statements All A s are B s = If A (member of A) then B (member of B). E form Statements: No A s are B s Converts to not (A then B) ~(A B)
18 Truth table for Conditional A Conditional is true in every case except when the antecedent is true and the consequent is false. Symbol for conditional is the horseshoe P Q P Q (result) T T T T F F F T T F F T
19 WHAT!!!!!! Consider a Bet on a Horse. My bet can be expressed as a conditional If Speedy wins then my bookie pays me $5.00 When is the deal broken? If my bookie pays me $5.00 for no reason, or for some other bet, the deal is still good. If speedy loses and I don t get $5.00 does it make sense to say the deal was not kept? Only when speedy wins and I don t get the $5.00 would we say the deal has been broken. (false).
20 If and only if Bi-conditional -> two conditionals A if and only if B means: (If A then B) and (If B then A) Recall how only worked in Categorical Logic: Only A s are B s = All B s are A s. The bi-conditional is the same as equivalence. Symbolized by the tri-bar:
21 Truth Table for Equivalence P Q P Q T T T T F F F T F F F T So if the university stipulates: you can graduate if and only if you have a GPA of C or better, they mean: the conditions for graduating are equivalent to the conditions of a C or better GPA
22 Compound propositions. You can take Law 2240 if you have credit for law 1140 and law 1240 or if you have written consent of the dean. Symbolized as: (( ) v W) 2240 Brackets work just like in math (they borrowed them from us).
23 Master truth table This table defines the logical operators. P Q ~P P Q P v Q P Q P Q T T F T T T T T F F F T F F F T T F T T F F F T F F T T
24 Truth Tables for Compound Statements Compound statements can be analyzed for their possible truth values. Some statements can never be true: Contradictions (P ~P) Some statements can never be false: Tautologies (P v ~P) Some statements can be either true or false: Contingent (P v Q)
25 Truth table for statements Nothing can be both red all over and green all over. ~(R G) R G ~(R *G) T T F T F T F T T F F T This table shows this statement is contingent. It can be either true or false depending on the input conditions of R and G.
26 Contradiction Nothing can be true and false at the same time. P ~P This table shows that the statement (P ~P) can never be true. P T F P ~ P F F It is internally contradictory.
27 Tautology Its not over till its over (Yoggi Berra) P if and only P P P P P P T F P P P P T T This table shows a statement that can never be false (a tautology).
28 Evaluate these statements 1. (P v Q) (P Q) 2. (P Q) (P v Q) 3. Q (P v Q) 4. (~P ~Q) ~(P v Q)
29 Propositional Arguments Arguments are any number of statements intended to support a conclusion. Notational Convention: each premise gets its own line. Each premise is numbered. Conclusion added to end of last line after /
30 A familiar example The syllogism Barbara (3 A forms) All A s are B s All B s are C s Therefore All A s are C s. If A then B IF B then C Therefore if A then C. 1.A B 2.B C / A C Propositional form AKA Hypothetical syllogism.
31 A familiar fallacy All A s are B s All C s Are B s Therefore All A s are C s 1. A B 2. C B / A C
32 Example Propositional argument I m going to drop critical thinking if my quiz score and my prose score are both low or if Prof Phil continues to lull me to sleep. Since my quiz score and my prose score are both low, I m headed over to the faculty office to VW. Let D = Drop Critical thinking Let Q = Low quiz score Let P = Low prose score Let S = Prof Phil Lulls me to sleep.
33 Example continued I m going to drop critical thinking if my quiz score and my prose score are both low or if Prof Phil continues to lull me to sleep. Since my quiz score and my prose score are both low, I m headed over to the faculty office to VW. 1. ((Q P) v S) D. 2. Q P / D Later we ll see how to add a proof to this argument by deriving further lines. For now, we ll prove it using the truth table. (see whiteboard).
34 Statements vs Arguments Statements and arguments are inter-changable. Any argument is a statement formed by a conjunction of the premises being the antecedent of a conditional with the conclusion being the consequent.
35 Statement vs Argument eg. Statement: since I agreed that If my dog bites then I ll have to keep him leashed and he bite me, so I ll have to keep him tied up. ((B L) B) L Argument form: If my dog bites then I ll have to keep him leashed. My dog bite me. Therefore I ll have to keep him tied up. B L B / L
36 Test for validity A Valid argument presented as a single statement will be a tautology. (final column all T) A valid argument with separate premise(s) and conclusion will satisfy the definition of valid. If the premises are true the conclusion must be true. Rows with a false conclusion must have at least one false premise. (Parallel truth table for previous example)
37 Test these arguments for validity Either employment levels will go up or there will be a revolt. Employment levels are not going up. Therefore, there will be a revolt.
38 Classic argument forms Hypothetical Syllogism (equivalent to Barbara 3Aform syllogism) does reduce to SCS form. Stoic philosophers identified several argument forms that did not obviously reduce to Aristotelian syllogisms. They worked hard to prove them. Eg. Disjunctive syllogism P or Q, not P; therefore Q. These argument forms can be proven using truth tables. These arguments can be used as intermediate inference rules in more extended arguments.
39 Using inference rules. 1. If A then B 2. If B then C 3. If C then D. Therefore A then D. lines 1 and 2 are a valid argument that implies A then C. A and C and line 3 implies the conclusion.
40 Copi s rules of inference. Total of 9 inference rules. Modus ponens Modus tollens. Hypothetical syllogism. Disjunctive syllogism. Constructive dilemma. Absorption. Simplification. Conjunction. Addition.
41 Modus Ponens AKA affirming the antecedent. If A then B A therefore B If speedy wins then $5.00 Speedy wins! $5.00. Proof on whiteboard. A
42 Modus Tollens AKA Denying the consequent. Recall IF antecedent then CONSEQUENT. IF P then Q Not Q Therefore not P Eg. If speedy wins then $5.00 No $5.00, so speedy didn t win.
43 Hypothetical Syllogism IF A then B If B then C Therefore If A then C Ex. If my car starts then I ll get to class. If I get to class then I can sleep in class Therefore If my car starts then I can sleep. Proof via truth table.
44 Disjunctive Syllogism AKA denying the disjunct. P or Q Not P Therefore Q You can have either pie or cake. No pie please. Cake it is! Proof on whiteboard.
45 Constructive Dilemma Di (2) lemma (theorm) Form has 3 premises 2 conditionals 1 disjunction Either A or B If A then C If B then D Therefore C or D.
46 Absorbtion P then Q Therefore P then (P and Q).
47 Simplification P and Q Therefor P
48 Conjunction P Q Therefore P Q
49 Addition P Therefore P or Q. Where does the Q come from? Anywhere If P is true then P or ANYTHING is true. Remember this when hearing answers to disjunctive questions.
50 Some Classic Fallacies Affirming the Consequent. Denying the Antecedent. Affirming the Disjunct.
51 Affirming the Consequent 1. A B 2. B / A Eg. If I m in SJ s College, then I m at the U of M. I m at the U of M. Therefore I m in St. John s College.
52 Denying the Antecedent 1. A B 2. ~A / ~B Eg. If I m convicted then I must be guilty. I wasn t convicted so I must not be guilty.
53 1. A v B 2. A / ~B Affirming the Disjunct. Eg. I can have either cake or ice cream. I had cake, so I can t have ice cream. This would be valid with exclusive sense of or.
54 Substitution rules We have seen that A if and only if B (A B) means the same thing as A equivalent to B (A B) Using truth tables we can prove other equivalencies. We can substitute these equivalencies to simplify reasoning.
55 Copi s logical equivalencies 10 logical equivalencies: De Morgan s Theorem(s). Commutation. Association. Distribution. Double negation. Transposition. Material Implication. Material Equivalence. Exportation. Tautology.
56 De Morgan s Theorems Explain logical relationship between addition and conjunction. ~(P Q) (~P v ~Q) ~(P v Q) (~P ~Q) Eg: U2 isn t playing in Edmonton and Calgary. ~(E C) U2 isn t playing in Edmonton or in Calgary. (~E v ~C)
57 Natural Deduction Any argument can be proven valid by a process of deduction. Deducing the conclusion from the premises using a series of steps, each of which is a valid argument form. How does this work? Remember the definition of Valid: If the premises are true, the conclusion must be true. Assume the premises are true, and derive the conclusion.
58 Natural Deduction example 1. (P v Q) (P Q) 2. P / Q 3. P v Q 2, add (from step 2 by Addition) 4. P Q 1, 3, MP (Steps 1 and 2 by Modus Ponens) 5. Q 4 Simp. (from step 4 by simplification)
59 Natural deduction cont. Fair game? Using rules of inference (copi 7.2) Not fair. Using rules of substitution. (copi 7.3)
60 Natural deduction problems 1. P (~Q ~P), P, ~Q / ~P 2. P v Q, ~P, Q R / R 3. P, P R, Q S / R v S (2 ways to solve) 4. (B v ~C), C v D, ~B / D
61 Comparing Proof Systems Counter-examples (intuitive) Venn Diagrams (visual) Aristotle s rules (simple) Truth Tables (simple but laborious) Natural Deduction (elegant but difficult)
62 Completeness of proof systems A proof system is complete if it can prove every invalid argument invalid, AND every valid argument valid.
63 Comparing Proof Systems Counter-examples Both predicate and propositional logic. Proves only invalid arguments. Cannot prove an argument valid (fallacy of ignorance.) Venn Diagrams. Only predicate logic. Complete (both valid and invalid) Aristotle s rules. Complete for all arguments that can be expressed as 3 term syllogisms. Truth Tables. Complete for all propositional arguments.
64 Is natural deduction complete? Recall, you prove an argument valid by deducing its conclusion from its premises using only valid inferences (and substitutions). This proves that if the premises are true, the conclusion cannot be false. Problem: suppose you cannot find the proof? Invalid or just really hard? Fallacy of ignorance?
65 Natural deduction for invalidity If you can deduce the contradiction of the conclusion, THEN you have proven the argument invalid. Eg: 1. P R, 2. ~R / P 3. ~P 1,2 MT
66 More Cool Stuff with Prop Logic Conditional proof. Often when we reason, we accept statements conditionally ( for the sake of the argument ). We tentatively treat these statements as true to see what might come of it. In prop logic there is a notational form to deal with this. (see whiteboard demo).
67 More Cool Stuff with Prop Logic Reductio Ad Absurdum (indirect Proof) Reduce to absurdity. If you can deduce a logical absurdity, you show that something in the set of starting assumptions is false. Logical absurdity (something is both true and false at the same time) P ~P Indirect proofs proceed by using a conditional proof method and assuming the opposite of what you are trying to prove. (See whiteboard demo)
Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)
Today s Lecture 2/25/10 Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Announcements Homework: -- Ex 7.3 pg. 320 Part B (2-20 Even). --Read chapter 8.1 pgs. 345-361.
More informationNatural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic. The method consists of using sets of Rules of Inference (valid argument forms)
More informationTHE LOGIC OF COMPOUND STATEMENTS
THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment
More information2. The Logic of Compound Statements Summary. Aaron Tan August 2017
2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional
More informationManual of Logical Style (fresh version 2018)
Manual of Logical Style (fresh version 2018) Randall Holmes 9/5/2018 1 Introduction This is a fresh version of a document I have been working on with my classes at various levels for years. The idea that
More informationSection 1.2: Propositional Logic
Section 1.2: Propositional Logic January 17, 2017 Abstract Now we re going to use the tools of formal logic to reach logical conclusions ( prove theorems ) based on wffs formed by some given statements.
More information(ÀB Ä (A Â C)) (A Ä ÀC) Á B. This is our sample argument. Formal Proofs
(ÀB Ä (A Â C)) (A Ä ÀC) Á B This is our sample argument. Formal Proofs From now on, formal proofs will be our main way to test arguments. We ll begin with easier proofs. Our initial strategy for constructing
More informationThe Logic of Compound Statements cont.
The Logic of Compound Statements cont. CSE 215, Computer Science 1, Fall 2011 Stony Brook University http://www.cs.stonybrook.edu/~cse215 Refresh from last time: Logical Equivalences Commutativity of :
More informationPropositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013
Propositional Logic Argument Forms Ioan Despi despi@turing.une.edu.au University of New England July 19, 2013 Outline Ioan Despi Discrete Mathematics 2 of 1 Order of Precedence Ioan Despi Discrete Mathematics
More informationManual of Logical Style
Manual of Logical Style Dr. Holmes January 9, 2015 Contents 1 Introduction 2 2 Conjunction 3 2.1 Proving a conjunction...................... 3 2.2 Using a conjunction........................ 3 3 Implication
More informationPROPOSITIONAL CALCULUS
PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and
More informationChapter 1 Elementary Logic
2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help
More informationPropositional Logic. Spring Propositional Logic Spring / 32
Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements
More informationSupplementary Logic Notes CSE 321 Winter 2009
1 Propositional Logic Supplementary Logic Notes CSE 321 Winter 2009 1.1 More efficient truth table methods The method of using truth tables to prove facts about propositional formulas can be a very tedious
More informationCHAPTER 1 - LOGIC OF COMPOUND STATEMENTS
CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement
More informationLecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)
Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or
More informationDiscrete Structures & Algorithms. Propositional Logic EECE 320 // UBC
Discrete Structures & Algorithms Propositional Logic EECE 320 // UBC 1 Review of last lecture Pancake sorting A problem with many applications Bracketing (bounding a function) Proving bounds for pancake
More information1.1 Statements and Compound Statements
Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something
More informationn logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional
More informationPHI Propositional Logic Lecture 2. Truth Tables
PHI 103 - Propositional Logic Lecture 2 ruth ables ruth ables Part 1 - ruth unctions for Logical Operators ruth unction - the truth-value of any compound proposition determined solely by the truth-value
More informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
More informationPropositional Logic: Part II - Syntax & Proofs 0-0
Propositional Logic: Part II - Syntax & Proofs 0-0 Outline Syntax of Propositional Formulas Motivating Proofs Syntactic Entailment and Proofs Proof Rules for Natural Deduction Axioms, theories and theorems
More informationA Quick Lesson on Negation
A Quick Lesson on Negation Several of the argument forms we have looked at (modus tollens and disjunctive syllogism, for valid forms; denying the antecedent for invalid) involve a type of statement which
More informationLogic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.
Math 0413 Appendix A.0 Logic Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another. This type of logic is called propositional.
More informationFormal Logic. Critical Thinking
ormal Logic Critical hinking Recap: ormal Logic If I win the lottery, then I am poor. I win the lottery. Hence, I am poor. his argument has the following abstract structure or form: If P then Q. P. Hence,
More informationCompound Propositions
Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth
More information4 Derivations in the Propositional Calculus
4 Derivations in the Propositional Calculus 1. Arguments Expressed in the Propositional Calculus We have seen that we can symbolize a wide variety of statement forms using formulas of the propositional
More informationA. Propositional Logic
CmSc 175 Discrete Mathematics A. Propositional Logic 1. Statements (Propositions ): Statements are sentences that claim certain things. Can be either true or false, but not both. Propositional logic deals
More informationThe Importance of Being Formal. Martin Henz. February 5, Propositional Logic
The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets
More informationFor a horseshoe statement, having the matching p (left side) gives you the q (right side) by itself. It does NOT work with matching q s.
7.1 The start of Proofs From now on the arguments we are working with are all VALID. There are 18 Rules of Inference (see the last 2 pages in Course Packet, or front of txt book). Each of these rules is
More informationNatural deduction for truth-functional logic
Natural deduction for truth-functional logic Phil 160 - Boston University Why natural deduction? After all, we just found this nice method of truth-tables, which can be used to determine the validity or
More information8. Reductio ad absurdum
8. Reductio ad absurdum 8.1 A historical example In his book, The Two New Sciences, 10 Galileo Galilea (1564-1642) gives several arguments meant to demonstrate that there can be no such thing as actual
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More informationProseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1
Propositional Logic: Syntax and Natural Deduction 1 The Plot That Will Unfold I want to provide some key historical and intellectual context to the model theoretic approach to natural language semantics,
More information8. Reductio ad absurdum
8. Reductio ad absurdum 8.1 A historical example In his book, The Two New Sciences, Galileo Galilea (1564-1642) gives several arguments meant to demonstrate that there can be no such thing as actual infinities
More informationDeductive and Inductive Logic
Deductive Logic Overview (1) Distinguishing Deductive and Inductive Logic (2) Validity and Soundness (3) A Few Practice Deductive Arguments (4) Testing for Invalidity (5) Practice Exercises Deductive and
More informationProofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007
Proofs Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.5, 1.6, and 1.7 of Rosen cse235@cse.unl.edu
More informationProofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction
Introduction I Proofs Computer Science & Engineering 235 Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu A proof is a proof. What kind of a proof? It s a proof. A proof is a proof. And when
More information2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic
CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares
More informationChapter 1: The Logic of Compound Statements. January 7, 2008
Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationSample Problems for all sections of CMSC250, Midterm 1 Fall 2014
Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical
More informationChapter 1, Logic and Proofs (3) 1.6. Rules of Inference
CSI 2350, Discrete Structures Chapter 1, Logic and Proofs (3) Young-Rae Cho Associate Professor Department of Computer Science Baylor University 1.6. Rules of Inference Basic Terminology Axiom: a statement
More informationPropositional Logic. Fall () Propositional Logic Fall / 30
Propositional Logic Fall 2013 () Propositional Logic Fall 2013 1 / 30 1 Introduction Learning Outcomes for this Presentation 2 Definitions Statements Logical connectives Interpretations, contexts,... Logically
More informationLogic Overview, I. and T T T T F F F T F F F F
Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical
More informationPropositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38
Propositional Logic Jason Filippou CMSC250 @ UMCP 05-31-2016 ason Filippou (CMSC250 @ UMCP) Propositional Logic 05-31-2016 1 / 38 Outline 1 Syntax 2 Semantics Truth Tables Simplifying expressions 3 Inference
More informationResolution (14A) Young W. Lim 8/15/14
Resolution (14A) Young W. Lim Copyright (c) 2013-2014 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationBoolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012
March 5, 2012 Webwork Homework. The handout on Logic is Chapter 4 from Mary Attenborough s book Mathematics for Electrical Engineering and Computing. Proving Propositions We combine basic propositions
More informationPropositional Logic Review
Propositional Logic Review UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane The task of describing a logical system comes in three parts: Grammar Describing what counts as a formula Semantics Defining
More informationProof Worksheet 2, Math 187 Fall 2017 (with solutions)
Proof Worksheet 2, Math 187 Fall 2017 (with solutions) Dr. Holmes October 17, 2017 The instructions are the same as on the first worksheet, except you can use all the rules in the strategies handout. We
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationDEDUCTIVE REASONING Propositional Logic
7 DEDUCTIVE REASONING Propositional Logic Chapter Objectives Connectives and Truth Values You will be able to understand the purpose and uses of propositional logic. understand the meaning, symbols, and
More informationProof strategies, or, a manual of logical style
Proof strategies, or, a manual of logical style Dr Holmes September 27, 2017 This is yet another version of the manual of logical style I have been working on for many years This semester, instead of posting
More informationCS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)
CS100: DISCREE SRUCURES Lecture 5: Logic (Ch1) Lecture Overview 2 Statement Logical Connectives Conjunction Disjunction Propositions Conditional Bio-conditional Converse Inverse Contrapositive Laws of
More information3 The Semantics of the Propositional Calculus
3 The Semantics of the Propositional Calculus 1. Interpretations Formulas of the propositional calculus express statement forms. In chapter two, we gave informal descriptions of the meanings of the logical
More information15414/614 Optional Lecture 1: Propositional Logic
15414/614 Optional Lecture 1: Propositional Logic Qinsi Wang Logic is the study of information encoded in the form of logical sentences. We use the language of Logic to state observations, to define concepts,
More informationCITS2211 Discrete Structures Proofs
CITS2211 Discrete Structures Proofs Unit coordinator: Rachel Cardell-Oliver August 13, 2017 Highlights 1 Arguments vs Proofs. 2 Proof strategies 3 Famous proofs Reading Chapter 1: What is a proof? Mathematics
More informationSection 1.1 Propositions
Set Theory & Logic Section 1.1 Propositions Fall, 2009 Section 1.1 Propositions In Chapter 1, our main goals are to prove sentences about numbers, equations or functions and to write the proofs. Definition.
More information10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference
Logic? Propositional Logic (Rosen, Chapter 1.1 1.3) TOPICS Propositional Logic Truth Tables Implication Logical Proofs 10/1/12 CS160 Fall Semester 2012 2 What is logic? Logic is a truth-preserving system
More information(Refer Slide Time: 02:20)
Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 5 Logical Inference In the last class we saw about
More informationCOMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called
More informationWhat is Logic? Introduction to Logic. Simple Statements. Which one is statement?
What is Logic? Introduction to Logic Peter Lo Logic is the study of reasoning It is specifically concerned with whether reasoning is correct Logic is also known as Propositional Calculus CS218 Peter Lo
More information1 The Foundation: Logic and Proofs
1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( 명제 ) a declarative sentence that is either true or false, but not both nor neither letters denoting propositions p, q, r, s, T:
More information3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations
Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element
More informationFormal (natural) deduction in propositional logic
Formal (natural) deduction in propositional logic Lila Kari University of Waterloo Formal (natural) deduction in propositional logic CS245, Logic and Computation 1 / 67 I know what you re thinking about,
More informationIII SEMESTER CORE COURSE
BA PHILOSOPHY PROGRAMME III SEMESTER CORE COURSE SYMBOLIC LOGIC AND INFORMATICS ( 2014 Admission onwards) (CU-CBCSS) UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION Calicut university P.O, Malappuram
More informationLogical Form 5 Famous Valid Forms. Today s Lecture 1/26/10
Logical Form 5 Famous Valid Forms Today s Lecture 1/26/10 Announcements Homework: --Read Chapter 7 pp. 277-298 (doing the problems in parts A, B, and C pp. 298-300 are recommended but not required at this
More information1 The Foundation: Logic and Proofs
1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( ) a declarative sentence that is either true or false, but not both nor neither letters denoting propostions p, q, r, s, T: true
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Originals slides by Dr. Baek and Dr. Still, adapted by J. Stelovsky Based on slides Dr. M. P. Frank and Dr. J.L. Gross
More informationn Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.7, 5.5) TOPICS Sets and Functions Propositional and Predicate Logic Logical Operators and Truth Tables Logical Equivalences and Inference
More informationCOMP 2600: Formal Methods for Software Engineeing
COMP 2600: Formal Methods for Software Engineeing Dirk Pattinson Semester 2, 2013 What do we mean by FORMAL? Oxford Dictionary in accordance with convention or etiquette or denoting a style of writing
More informationIntroducing Proof 1. hsn.uk.net. Contents
Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction
More informationThe statement calculus and logic
Chapter 2 Contrariwise, continued Tweedledee, if it was so, it might be; and if it were so, it would be; but as it isn t, it ain t. That s logic. Lewis Carroll You will have encountered several languages
More informationConjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.
Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is
More informationProposition logic and argument. CISC2100, Spring 2017 X.Zhang
Proposition logic and argument CISC2100, Spring 2017 X.Zhang 1 Where are my glasses? I know the following statements are true. 1. If I was reading the newspaper in the kitchen, then my glasses are on the
More informationWhere are my glasses?
Proposition logic and argument CISC2100, Spring 2017 X.Zhang 1 Where are my glasses? I know the following statements are true. 1. If I was reading the newspaper in the kitchen, then my glasses are on the
More informationDiscrete Structures of Computer Science Propositional Logic III Rules of Inference
Discrete Structures of Computer Science Propositional Logic III Rules of Inference Gazihan Alankuş (Based on original slides by Brahim Hnich) July 30, 2012 1 Previous Lecture 2 Summary of Laws of Logic
More informationPacket #1: Logic & Proofs. Applied Discrete Mathematics
Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should
More informationChapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.
Chapter 1 Chapter Summary Propositional Logic The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.3) Predicate Logic The Language of Quantifiers (1.4) Logical Equivalences (1.4)
More informationCSE 20: Discrete Mathematics
Spring 2018 Summary Last time: Today: Logical connectives: not, and, or, implies Using Turth Tables to define logical connectives Logical equivalences, tautologies Some applications Proofs in propositional
More informationLanguage of Propositional Logic
Logic A logic has: 1. An alphabet that contains all the symbols of the language of the logic. 2. A syntax giving the rules that define the well formed expressions of the language of the logic (often called
More informationANS: If you are in Kwangju then you are in South Korea but not in Seoul.
Math 15 - Spring 2017 - Homework 1.1 and 1.2 Solutions 1. (1.1#1) Let the following statements be given. p = There is water in the cylinders. q = The head gasket is blown. r = The car will start. (a) Translate
More informationChapter 1, Part I: Propositional Logic. With Question/Answer Animations
Chapter 1, Part I: Propositional Logic With Question/Answer Animations Chapter Summary Propositional Logic The Language of Propositions Applications Logical Equivalences Predicate Logic The Language of
More informationLogic (3A) Young W. Lim 11/2/13
Copyright (c) 2013. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software
More informationReview The Conditional Logical symbols Argument forms. Logic 5: Material Implication and Argument Forms Jan. 28, 2014
Logic 5: Material Implication and Argument Forms Jan. 28, 2014 Overview I Review The Conditional Conditional statements Material implication Logical symbols Argument forms Disjunctive syllogism Disjunctive
More informationPSU MATH RELAYS LOGIC & SET THEORY 2017
PSU MATH RELAYS LOGIC & SET THEORY 2017 MULTIPLE CHOICE. There are 40 questions. Select the letter of the most appropriate answer and SHADE in the corresponding region of the answer sheet. If the correct
More informationFirst-Degree Entailment
March 5, 2013 Relevance Logics Relevance logics are non-classical logics that try to avoid the paradoxes of material and strict implication: p (q p) p (p q) (p q) (q r) (p p) q p (q q) p (q q) Counterintuitive?
More informationLogic (3A) Young W. Lim 10/31/13
Copyright (c) 2013. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software
More informationPredicate Logic & Quantification
Predicate Logic & Quantification Things you should do Homework 1 due today at 3pm Via gradescope. Directions posted on the website. Group homework 1 posted, due Tuesday. Groups of 1-3. We suggest 3. In
More informationDISCRETE MATHEMATICS BA202
TOPIC 1 BASIC LOGIC This topic deals with propositional logic, logical connectives and truth tables and validity. Predicate logic, universal and existential quantification are discussed 1.1 PROPOSITION
More informationDERIVATIONS AND TRUTH TABLES
DERIVATIONS AND TRUTH TABLES Tomoya Sato Department of Philosophy University of California, San Diego Phil120: Symbolic Logic Summer 2014 TOMOYA SATO LECTURE 3: DERIVATIONS AND TRUTH TABLES 1 / 65 WHAT
More informationNatural Deduction for Propositional Logic
Natural Deduction for Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 10, 2018 Bow-Yaw Wang (Academia Sinica) Natural Deduction for Propositional Logic
More informationDiscrete Mathematics
Discrete Mathematics Chih-Wei Yi Dept. of Computer Science National Chiao Tung University March 9, 2009 Overview of ( 1.5-1.7, ~2 hours) Methods of mathematical argument (i.e., proof methods) can be formalized
More informationFirst Order Logic (1A) Young W. Lim 11/5/13
Copyright (c) 2013. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software
More informationMACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)
MACM 101 Discrete Mathematics I Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class) SOLUTIONS 1. Construct a truth table for the following compound proposition:
More information03 Propositional Logic II
Martin Henz February 12, 2014 Generated on Wednesday 12 th February, 2014, 09:49 1 Review: Syntax and Semantics of Propositional Logic 2 3 Propositional Atoms and Propositions Semantics of Formulas Validity,
More informationMaterial Implication and Entailment
510 Notre Dame Journal of Formal Logic Volume 29, Number 4, Fall 1988 Material Implication and Entailment CLARO R. CENIZA* The paradoxes of material implication have been called "paradoxes" of a sort because
More informationTHE LOGIC OF COMPOUND STATEMENTS
CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 2.1 Logical Form and Logical Equivalence Copyright Cengage Learning. All rights reserved. Logical Form
More informationAnalyzing Arguments with Truth Tables
Analyzing Arguments with Truth Tables MATH 100 Survey of Mathematical Ideas J. Robert Buchanan Department of Mathematics Fall 2014 Introduction Euler diagrams are useful for checking the validity of simple
More information1.3 Propositional Equivalences
1 1.3 Propositional Equivalences The replacement of a statement with another statement with the same truth is an important step often used in Mathematical arguments. Due to this methods that produce propositions
More information