Discrete Mathematics Tautology and Proofs

Slides:

Advertisements

Similar presentations

Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Mathematical Reasoning Methods of Proof.

Advertisements

Announcements Grading policy No Quiz next week Midterm next week (Th. May 13). The correct answer to the quiz.

Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:

1 Section 1.5 Rules of Inference. 2 Definitions Theorem: a statement that can be shown to be true Proof: demonstration of truth of theorem –consists of.

The Foundations: Logic and Proofs

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1 Addition of Integers Example: Add a = (1110) 2 and b = (1011) 2. a 0 + b.

Lecture 1.4: Rules of Inference CS 250, Discrete Structures, Fall 2014 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.

Muhammad Arief download dari

CSE115/ENGR160 Discrete Mathematics 01/26/12 Ming-Hsuan Yang UC Merced 1.

Valid Arguments An argument is a sequence of propositions. All but the final proposition are called premises. The last statement is the conclusion. The.

Laws of , , and  Excluded middle law Contradiction law P   P  T P   P  F NameLaw Identity laws P  F  P P  T  P Domination laws P  T  T P.

TR1413: Discrete Mathematics For Computer Science Lecture 4: System L.

Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.

Propositional Proofs 2.

Section 3.5 Symbolic Arguments

March 3, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1Arguments Just like a rule of inference, an argument consists of one or more.

10/17/2015 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(1) Dr.Saad Alabbad Department of Computer Science

Discrete Structures (DS)

Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.

From Truth Tables to Rules of Inference Using the first four Rules of Inference Modus Ponens, Modus Tollens, Hypothetical Syllogism and Disjunctive Syllogism.

Rules of Inference Dr. Yasir Ali.

Rules of Inference Section 1.6. Arguments in Propositional Logic A argument in propositional logic is a sequence of propositions. All but the final proposition.

What is Reasoning  Logical reasoning is the process of drawing conclusions from premises using rules of inference.  These inference rules are results.

Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Rules of inference.

Lecture 1.3: Predicate Logic, and Rules of Inference* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.

Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.

March 23 rd. Four Additional Rules of Inference  Constructive Dilemma (CD): (p  q) (r  s) p v r q v s.

Making Inferences with Propositions (Rules of Inference)

Applied Discrete Mathematics Week 5: Mathematical Reasoning

CSE15 Discrete Mathematics 01/30/17

Lecture 1.4: Rules of Inference

Discrete Mathematics Logic.

Discrete Mathematics.

Formal Logic CSC 333.

Chapter 1 Logic and Proofs Homework 1 Two merchants publish new marketing campaign to attract more customers. The first merchant launches a motto “Good.

Applied Discrete Mathematics Week 5: Mathematical Reasoning

Natural Deduction: Using simple valid argument forms –as demonstrated by truth-tables—as rules of inference. A rule of inference is a rule stating that.

Demonstrating the validity of an argument using syllogisms.

Proof Techniques.

Rules of Inference Section 1.6.

Questions for Discrete

CS100: Discrete structures

7.1 Rules of Implication I Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.

CS201: Data Structures and Discrete Mathematics I

Mathematical Reasoning

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Methods of Proof. Methods of Proof Definitions A theorem is a valid logical assertion which can be proved using Axioms: statements which are given.

Week #6 – 30 September / 2/4 October 2002 Prof. Marie desJardins

Deductive Reasoning: Propositional Logic

CS 270 Math Foundations of CS

CMSC Discrete Structures

THE REST The rest of the rules are not all that useful

CS 220: Discrete Structures and their Applications

Applied Discrete Mathematics Week 1: Logic

CS 103 Discrete Structures

Back to “Serious” Topics…

Concise Guide to Critical Thinking

Inference Rules: Tautologies

Malini Sen WESTERN LOGIC Presented by Assistant Professor

Natural Deduction Hurley, Logic 7.1.

Mathematics as a language

Discrete Mathematics Logic.

Foundations of Discrete Mathematics

Lecture 1.4: Rules of Inference

Mathematical Reasoning

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.

CS201: Data Structures and Discrete Mathematics I

The Foundations: Logic and Proofs

Conjunctive addition states that if we know that each of two statements is true, we can join them with the conjunction connective and the resulting conjunction.

Rules of inference Section 1.5 Monday, December 02, 2019

Presentation transcript:

Discrete Mathematics Tautology and Proofs = Forhad Ahmed Khan =

Rule of Inference TautologyNameProof Modus ponens P=If it snows today Q=we will go skiing Solve: If it snows today, then we will go skiing (¬q ∧ (p → q)) → ¬p Modus tollens P=If it snows today Q=we will go skiing ¬Q=we will not go skiing Solve: It's not snow today ((p → q) ∧ (q → r)) → (p → r) Hypothetical syllogism P=It is raining today Q=We will not have a barbecue today R=We will have a barbecue tomorrow Solve: If it rains today, then we will have a barbecue tomorrow ((p ∨ q) ∧ ¬p) → q Disjunctive syllogism

Rule of Inference TautologyNameProof p → (p ∨ q) AdditionP=It is below freezing now Q=It is raining now Solve: it is either below freezing or raining now (p ∧ q) → p SimplificationP=It is below freezing now Q=It is raining now Solve: It is below freezing and raining now ((p) ∧ (q)) → (p ∧ q) ConjunctionP=If it snows today Q=we will go skiing Solve: It snows today and we will go skiing ((p ∨ q) ∧ (¬p ∨ r)) → (q ∨ r) ResolutionP=It is snowing Q=Jasmine is skiing R=Bart is playing hockey Solve: Jasmine is skiing or it is not snowing and It is snowing or Bart is playing hockey imply that Jasmine is skiing or Bart is playing hockey.

Rule of Inference TautologyNameProof FallaciesP=You did every problem in this book Q=You learned discrete mathematics Solve: If you do every problem in this book, then you will learn discrete mathematics