Fundamentals of Logic Sentence: A sentence is usually collection of words Proposition: A proposition is usually a declarative to which it is meaningful.

Slides:



Advertisements
Similar presentations
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.
Advertisements

Propositional Equivalences
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.
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
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
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.
The Foundations: Logic and Proofs
Discrete Maths 2. Propositional Logic Objective
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
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.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
Chapter 1: The Foundations: Logic and Proofs
Chap. 2 Fundamentals of Logic. Proposition Proposition (or statement): an declarative sentence that is either true or false, but not both. e.g. –Margret.
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.
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
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.
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.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
Lecture 9 Conditional Statements CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
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.
Logic Terminology Statement- declarative sentence that is either true or false Opinion- a belief about matters commonly considered to be subjective,
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
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.
Discrete Mathematics Lecture # 4. Conditional Statements or Implication  If p and q are statement variables, the conditional of q by p is “If p then.
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.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
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.
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
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
 Conjunctive Normal Form: A logic form must satisfy one of the following conditions 1) It must be a single variable (A) 2) It must be the negation of.
Chapter 1 Propositional Logic
2. The Logic of Compound Statements Summary
DISCRETE MATHEMATICS CHAPTER I.
CSNB 143 Discrete Mathematical Structures
Discrete Mathematics Logic.
CS 202, Spring 2008 Epp, sections 1.1 and 1.2
Propositions and Logical Operations
(CSC 102) Discrete Structures Lecture 2.
Ch.1 (Part 1): The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Chapter 8 Logic Topics
2 Chapter Introduction to Logic and Sets
Conditional Statements
Information Technology Department
CHAPTER 1: LOGICS AND PROOF
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Logic.
MAT 3100 Introduction to Proof
Statements of Symbolic Logic
1.2 Propositional Equivalences
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
The Foundations: Logic and Proofs
Presentation transcript:

Fundamentals of Logic Sentence: A sentence is usually collection of words Proposition: A proposition is usually a declarative to which it is meaningful to assign one and only one of the truth values i.e. either “true” or “false” but now both. Proposition/ statement / premise Note: all propositions are sentences but all sentences need not be proposition. Examples – Propositions Sachin is a player. True 2+2=10 false It is raining false DMS is the subject of CSE true

Examples – Non propositions: It is good He is the tallest person in this class 2+x=10 What a beautiful morning! Get up and do your exercises The number x is an integer. Are you busy?

Negation: If p is a proposition, then "p is not true" is a proposition, which we represent as ~p or 7p, and refer to it as "not p”, "the negation of p", or "the denial of p". Not p is a proposition that is true when p is false and false when p is true Example: P: sachin is batsman. ~P: sachin is not batsman Q: sachin is not a tennis player ~Q: sachin is a tennis player

Conjunction: If p and q are propositions, then "p and q" is a proposition, which we represent in symbols as p ^ q and refer to it as the conjunction of p and q. The conjunction of p and q is true only when both p and q are true. Example: P: sachin is a batsman. Q: sachin is a bowler P ^ Q: sachin is batsman and bowler ~P ^ Q: sachin is not a batsman and he is a bowler P ^ ~Q: sachin is a batsman and he is not a bowler ~P ^ ~Q: neither sachin is a batsman nor bowler (or) sachin is not batsman and not a bowler

Disjunction: If p and q are propositions, then "p or q" is a proposition, which we represent in symbols as p V q and refer to it as the disjunction of p and q. Inclusive OR: either p is true or q is true or both Exclusive OR: either p is true or q is true but not both Example: P: sachin is a foot ball player. Q: sachin is a cricketer. P VQ: sachin is foot ball player or cricketer. ~PVQ: sachin is not a foot ball player or cricketer. PV~Q: sachin is foot ball player or he is not a cricketer ~PV~Q: sachin is not a foot ball player or not a cricketer

Conditional: The proposition "p implies q" or "if p then q" is represented as p→q and is called an implication or a conditional. P is called the premise, hypothesis, or antecedent of the implication, and q is called the conclusion or consequent of the implication. p →q is false only when the antecedent p is true and the consequent q is false. Example: P: 2 sides of a triangle are equal Q: triangle is isosceles p →q: if 2 sides of a triangle are equal then it is isosceles q→p: if triangle is isosceles then 2 sides of a triangle are equal ~p→q: if 2 sides of a ∆ are not equal then it is isosceles. p →~q: if 2 sides of a ∆ are equal then it is not isosceles.

Bi-Conditional: The proposition "p double implies q" or "p if and only if q" or “p iff q “ is represented as p ↔q and is called a bi-conditional. P is called the premise, hypothesis, or antecedent of the implication, and q is called the conclusion or consequent of the implication. p ↔q is true when both the statements are false / true p ↔q is false when any one of them is true Example: P: 2 sides of a triangle are equal Q: triangle is isosceles p ↔q: 2 sides of a ∆ are equal iff it is isosceles. q ↔p: Triangle is isosceles if and only if 2 sides of ∆ are equal ~p ↔q: 2 sides of triangle are not equal if and only if it is isosceles

If Conditional statement is P →Q then its Inverse or Opposite is ~P→~Q its Converse is Q→P its Contra positive is ~Q→~P Law of conditional / implication: P →Q = ~PVQ Law of contra positive : P →Q = ~Q→~P

Problems: Construct the truth tables for the following [(pVq)^(~r)] ↔q (pVq)^( (~p)v(~r) ) {(p^q)V(~p^r)} v (q^r) [ (pVq) ^ (~r) ] ↔ (q→r) Prove the following are tautologies ~(PVQ) V [ (~P) ^ Q ] V P [ (P →Q) ^ (R →S) ^ (PVR) ] → (QVS) [ (P →R) ^ (Q →R)] → [(PVQ) →R]

Consider the following propositions P: David is playing pool Q: David is inside R: David is doing his homework S: David is listening to music Translate following sentences into symbolic notations Either David is playing pool or he is inside Neither is David playing pool, nor is he doing his homework David is playing pool and not doing his homework David is inside doing his homework, not playing pool David is inside doing his homework while listening to music, and he is not playing pool David is not listening to music, nor is he playing pool, neither is he doing his homework.

Translate the following into acceptable English (~P) ^ (~Q) P V(Q^R) ~( (~P) ^R) [(~P)VQ] ^ [~R V S] [(~P) ^ Q] V [(~R) ^S] Restate the following implications into its equivalent ~pvq If he fails to follow orders, he will lose his commission. If the work is not finished on time then I am in trouble. If triangle is isosceles , then base angles are equal If K mart does not refund money, I will not shop there anymore. If lines AB & CD are parallel, then the alternate interior angles are equal.

6. Find the truth values for the following P= T, Q= F and R=F then find [ (P^~Q)→R] → [P →(QVR)] P=T, Q=T and (P^Q) → (RVS)= F then find R=?, S=?

Tautology: A tautology is a propositional function whose truth value is true for all possible values of the propositional variables. Example: PV~P Contradiction: A contradiction or absurdity is a propositional function whose truth value is false for all possible values of the propositional variables. Example: P ^ ~P Contingency: A propositional function that is neither tautology nor contradiction is called contingency Example: PVQ, P →Q