1 Propositional Logic Introduction. 2 What is propositional logic? Propositional Logic is concerned with propositions and their interrelationships. 

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

TRUTH TABLES Section 1.3.
TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
Logic & Critical Reasoning
1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: The Moon is made of green cheese. Trenton.
04 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Propositional Logic CMSC 471 Chapter , 7.7 and Chuck Dyer
DEDUCTIVE REASONING: PROPOSITIONAL LOGIC Purposes: To analyze complex claims and deductive argument forms To determine what arguments are valid or not.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 3 Syntax of Propositional Logic Parse trees revised Construction of parse trees Semantics of propositional.
Logic Chapter 2. Proposition "Proposition" can be defined as a declarative statement having a specific truth-value, true or false. Examples: 2 is a odd.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
Today’s Topics n Review Logical Implication & Truth Table Tests for Validity n Truth Value Analysis n Short Form Validity Tests n Consistency and validity.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
Let remember from the previous lesson what is Knowledge representation
The semantics of SL   Defining logical notions (validity, logical equivalence, and so forth) in terms of truth-value assignments   A truth-value assignment:
The Language of Propositional Logic The Syntax and Semantics of PL.
3.2 – Truth Tables and Equivalent Statements
TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.
The Foundations: Logic and Proofs
Intro to Discrete Structures
Propositions and Truth Tables
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Course Outline Book: Discrete Mathematics by K. P. Bogart Topics:
Chapter 8 Logic DP Studies. Content A Propositions B Compound propositions C Truth tables and logical equivalence D Implication and equivalence E Converse,
Discrete Maths 2. Propositional Logic Objective
Lecture for Week Spring.   Introduction to Propositional Logic  Types of Proposition  Operator and Truth table Agenda.
CS 285- Discrete Mathematics Lecture 2. Section 1.1 Propositional Logic Propositions Conditional Statements Truth Tables of Compound Propositions Translating.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
1 Propositional Logic Proposition 2 Propositions can be divided into simple propositions and compound propositions. A simple (or basic) proposition is.
1 Propositional Logic 2. Double Negation 2 not-(not-A)=Anot-(not-A)=A A= Ibrahim makes good coffee not-A= Ibrahim does not make good coffee not-(not-A)=Ibrahim.
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.
Math 240: Transition to Advanced Math Deductive reasoning: logic is used to draw conclusions based on statements accepted as true. Thus conclusions are.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
Chapter Three Truth Tables 1. Computing Truth-Values We can use truth tables to determine the truth-value of any compound sentence containing one of.
LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.
Chapter 7 Logic, Sets, and Counting
Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
How do I show that two compound propositions are logically equivalent?
Thinking Mathematically
Logic. Statements, Connectives, and Quantifiers In symbolic logic, we only care whether statements are true or false – not their content. In logic, a.
LOGIC.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
TRUTH TABLES. Introduction The truth value of a statement is the classification as true or false which denoted by T or F. A truth table is a listing of.
Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,
CS2351 Artificial Intelligence Bhaskar.V Class Notes on Knowledge Representation - Logical Agents.
Symbolic Logic The Following slide were written using materials from the Book: The Following slide were written using materials from the Book: Discrete.
Propositional Logic Rather than jumping right into FOL, we begin with propositional logic A logic involves: §Language (with a syntax) §Semantics §Proof.
Outline Logic Propositional Logic Well formed formula Truth table
رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.
Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.
Mathematics for Computing Lecture 2: Computer Logic and Truth Tables Dr Andrew Purkiss-Trew Cancer Research UK
TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.
Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.
Propositional and predicate logic
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Artificial Intelligence Logical Agents Chapter 7.
Chapter 1 Logic and proofs
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Logical functors and connectives. Negation: ¬ The function of the negation is to reverse the truth value of a given propositions (sentence). If A is true,
2. The Logic of Compound Statements Summary
Propositional Logic.
Information Technology Department
Propositional Logic CMSC 471 Chapter , 7.7 and Chuck Dyer
Presentation transcript:

1 Propositional Logic Introduction

2 What is propositional logic? Propositional Logic is concerned with propositions and their interrelationships.  Def: A proposition is a statement that is either true or false Deals with logic relationships between propositions (claims, statements, sentences) A proposition is a possible condition of the world that is either true or false Sometimes called “sentential logic” or “Statement logic” Is the branch of logic that studies ways of joining and/or modifying entire propositions to form more complicated propositions, as well as the logical relationships and properties J= “Ibrahim is wearing a red coat” Either Ganymede is a moon of Jupiter or Ganymede is a moon of Saturn

3 What is propositional logic? Propositional logic is interested in how the truth value of “compound claims” depends on the truth value of the individual claims that make it up. “Ibrahim is wearing a red coat”“he’s stealing a jeep” (True or False) “Ibrahim is wearing a red coat and he’s stealing a jeep” (T or F)

4 Propositional logic Logical constants: true, false Propositional symbols: P, Q, S,... (atomic sentences) Sentences are combined by logical connectives: ...and [conjunction] ...or [disjunction] ...implies [implication/conditional] ..is equivalent [biconditional] ...not [negation] Literal: atomic sentence or negated atomic sentence A and B A or B If A then B A==B not-A A and B A or B If A then B A==B not-A

5 Examples of PL sentences P means “It is hot.” Q means “It is humid.” R means “It is raining.” (P  Q)  R “If it is hot and humid, then it is raining” Q  P “If it is humid, then it is hot” A better way: Hot = “It is hot” Humid = “It is humid” Raining = “It is raining”

6 What is propositional logic? Basic compound claims that express logical relationships between the simpler sentences of which they are composed: Given the truth values of A, B, C and D Is the above claim as a whole True or False” “If (A or B) then (C and not-D))”

7 Propositional logic (PL) A simple language useful for showing key ideas and definitions User defines a set of propositional symbols, like P and Q. User defines the semantics of each propositional symbol:  P means “It is hot”  Q means “It is humid”  R means “It is raining” A sentence (well formed formula) is defined as follows:  A symbol is a sentence  If S is a sentence, then  S is a sentence  If S is a sentence, then (S) is a sentence  If S and T are sentences, then (S  T), (S  T), (S  T), and (S ↔ T) are sentences  A sentence results from a finite number of applications of the above rules

8 We are going to focus on: We are going to focus on: (Part I) the definitions of the basic compound claims: (Part 2) contradictories, contradictions, and consistency (Part 3) contradictories of compound claims: (Part 4) ways of saying “if A then B” “A and B”, “A or B”, “If A then B” “not-(A and B)”, “not-(A or B)”, “not-(If A then B)”

9 Conjunctions A and B

10 Conjunctions A and B A=“I love Chicken” B= “I hate Meat” A and B= “I love Chicken and I hate Meat” “A”=True “A”=True “A and B”= True and “A and B”= True and “B”=True “B”=True

Conjunctions A and B 11 AandB TTT TFF FFT FFF TRUTH TABLE TRUTH TABLE for the conjunction “A and B”

Conjunctions A and B 12 and Ibrahim is a father and Ibrahim is a teacher and a teacher Ibrahim is a father and a teacher but Ibrahim is a teacher but he doesn’t like chockAlthoughHoweveryet

Conjunctions A and B 13 One last Point: Is also conjunction, and follows the same logical rules as “A and B” “A and B and C and D and E”

14 Disjunctions A or B

15 Disjunctions A or B A=“Ibrahim is at the movies” B= “Ibrahim is at the library” or A or B= “Ibrahim is at the movies or Ibrahim is at the library”

Disjunctions A or B 16 “A triangle can be defined as a polygon with three sides or as a polygon with three vertices” (Inclusive OR) “ The coin landed either heads or tails” (Exclusive OR)

Disjunctions A or B 17 AorB TTT TTF FTT FFF TRUTH TABLE TRUTH TABLE for the disjunction “A or B” AorB TFT TTF FTT FFF Inclusive OR Exclusive OR

Disjunctions A or B 18 One last Point: Is also disjunction, and follows the same logical rules as “A or B” “A or B or C or D or E”

19 Conditionals: If A then B

20 Conditionals: If A then B If I miss the bus then I will be late for work. If I miss the bus then I will be late for work. ANTECEDENT CONSEQUENT ANTECEDENT CONSEQUENT If A Then B

Conditionals: If A then B 21 What does the conditional assert ((يأكد? ABABABAB If I eat much then I will be fat Doesn't assert that A is true Doesn’t assert that B is true Assert a logical relationship between A and B

Conditionals: If A then B 22 What does the conditional assert ((يأكد? AB If I live in MAKKA then I live in the Saudi (False) (False) (True)

Conditionals: If A then B 23 When is the conditional false? A B If I study hard then I will pass the exam Case I: I didn’t study hard (A is false) I pass the test (B is true) I pass the test (B is true) Case 2: I didn’t study hard (A is false) I didn’t pass the test (B is false) I didn’t pass the test (B is false) Case 3: I study hard (A is true) I didn’t pass the test (B is false) I didn’t pass the test (B is false)

Conditionals: If A then B 24 When is the conditional false? True False If I study hard then I will pass the exam A conditional claim is FALSE when The antecedent is True But The consequent is False

Conditionals: If A then B 25 AB TTT TFF FTT FTF TRUTH TABLE TRUTH TABLE for the CONDITIONAL “If A then B”

Equivalence (A B) The truth table 26 AB TTT TFF FFT FTF

27 Contradictories: not-A

A= “Ibrahim is at the home” The CONTRADICTORY of A: A claim that always has the OPPOSITE truth value of A Not-A ~ A ¬A Not-A=“Ibrahim is not at the home” 28

Contradictories: not-A 29 ANot-A TF FT TRUTH TABLE TRUTH TABLE for the CONTRADICTORY “not-A”

30 Models of complex sentences

31 Some terms The meaning or semantics of a sentence determines its interpretation. Given the truth values of all symbols in a sentence, it can be “evaluated” to determine its truth value (True or False). A model for a KB is a “possible world” (assignment of truth values to propositional symbols) in which each sentence in the KB is True.

32 More terms A valid sentence or tautology is a sentence that is True under all interpretations, no matter what the world is actually like or what the semantics is. Example: “It’s raining or it’s not raining.” An inconsistent sentence or contradiction is a sentence that is False under all interpretations. The world is never like what it describes, as in “It’s raining and it’s not raining.” P entails Q, written P |= Q, means that whenever P is True, so is Q. In other words, all models of P are also models of Q. (p → q) ˅ (p → q)

Truth Tables In general, a truth table for compound proposition will have rows, where n = number of unique propositional variables occurring in the expression. Count in binary with F being 0 and T being 1 to cover all cases. 33

Boolean logic properties  Associative:  (A and B) and C = A and (B and C)  (A or B) or C = A or (B or C)  Commutative:  A and B = B and A  A or B = B or A  Distributive:  (A and B) or C = (A or C) and (B or C)  (A or B) and C = (A and C) or (B and C)  Idempotent:  A and A = A  A or A = A  Transitive:  A → B and B → C implies A → C 34

35 Truth tables II The five logical connectives: A complex sentence:

36 Thank You!