Propositional Logic 5) And Copyright 2008, Scott Gray.

Slides:



Advertisements
Similar presentations
Copyright 2008, Scott Gray1 Propositional Logic 3) Truth Tables.
Advertisements

Copyright 2008, Scott Gray1 Propositional Logic 9) Or.
Copyright 2008, Scott Gray1 Propositional Logic 4) If.
Logic & Critical Reasoning Translation into Propositional Logic.
Introduction to Proofs
6.1 Symbols and Translation
Logic 1 Statements and Logical Operators. Logic Propositional Calculus – Using statements to build arguments – Arguments are based on statements or propositions.
Logic 3 Tautological Implications and Tautological Equivalences
2-1 Making Decisions Sample assignment statements PayAmount = Hours * Rate PayAmount = 40*Rate + (Hours – 40)*Rate*1.5.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Reading: Chapter 4, section 4 Nongraded Homework: Problems at the end of section 4. Graded Homework #4 is due at the beginning of class on Friday. You.
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
1 Topic Mathematical Proofs. 2 Topic Mathematical Proofs California Standards: 24.2 Students identify the hypothesis and conclusion in logical.
Copyright © Cengage Learning. All rights reserved.
Lecture 8 Introduction to Logic CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Ch.1 (Part 1): The Foundations: Logic and Proofs Introduction.
Chapter 2 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Deduction, Proofs, and Inference Rules. Let’s Review What we Know Take a look at your handout and see if you have any questions You should know how to.
Methods of Proof involving  Symbolic Logic February 19, 2001.
Logic and Philosophy Alan Hausman PART ONE Sentential Logic Sentential Logic.
Chapter 1 Section 1.2 Symbolic Logic. Sentences vs Statements A truth value is one of two words either true (T) or false (F). A statement is a particular.
Symbolic Language and Basic Operators Kareem Khalifa Department of Philosophy Middlebury College.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
Introductory Logic PHI 120 Presentation: “Solving Proofs" Bring the Rules Handout to lecture.
Argument Diagramming Part I
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Chapter 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Formal Proofs and Boolean Logic Chapter 6 Language, Proof and Logic.
Properties of Real Numbers
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Copyright 2008, Scott Gray1 Propositional Logic 2) The Formal Language.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
Section 1.7. Definitions A theorem is a statement that can be shown to be true using: definitions other theorems axioms (statements which are given as.
Identifying Independent and Dependent Clauses.  An independent clause is a group of words that contains a subject and verb and expresses a complete thought.
Chapter Eight Predicate Logic Semantics. 1. Interpretations in Predicate Logic An argument is valid in predicate logic iff there is no valuation on which.
Conditional Statements
CSNB 143 Discrete Mathematical Structures
CISC 2315 Discrete Structures
Ch.1 (Part 1): The Foundations: Logic and Proofs
A Crash Course in Logic : Introduction to Philosophy
Conjunctions.
Symbolic Language and Basic Operators
The essay body Introduction: Main Body: Conclusion:
The Foundations: Logic and Proofs
Symbolization Review.
Connects words and phrases
Introductory Logic PHI 120
2-1 Making Decisions Sample assignment statements
Sets and Logic…. Chapter 3
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
Truth Trees.
Copyright © Cengage Learning. All rights reserved.
CS 270 Math Foundations of CS
TRUTH TABLES.
(1.4) An Introduction to Logic
The Logic of Declarative Statements
Foundations of Discrete Mathematics
Copyright © Cengage Learning. All rights reserved.
Statements and Logical Connectives
For Wednesday, read Chapter 4, section 3 (pp )
Compound sentences Grammar review #3.
Conjunctions.
Propositional Logic 1) Introduction Copyright 2008, Scott Gray.
Propositional Logic 7) Not Copyright 2008, Scott Gray.
Propositional Logic 8) Iff Copyright 2008, Scott Gray.
Perpendicular and Parallel Lines
Doing Derivation.
Introductory Logic PHI 120
The conditional and the bi-conditional
Presentation transcript:

Propositional Logic 5) And Copyright 2008, Scott Gray

Conjunctions Statements joined by AND The component statements are called “conjuncts” AND is represented by the ampersand: & Copyright 2008, Scott Gray

English Equivalents Bear is black and Coda is yellow. Bear is black, but Coda is yellow. Bear is black, however Coda is yellow. Bear is black, moreover Coda is yellow. Bear is black although Coda is yellow. Bear is black yet Coda is yellow. Bear is black even though Coda is yellow. All of these may be symbolized: B & Y Copyright 2008, Scott Gray

AND Reminders We view the conjuncts as being commutative There are occasions where you will need parentheses: A & B → C does this mean (A & B) → C or A & (B → C) Copyright 2008, Scott Gray

AND Gotchas Not every English “and” is a logical AND Are the following two sentences equivalent? Marvin and Nancy are cousins Marvin is a cousin and Nancy is a cousin Sometimes an English and should be represented as an arrow: Give us the tools of war and we shall finish the job You must think, not blindly see a word in English and use a logic operator which we have given the same name Copyright 2008, Scott Gray

More for Your Notebook Common introduction to conclusions: therefore so hence thus consequently it follows that proves that shows that Copyright 2008, Scott Gray

More for Your Notebook, cont. Common introduction to premises: since because for These follow conclusions and introduce premises – which means that sometimes the conclusion is stated before the premises Copyright 2008, Scott Gray

Ampersand In You can form a conjunction statement from two statements If you have a sentence Q and a sentence B, then you may write down Q & B The justification column has the two conjunct lines and “&I”; i.e.: 2,6 &I Copyright 2008, Scott Gray

Ampersand Out From a conjunction derive either conjunct If you have a sentence Q & P, you may write down Q (you may also write down P) The justification has the conjunction line and “&O”; i.e.: 3 &O Copyright 2008, Scott Gray

Ampersand Notes A & (B & C) is equivalent to (A & B) & C Can you prove this? 1 A & (B & C) A 2 A 1 &O 3 B & C 1 &O 4 B 3 &O 5 C 3 &O 6 A & B 2,4 &I 7 (A & B) & C 6,5 &I Copyright 2008, Scott Gray

Sample Proofs P → Q, P → R, P ∴ R & Q 1 P → Q A 2 P → R A 3 P A 4 Q 1,3 →O 5 R 2,3 →O 6 R & Q 5,4 &I Copyright 2008, Scott Gray

Sample Proofs, cont. (P & R) → (Q → T), Q → P, Q & (P → R) ∴ T 1 (P & R) → (Q → T) A 2 Q → P A 3 Q & (P → R) A 4 Q 3 &O 5 P → R 3 &O 6 P 2,4 →O 7 R 5,6 →O 8 P & R 6,7 &I 9 Q → T 1,8 →O 10 T 9,4 →O Copyright 2008, Scott Gray

Sample Proofs, cont. P & Q, P → R, Q → T ∴ R & T 1 P & Q A 2 P → R A 3 Q → T A 4 P 1 &O 5 Q 1 &O 6 R 2,4 →O 7 T 3,5 →O 8 R & T 6,7 &I Copyright 2008, Scott Gray

Sample Proofs, cont. (P & (P → R)) & (R → T) ∴ T 1 (P & (P → R)) & (R → T) A 2 P & (P → R) 1 &O 3 P 2 &O 4 P → R 2 &O 5 R 4,3 →O 6 R → T 1 &O 7 T 6,5 →O Copyright 2008, Scott Gray

Assignments Read Chapter 3 Do all of the exercises Be sure to ask me questions if you don’t understand something or can’t solve a problem Copyright 2008, Scott Gray