Practice ~B  ((B  D)  D) tf-true? (M  ~N) & (M  N)tf-false? (B  H) & (B  ~H)tf-false, true or indeterminate? (C & (B  A)) and ((C&B)

Slides:



Advertisements
Similar presentations
Propositional Equivalences
Advertisements

Discrete Mathematics Lecture 1 Logic of Compound Statements
TRUTH TABLES Section 1.3.
Symbolic Logic: The Language of Modern Logic
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
Symbolization techniques Identify component propositions.
Today’s Topics n Symbolizing conditionals and bi-conditionals n Other complex symbolizations. n Unless.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
An Introduction to Propositional Logic Translations: Ordinary Language to Propositional Form.
Sentential Logic(SL) 1.Syntax: The language of SL / Symbolize 2.Semantic: a sentence / compare two sentences / compare a set of sentences 3.DDerivation.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter 2: The Logic of Compound Statements 2.1 Logical Forms and Equivalence 12.1 Logical Forms and Equivalences Logic is a science of the necessary laws.
Adapted from Discrete Math
IB Math Studies – Topic 3. IB Course Guide Description.
Predicates and Quantifiers
Chapter 20: Simple and Compound Statements. Compound Statements (pp )  A compound statement contains another statement as a proper part. Nontruth-functionally.
CSCI2110 – Discrete Mathematics Tutorial 8 Propositional Logic Wong Chung Hoi (Hollis)
More on Conditionals. Objectives Write the converse, inverse, and contrapositive of a given conditional statement. Determine the premise and conclusion.
Propositions and Truth Tables
A Modern Logician Said: By the aid of symbolism, we can make transitions in reasoning almost mechanically by eye, which otherwise would call into play.
Coordinating Conjunctions A coordinating conjunction, also called a coordinator, links parts of a sentence with the same status. This could be two independent.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Objectives 1. Statements, quantifiers, and compound statements 2. Statements involving the words not,
Grammar Bellringer # 14 Correcting Run-Ons & Comma Splices.
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.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.3 Logical Equivalence.
September1999 CMSC 203 / 0201 Fall 2002 Week #1 – 28/30 August 2002 Prof. Marie desJardins.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
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)
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Propositional Logic Symbolic logic If A, then B A  B Capital letters stand for simple sentences A simple sentence is an affirmative single statement “It’s.
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 1: The Foundations: Logic and Proofs
Logic Terminology Statement- declarative sentence that is either true or false Opinion- a belief about matters commonly considered to be subjective,
Discrete Mathematics Lecture # 7. Bi conditional  If p and q are statement variables, the bi conditional of p and q is  “ p if, and only if, q ” and.
Symbolization techniques Identify component propositions.
TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
 To combine propositions using connectives  To construct the truth table of a given compound proposition  To define de Morgan Law for logic  To define.
Law of logic Lecture 4.
Simple Logic.
Chapter 1 Propositional Logic
Introduction to Logic © 2008 Pearson Addison-Wesley.
Truth Tables for Negation, Conjunction, and Disjunction
Presented by: Tutorial Services The Math Center
AND.
DISCRETE MATHEMATICS CHAPTER I.
Today’s Topics Symbolizing conditionals and bi-conditionals
Lecture 1 – Formal Logic.
Thinking Mathematically
Truth Tables and Equivalent Statements
Truth Tables for Negation, Conjunction, and Disjunction
Logic.
Citra Noviyasari, S.Si, MT
CMSC Discrete Structures
Logic – Bell Ringer.
Symbolization Review.
The Lost Art of Argument
Propositional Equivalences
Information Technology Department
CS 220: Discrete Structures and their Applications
TRUTH TABLES.
TRUTH TABLES continued.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
Symbolic Logic 2/25/2019 rd.
Discrete Mathematics Lecture 2: Propositional Logic
Statements of Symbolic Logic
Presentation transcript:

Practice ~B  ((B  D)  D) tf-true? (M  ~N) & (M  N)tf-false? (B  H) & (B  ~H)tf-false, true or indeterminate? (C & (B  A)) and ((C&B)  A)tf-equivalent? {B&F, ~(B&G)}  G?

Symbolization techniques Identify component propositions

Symbolization techniques Identify component propositions The rent is due, and I have no money.

Symbolization techniques Identify component propositions The rent is due, and I have no money. The rent is due. I have no money.

Symbolization techniques Identify component propositions If the cat’s away, the mice will play.

Symbolization techniques Identify component propositions If the cat’s away, the mice will play. The cat is away (C) The mice will play (M)

Symbolization techniques Identify component propositions If the cat’s away, the mice will play. The cat is away (C) The mice will play (M) C  M

Symbolization techniques Identify component propositions Either the guest of honour wore brown, or he fell in the mud on the way to the party.

Symbolization techniques Identify component propositions Either the guest of honour wore brown, or he fell in the mud on the way to the party. The guest of honour wore brown (B) The guest of honour fell in the mud on the way to the party (M)

Symbolization techniques Identify component propositions Either the guest of honour wore brown, or he fell in the mud on the way to the party. The guest of honour wore brown (B) The guest of honour fell in the mud on the way to the party (M) B  M

Symbolization techniques Identify component propositions Sue and Tim are happy

Symbolization techniques Identify component propositions Sue and Tim are happy Sue is happy (S) Tim is happy (T) S & T

Symbolization techniques Identify component propositions Sue and Tim are happy, and they are throwing a party.

Symbolization techniques Identify component propositions Sue and Tim are happy, and they are throwing a party. Sue is happy (S) Tim is happy (T)

Symbolization techniques Identify component propositions Sue and Tim are happy, and they are throwing a party. Sue is happy (S) Tim is happy (T) Sue is throwing a party. (S 1 ) (?) Tim is throwing a party. (T 1 ) (?) They are throwing a party. (P) (?)

Symbolization techniques Identify component propositions Sue and Tim are happy, and they are throwing a party. Sue is happy (S) Tim is happy (T) Sue is throwing a party. (S 1 ) (?) Tim is throwing a party. (T 1 ) (?) They are throwing a party. (P) (?) (S&T) & (S 1 & T 1 ) (S&T) & P

Symbolization techniques Identify component propositions Sue and Tim are getting married.

Symbolization techniques Identify component propositions Sue and Tim are getting married. M S & T

Symbolization techniques Conjunction An explicit form of a conjunction: Sue is happy and Tim is happy – S & T

Symbolization techniques Conjunction An explicit form of a conjunction: Sue is happy and Tim is happy – S & T These are also conjunctions: A but B A however B A although B A nevertheless B A nonetheless B A moreover B

Symbolization techniques Conjunction An explicit form of a conjunction: Sue is happy and Tim is happy – S & T These are also conjunctions: A but B A however B A although B A nevertheless B A nonetheless B A moreover B She is poor, but honest. (P&H) A disjunction has two components, while a negation has only one. (D&N)

Symbolization techniques She is poor (P) It is true that she is poor (P) She certainly is poor (P)

Symbolization techniques Negation Explicit form: It is not the case that...

Symbolization techniques Negation Explicit form: It is not the case that... It is not the case that the temperature is rising

Symbolization techniques Negation Explicit form: It is not the case that... It is not the case that the temperature is rising The temperature is rising (R)

Symbolization techniques Negation Explicit form: It is not the case that... It is not the case that the temperature is rising (~R) The temperature is rising (R)

Symbolization techniques Negation Explicit form: It is not the case that... It is not the case that the temperature is rising (~R) The temperature is rising (R) It is false that the temperature is rising The temperature is not rising

Symbolization techniques Disjunction Explicit form: Either … or …

Symbolization techniques Disjunction Explicit form: Either … or … She’s either a lunatic or a genius.

Symbolization techniques Disjunction Explicit form: Either … or … She’s either a lunatic or a genius. Either she is a lunatic, or she is a genius L  G

Symbolization techniques Material Conditional Explicit form: If …, then…

Symbolization techniques Material Conditional Explicit form: If …, then… These are also conditionals equivalent to ‘If A, then C’ (A  C): If A, C C, if A C, provided that A C, given A A only if C

Symbolization techniques Material Conditional Explicit form: If …, then… These are also conditionals equivalent to ‘If A, then C’ (A  C): If A, C C, if A C, provided that A C, given A A only if C If these shoes go on sale, I’ll buy two pairs S  B

Symbolization techniques Material Conditional Explicit form: If …, then… These are also conditionals equivalent to ‘If A, then C’ (A  C): If A, C C, if A C, provided that A C, given A A only if C Only ifs I will go camping this weekend if I finish my work I will go camping this weekend only if I finish my work

Symbolization techniques Material Conditional Explicit form: If …, then… These are also conditionals equivalent to ‘If A, then C’ (A  C): If A, C C, if A C, provided that A C, given A A only if C Only ifs I will go camping this weekend if I finish my work I will go camping this weekend only if I finish my work If you buy a ticket, you will win the lottery Only if you buy a ticket, you will win the lottery

Symbolization techniques Material Conditional Explicit form: If …, then… These are also conditionals equivalent to ‘If A, then C’ (A  C): If A, C C, if A C, provided that A C, given A A only if C Only ifs I will go camping this weekend if I finish my work F  C I will go camping this weekend only if I finish my work C  F If you buy a ticket, you will win the lottery T  W Only if you buy a ticket, you will win the lottery W  T

Symbolization techniques Material Biconditional Explicit form: … if and only if …

Symbolization techniques Material Biconditional Explicit form: … if and only if … If a conjunction is true, then both conjuncts are true (C  B) A conjunction is true only if both conjuncts are true (B  C)

Symbolization techniques Material Biconditional Explicit form: … if and only if … If a conjunction is true, then both conjuncts are true (C  B) A conjunction is true only if both conjuncts are true (B  C) If a conjunction is true, then both conjuncts are true, and it is true only if both conjuncts are true ( (C  B) & (B  C) )

Symbolization techniques Material Biconditional Explicit form: … if and only if … If a conjunction is true, then both conjuncts are true (C  B) A conjunction is true only if both conjuncts are true (B  C) If a conjunction is true, then both conjuncts are true, and it is true only if both conjuncts are true ( (C  B) & (B  C) ) Both conjuncts are true if and only if the conjunction is true ( B  C )

Symbolization techniques Material Biconditional Explicit form: … if and only if … Sue is married to Tim if and only if Tim is married to Sue ( S  T )

Symbolization techniques Material Biconditional Explicit form: … if and only if … These are also biconditionals equivalent to A  B: A if but only if B A just in case B

Symbolization techniques Neither… nor… explicit form: both it is not the case that A and it is not the case that B: ~A & ~B

Symbolization techniques Neither… nor… explicit form: both it is not the case that A and it is not the case that B: ~A & ~B Neither Sue not Tim are throwing a party ~S & ~T

Symbolization techniques Neither… nor… explicit form: both it is not the case that A and it is not the case that B: ~A & ~B Neither Sue not Tim are throwing a party ~S & ~T Also correct symbolization is ~ (S  T)

Symbolization techniques Neither… nor… explicit form: both it is not the case that A and it is not the case that B: ~A & ~B Neither Sue not Tim are throwing a party ~S & ~T Also correct symbolization is ~ (S  T) De Morgan’s Laws: ~ (A&B)  (~A  ~B) ~ (A  B)  (~A & ~B)

Symbolization techniques Not both... and... explicit form: it is not the case that both A and B: ~ (A & B)

Symbolization techniques Not both... and... explicit form: it is not the case that both A and B: ~ (A & B) Not both Sue and Tim are throwing a party ~ (S & T)

Symbolization techniques Not both... and... explicit form: it is not the case that both A and B: ~ (A & B) Not both Sue and Tim are throwing a party ~ (S & T) Also correct symbolization is ~S  ~T, because of De Morgan’s Laws: ~ (A&B)  (~A  ~B) ~ (A  B)  (~A & ~B)

Symbolization techniques … unless … explicit form: either A or B if it is not the case that A then B if it is not the case that B then A

Symbolization techniques … unless … explicit form: either A or B if it is not the case that A then B if it is not the case that B then A You and I can be friends unless you take advantage of me F  A ~ A  F ~ F  A