MATERI II PROPOSISI. 2 Tautology and Contradiction Definition A tautology is a statement form that is always true. A statement whose form is a tautology.

Slides:



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

Logic ChAPTER 3.
Introduction to Proofs
1 Valid and Invalid arguments. 2 Definition of Argument Sequence of statements: Statement 1; Statement 2; Therefore, Statement 3. Statements 1 and 2 are.
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
Propositional Equivalences. L32 Agenda Tautologies Logical Equivalences.
CS128 – Discrete Mathematics for Computer Science
Chapter 1 The Logic of Compound Statements. Section 1.2 – 1.3 (Modus Tollens) Conditional and Valid & Invalid Arguments.
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.
Introduction to Logic Logical Form: general rules
First Order Logic. Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not.
Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Mathematical Induction Assume that we are given an infinite supply of stamps of two different denominations, 3 cents and and 5 cents. Prove using mathematical.
Adapted from Discrete Math
1.5 Rules of Inference.
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.
Propositions and Truth Tables. Proposition: Makes a claim that may be either true or false; it must have the structure of a complete sentence.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Chapter 1: The Foundations: Logic and Proofs
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Conditional Statements CS 2312, Discrete Structures II Poorvi L. Vora, GW.
Discrete Mathematics. Propositional Logic 10/8/2015 What’s a proposition? PropositionsNot Propositions = 32Bring me coffee! CS173 is Bryan’s favorite.
Section 3.5 Symbolic Arguments
(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.
Tautologies, contradictions, contingencies
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
Reading: Chapter 4 (44-59) from the text book
SSK3003 DISCRETE STRUCTURES
Validity and Conditionals There is a relationship between validity of an argument and a corresponding conditional.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.3 Truth Tables for the Conditional and Biconditional.
Thinking Mathematically Arguments and Truth Tables.
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
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 1: The Foundations: Logic and Proofs
The Foundations: Logic and Proof, Sets, and Foundations PROPOSITIONS A proposition is a declarative sentence that is either True or False, but not the.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.4, Slide 1 3 Logic The Study of What’s True or False or Somewhere in Between 3.
LECTURE 1. Disrete mathematics and its application by rosen 7 th edition THE FOUNDATIONS: LOGIC AND PROOFS 1.1 PROPOSITIONAL LOGIC.
Analyzing Arguments Section 1.5. Valid arguments An argument consists of two parts: the hypotheses (premises) and the conclusion. An argument is valid.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
Lesson 2-1 Conditional Statements 1 Lesson 2-3 Conditional Statements.
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.
Lecture 10 Methods of Proof CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
CS104 The Foundations: Logic and Proof 1. 2 What is Discrete Structure?  Discrete Objects  Separated from each other (Opposite of continuous)  e.g.,
Simple Logic.
Chapter 1 Propositional Logic
2. The Logic of Compound Statements Summary
Conditional Statements
(CSC 102) Discrete Structures Lecture 2.
Chapter 8 Logic Topics
Information Technology Department
Argument Lecture 5.
3.5 Symbolic Arguments.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Conditional Statements
Discrete Mathematics Lecture # 8.
Truth Tables for the Conditional and Biconditional
6.4 Truth Tables for Arguments
1.3 Propositional Equivalences
Logic and Reasoning.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
3.5 Symbolic Arguments.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Truth Tables for Conditional and Biconditional Statements
Presentation transcript:

MATERI II PROPOSISI

2 Tautology and Contradiction Definition A tautology is a statement form that is always true. A statement whose form is a tautology is a tautological statement. A contradiction is a statement form that is always false. A statement whose form is a contradiction is a contradictory statement.

Definition If p and q are statement variables, the conditional of q by p is "If p then q" or "p implies q" and is denoted p → q. It is false when p is true and q is false; otherwise it is true. 3 Conditional Statements (Implication) pqp  q TTFFTTFF TFTFTFTF TFTTTFTT

Definition Suppose a conditional statement of the form “If p then q” is given. 1.The contrapositive is “If ~q then ~p” ( ~q → ~p ) 2.The converse is “If q then p“ (q → p) 3.The inverse is "If ~p then ~q" ( ~p → ~q ) 4 The Contrapositive, Converse and Inverse of a Conditional Statement

Definition Given statement variables p and q, the biconditional of p and q is "p if and only if q" and is denoted p ↔ q. It is true if both p and q have the same truth values and is false if p and q have opposite truth values. The words if and only if are sometimes abbreviated iff. 5 Biconditional (Biimplication) pqp ↔ q TTFFTTFF TFTFTFTF TFFTTFFT

Definition An argument is a sequence of statements (or proposition). All statements (or proposition) in an argument except for the final one, are called premises (or assumptions or hypotheses). The final statement or statement form is called the conclusion. The symbol, which is read "therefore," is normally placed just before the conclusion. To say that an argument is valid means that if the resulting premises are all true, then the conclusion is also true. 6 Valid and Invalid Arguments

Show that the following argument form is invalid. 7 An Invalid Argument Form

Show that the following argument form is valid 8 A Valid Argument Form

Exercises Use truth tables to determine whether the following argument forms are valid. 9