MAIN TOPIC : Statement, Open Sentences, and Truth Values Negation Compound Statement Equivalency, Tautology, Contradiction, and Contingency Converse, Inverse,

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

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.
Constructing a Truth Table
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.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
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.
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.
Adapted from Discrete Math
3.2 – Truth Tables and Equivalent Statements
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
The Foundations: Logic and Proofs
Propositions and Truth Tables
1.1 Sets and Logic Set – a collection of objects. Set brackets {} are used to enclose the elements of a set. Example: {1, 2, 5, 9} Elements – objects inside.
Chapter 1 Section 1.4 More on Conditionals. There are three statements that are related to a conditional statement. They are called the converse, inverse.
Conditional Statements M Deductive Reasoning Proceeds from a hypothesis to a conclusion. If p then q. p  q hypothesis  conclusion.
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
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
Discrete Mathematics and Its Applications
Lecture for Week Spring.   Introduction to Propositional Logic  Types of Proposition  Operator and Truth table Agenda.
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
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.
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
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.
The Foundations Logic and Proofs by raedRASHEED 2014.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
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.
Chapter 8 – Symbolic Logic Professor D’Ascoli. Symbolic Logic Because the appraisal of arguments is made difficult by the peculiarities of natural language,
Lecture 9 Conditional Statements CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
How do I show that two compound propositions are logically equivalent?
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
6.1 Logic Logic is not only the foundation of mathematics, but also is important in numerous fields including law, medicine, and science. Although the.
Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Chapter 1: The Foundations: Logic and Proofs
Conditional Statements – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Conditional Statements Reading: Kolman, Section 2.2.
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,
LECTURE 1. Disrete mathematics and its application by rosen 7 th edition THE FOUNDATIONS: LOGIC AND PROOFS 1.1 PROPOSITIONAL LOGIC.
رياضيات متقطعة لعلوم الحاسب 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
Ms. Andrejko 2-2 Logic. Real World Legally Blonde.
Conditional statement or implication IF p then q is denoted p ⇒ q p is the antecedent or hypothesis q is the consequent or conclusion ⇒ means IF…THEN.
 Statement - sentence that can be proven true or false  Truth value – true or false  Statements are often represented using letters such as p and q.
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.
Chapter 1 Logic and proofs
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Simple Logic.
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
PROPOSITION AND NOT PROPOSITION
DISCRETE MATHEMATICS CHAPTER I.
CSNB 143 Discrete Mathematical Structures
Logic.
Chapter 8 Logic Topics
Information Technology Department
(1.4) An Introduction to Logic
Discrete Mathematics and Its Applications Kenneth H
Presentation transcript:

MAIN TOPIC : Statement, Open Sentences, and Truth Values Negation Compound Statement Equivalency, Tautology, Contradiction, and Contingency Converse, Inverse, and Contraposition Statement with Quantor Making Conclusion Direct and Inderct Proof

The Statements, Open Sentences, and Truth Values 1.Statement and Open Sentences Definition of proposition : “ Proposition is a sentence, which can explain something true or false ” Definition of open sentence : “ Open sentence is the sentence, not proposition. We can declare the open sentence as a proposition by changing the variabel with certain value “

1.Determine whether the following sentences are propositions! a. Jakarta is the capital city of Indonesia. b. The root of the equation 2x + 8 = 0 is 4 c. Is a 2 a prime number? d. 2x + 6 = 0 Answer : a. The sentence (a) declares something, that is Jakarta can be either the capital city of Indonesia or not. Actuallly, Jakarta is the capital city of Indonesia. Thus, that sentence is a true proposition. b. By solving the equation 2x + 8 = 0 we will get x = -4 which is the root of that equation. Thus, that sentence is a false proposition. c. The sentence (c) doesn’t explain, but ask something. Thus, that sentence is not a proposition, but a question. d. The sentence (d) is not a proposition. If we subtitude x = -3, we will get a true proposition, but if we subtitude x= 2, we will get false propotion. This kind of sentence is known as open sentence.

2. Which sentences are including open sentences! Solve those open sentences! a. 2x + 2 < 5, x Є natural number. b. sin 30° = 1 √ 2 2 Answer : a. 2x + 2 < 5, x Є natural number is an open sentence. If x = 1, then < 5 is a true proposition. If x = 2, then < 5 is a false proposition. Thus, x = 1 is a solutionof 2x + 2 < 5 whereas x = 2 or x greater than 2 is not a solution. So the solution set is {1}. b. sin 30 ° = 1 √2 is not open sentence, but rather a false proposition because 2 sin 30˚ = 1. 2

Notation and the Truth Value of a Proposition In mathematical logic, a proposition is usually written by the small letters p,q,r, … etc. For example, proposition “ = 5 “ and proposition “ Human Is breathing with lungs “ can be written respectively as follows. p : = 5 q : Human is breathing with lungs. From the defenition of proposition, we understand that a propotition can be only true or false. Thus, the truth value of a proposition is only true ( T) or false (F). The truth value of a proposition can be denoted as. For the example above, we have : (p) : F ( read : the truth value of p is false ) (q) : T ( read : the truth value of q is true )

Determine the truth value of the following propotition! 1. p : The sum of angels in any triangles is 360˚. 2. q : 27 can be divided by r : √2 is a irational number. 4. s : One hour is equal to 360 seconds. Answer : 1.(p) = F 2.(q) = F 3.(r) = T 4.(s) = F

Negation The negation from the first propotition is called negation from the first propotition. The notation of the negation from the propotition p is ~p. If the propotition ~p is false and conversely if p is false, then ~p would be true. As seen beside, we can understand the proposition and its negation by using The truth table. TheTruth Table of Proposition and Its Negation : p~p T F F T TheTruth Table of Proposition and Its Negation : p~p T F F T

State the regation of the following propositions, and then determine their truth values! 1. 2 is a prime number. 2. The symmetry line of y = x² - 4x – 5 is x =5 3. x² + 5x + 10 = 0 has two distinct roots. Answer : 1. p: 2 is a prime number. ~p : 2 is not a prime number. Because (p) = T, then (~p) = F. 2. q: The symmetry line of y = x² - 4x – 5 is x =5 ~q: Not true that symmetry line of y = x² - 4x – 5 is x =5 Because (q) =F, then (~q) = T 3.r: x² +5x +10 = 0 has two distinct roots. ~r: x²+5x+10 = 0 has not two distinct roots. Because (r) = F, then (~r) = T.

Compound Statement Definition : A compound statement is a sentence that contains at least two simple prepotitions. Compound statement is constructed from simple propositions using connectives such as AND; OR; IF … THEN …; and … IF AND ONLY IF … In mathematical logic, the four connectives above respectively are written as AND (٨); OR ( v ); IF … THEN … ( → ); and … IF AND ONLY IF … ( ↔ ).

“ The Forms of Compound Statement “ “ The Forms of Compound Statement “ 1. Conjunction 2. Disjunction 3. Implication 4. Biimplication

Conjunction Conjunction is a kind of compound statements,, which uses a connecticve “AND”. Conjunction of two simple statements p and q denoted as p ٨q and read as : p and q. Conjunction is a logical operation that results in a value of true if both of its operands are true, otherwise a value of false. Look at the truth of Conjunction beside. The Truth Table of Conjunction p٨q p qp ٨q TTT TFF FTF FFF

Find the truth values of the following conjunctions! 1.The Java Island is greater than Irian Island and 2 is an even number 2.The quadratic equation x² - ( 3k + 2 )x + ( 2k² + 3k ) = 0 has two real numbers and Semarang is the capital of Central Java. Answer : 1.p : The Java Island is greater than Irian Island. q : 2 is a even number. Based on the truth table of conjunction, because (p) = F and (q) = T, then (p٨q) = T. 2.p : The quadratic equation x² - ( 3k + 2 )x + ( 2k² + 3k ) = 0 has two real numbers roots. q : Semarang is the capital of Central Java. Based on the truth table of conjunction, because (p) = T and (q) = T, then (p٨q) = T.

D i s j u n c t i o n Disjunction is a kind of compound statements, which uses a connective “BUT”. Disjunction of two simple statements p and q denoted as p v q and read as p or q. Disjunction is logical operation that produces a value of false if and only if both of its operand are false. Thus, the disjunction will result in true whenever one or more of its operands are true. Look at the truth table of disjunction beside. The Truth Table of Disjunction p v q p qp v q TTT TFT FTT FFF

Find the truth values of the following disjunctions! 1.²log 3. ³log 8 = 3 or Yogyakarta is an educational city. 2.The minimum value of ƒ (x) = -2 sin x is -1 or the solution set of 3 2x-2 = 1 is { 0 }. 3 Answer : 1.p : 2 log 3. 3 log 8 = 3 q : Yogyakarta is an educational city. Based on the truth table of disjunction, because (p)= T and (q)= T; then (p v q) = T. 2.p : The minimum value of f (x) = -2 sin x is -1. q : The solution set of 3 2x-2 = 1 is { 0 }. 3 Based on the truth table of disjunction, because (p)= F and (q)= F ; then (p v q)= F.

Implication Implication or conditional statement is a kind of compound statements, which uses A connective “IF … THEN … “. The implication of two simple statements p and q denoted as p → q and read as if p then q. In such an implication, p is called the antecedent, while q is called the consequent. Implication will produce a value of false only in the case, the first operand (antecedent ) is true and the second operand ( consequent ) is false. Look at the truth table of implication beside. The Truth Table of Implication p → q p qp→q TTT TFF FTT FTT FFT FFT

“ NOTE “ The implication p → q can read as : a)J ika p, then q b)p only if q c)q if p d)p is sufficient condition for q e)q is necessary condition for p

Find the truth values of the following implications! 1.If log 5 + log 15 = log 20, then log 15 – log 5 = log 3 2.If 1 = 1 √5 + 1 √2, then cos 30 ˚ = 1 √5 - √ Answer : 1.p : log 5 + log 15 = log 20 q : log 15 – log 5 = log 3 Based on the truth table of implication, because (p) = F and (q) = T, thus (p→q) =T. 2. p : 1 = 1 √5 + 1 √2 √5 - √2 3 3 q : cos 30˚ = 1 2 Because on the truth table of implication, because (p) = T and (q) = F, thus (p→q) = F

Biimplication Biimplication of two simple statements p and q denoted as p ↔ q read as p if and only if q. A biimplication will produce a value of true only in the case the first operand (antecedent ) and the second operand ( consequent ) have the same truth value, whether true or false. Look at the truth table of biimplication beside. The Truth Table of Biimplication p → q p qp↔q TTT TFF FTF FFT

Find the truth values of the following biimplications! 1. 2 log 16 = 4 if and only if 2 4 = 16 2.x 2 – x – 2 = 0 has two real roots if and only if x 2 – 2x + 6 = 0 has real root. Answer : 1.p : 2 log 16 = 4 q : 2 4 = 16 Based on the truth table of biimplication, because (p) = T and (q) = T thus (p↔q) = F. 2.p : x 2 – x – 2 = 0 has real root q : x 2 – 2x + 6 = 0 has real root Based on the truth table of biimplication, because (p) = T and (q) = F thus (p ↔q) =F.

Equvalence, Tautology, Contradiction, and Contingency Definition : Two compound statements A and B are logically equivalent if thet have The same truth, denoted by A B. The Truth Table of Equivalence pq~pp→q~p v q TT F T T TF F F F FT T T T FF T T T Truth Table

Thank You