CSE 2353 – September 4th 2002 Logic.

Slides:



Advertisements
Similar presentations
Propositional Equivalences
Advertisements

Propositional Equivalences
08 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
CS128 – Discrete Mathematics for Computer Science
Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
Chapter 9: Boolean Algebra
Discrete Mathematics Math 6A Instructor: M. Welling.
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.
Adapted from Discrete Math
Propositions and Truth Tables
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
MATH 213 A – Discrete Mathematics for Computer Science Dr. (Mr.) Bancroft.
Discrete Mathematics and Its Applications
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
1 Logic Logic is a discipline that studies the principles and methods used in correct reasoning It includes: A formal language for expressing statements.
Review I Rosen , 3.1 Know your definitions!
Chap. 2 Fundamentals of Logic. Proposition Proposition (or statement): an declarative sentence that is either true or false, but not both. e.g. –Margret.
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.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems or solving problems, creativity and insight.
September1999 CMSC 203 / 0201 Fall 2002 Week #1 – 28/30 August 2002 Prof. Marie desJardins.
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
Section 1.2: Propositional Equivalences In the process of reasoning, we often replace a known statement with an equivalent statement that more closely.
Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)
Discrete Mathematics CS 2610 September Equal Boolean Functions Two Boolean functions F and G of degree n are equal iff for all (x 1,..x n )  B.
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
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
Week 4 - Friday.  What did we talk about last time?  Floor and ceiling  Proof by contradiction.
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
Discrete Math by R.S. Chang, Dept. CSIE, NDHU1 Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Simple Logic.
2. The Logic of Compound Statements Summary
The Foundations: Logic and Proofs
Advanced Algorithms Analysis and Design
CSE15 Discrete Mathematics 01/23/17
Discrete Mathematics Lecture 1 Logic of Compound Statements
CSNB 143 Discrete Mathematical Structures
Chapter 1 – Logic and Proof
Discrete Mathematics Logic of Compound Statements
COMP 1380 Discrete Structures I Thompson Rivers University
6/20/2018 Arab Open University Faculty of Computer Studies M131 - Discrete Mathematics 6/20/2018.
Citra Noviyasari, S.Si, MT
MATH 245 Spring 2009 This is mathematics for computer science
CPCS222 Discrete Structures I
Discussion #10 Logical Equivalences
The Foundations: Logic and Proofs
Chapter 8 Logic Topics
Propositional Calculus: Boolean Algebra and Simplification
Propositional Equivalences
Information Technology Department
CS 220: Discrete Structures and their Applications
CHAPTER 1: LOGICS AND PROOF
Week #2 – 4/6 September 2002 Prof. Marie desJardins
Lecture 2: Propositional Equivalences
MAT 3100 Introduction to Proof
Cs Discrete Mathematics
COMP 1380 Discrete Structures I Thompson Rivers University
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
1.3 Propositional Equivalences
Discrete Structures Prepositional Logic 2
The Foundations: Logic and Proofs
Presentation transcript:

CSE 2353 – September 4th 2002 Logic

Review Propositions Operators Truth Tables Precedence Conditionals Implication Others Truth Tables Precedence Conditionals Contrapositive, Inverse, Converse Tautologies and Contradictions

Operations And (conjunction) ^ Or (inclusive disjunction) v Xor (exclusive disjunction) v Not (negation) ~  If … then (implication)   Iff (biconditional)  Nand | Nor  Construct sentences with words

Implication If p then q (otherwise q or ~q) Telecomm Example: “e” = equipped; “s” = in service; “d” = diags If s then e If d then e If s then d

Implication Consistency Check() If (s and e) or ~s then If (d and e) or ~d then If (s and d) or ~s then Return success Return failure

Implication Consistency check() Simpler code; multiple return points If (s and ~e) then return fail If (d and ~e) then return fail If (s and ~d) then return fail Return success Simpler code; multiple return points

Implication Consistency check() Simpler code; no branches; one return. Val = true; Val &= (~s or e); Val &= (~d or e); Val &= (~s or d); Return Val; Simpler code; no branches; one return.

Implication Simplest code. Or Return (~s or e) and (~d or e) and (~s or d); Or Return ( ~s or d) and (~d or e);

Duality Swap t,f Swap ^,v Example (p ^ q) v ~p Dual (p v q) ^ ~p If expressions are equivalent, so are duals

Arguments If you insulted Bob then I’ll never speak to you again. You insulted Bob so I’ll never speak to you again. Premise Conclusion

Arguments If you are a mathematician then you are clever. You are clever and rich. Therefore If you are rich then you are a mathematician. Premise Conclustion

Laws Idempotent Commutative Associative Absorption Distributive Involution De Morgan’s Complement

Laws Example Prove that (~p ^ q) v ~(p v q)  ~p.

Predicates Universal Quantifier  All rats are grey R(x): x is a rat. G(x): x is grey (x)[R(x) G(x)]

Predicates Existential Quantifier  Some rats are grey R(x): x is a rat. G(x): x is grey (x) [R(x) ^ G(x)]

Examples Some children didn’t apologize

Examples All students who did their homework passed the final exam.

Examples Some body set off the fire alarm and everybody left the building.

2 Place Predicates P(x,y) x + y = 7 (x)(y) [ P(x,y) ] is true (y) (x) [ P(x,y) ] is not true

Negation, Specification, and Generalization ~(x)[F(x)] = ~(x)[G(x)] =