Logical functors and connectives. Negation: ¬ The function of the negation is to reverse the truth value of a given propositions (sentence). If A is true,

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

TRUTH TABLES Section 1.3.
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.
Truth Tables Presented by: Tutorial Services The Math Center.
Sentential Logic. One of our main critical thinking questions was: Does the evidence support the conclusion? How do we evaluate whether specific evidence.
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.
DEDUCTIVE REASONING: PROPOSITIONAL LOGIC Purposes: To analyze complex claims and deductive argument forms To determine what arguments are valid or not.
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.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
Propositional Logic 7/16/ Propositional Logic A proposition is a statement that is either true or false. We give propositions names such as p, q,
Truth Tables for Negation, Conjunction, and Disjunction.
3.2 – Truth Tables and Equivalent Statements
TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.
Logic ChAPTER 3.
Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 4.
Conjunctions, Disjunctions, and Negations Symbolic Logic 2/12/2001.
The Foundations: Logic and Proofs
Conditional Statements M Deductive Reasoning Proceeds from a hypothesis to a conclusion. If p then q. p  q hypothesis  conclusion.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Chapter 8 Logic DP Studies. Content A Propositions B Compound propositions C Truth tables and logical equivalence D Implication and equivalence E Converse,
Lecture for Week Spring.   Introduction to Propositional Logic  Types of Proposition  Operator and Truth table Agenda.
CS 285- Discrete Mathematics Lecture 2. Section 1.1 Propositional Logic Propositions Conditional Statements Truth Tables of Compound Propositions Translating.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
CSci 2011 Textbook ^Discrete Mathematics and Its Applications,  Rosen  6th Edition  McGraw Hill  2006.
Normal Forms, Tautology and Satisfiability 2/3/121.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
3.3: Truth Tables. Types of Statements Negation: ~p Conjunction: p ˄ q (p and q) Disjunction: p V q (p or q, or both) Conditional: p → q (if p, then q)
LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.
Chapter 3: Semantics PHIL 121: Methods of Reasoning March 13, 2013 Instructor:Karin Howe Binghamton University.
Conditional Statements
Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.
MLS 570 Critical Thinking Reading Notes for Fogelin: Propositional Logic Fall Term 2006 North Central College.
Chapter 8 – Symbolic Logic Professor D’Ascoli. Symbolic Logic Because the appraisal of arguments is made difficult by the peculiarities of natural language,
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
How do I show that two compound propositions are logically equivalent?
Review Given p: Today is Thursday q: Tomorrow is Friday
Truth Tables Geometry Unit 11, Lesson 6 Mrs. King.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Logical Form and Logical Equivalence M Logical Form Example 1 If the syntax is faulty or execution results in division by zero, then the program.
3.1 Statements and Quantifiers 3.2 Truth Tables.  A statement is a declarative sentence that is either true or false.  Examples: Mr. Healey is my math.
1 Propositional Logic Introduction. 2 What is propositional logic? Propositional Logic is concerned with propositions and their interrelationships. 
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.
Propositional Logic A symbolic representation of deductive inference. Use upper case letters to represent simple propositions. E.g. Friday class rocks.
TRUTH TABLES. Introduction The truth value of a statement is the classification as true or false which denoted by T or F. A truth table is a listing of.
Logic The Lost Art of Argument. Logic - Review Proposition – A statement that is either true or false (but not both) Conjunction – And Disjunction – Or.
Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,
Sentential Logic.
Chapter 7 Evaluating Deductive Arguments II: Truth Functional Logic Invitation to Critical Thinking First Canadian Edition.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Invitation to Critical Thinking Chapter 7 Lecture Notes Chapter 7.
Outline Logic Propositional Logic Well formed formula Truth table
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.
Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.
Mathematics for Computing Lecture 2: Computer Logic and Truth Tables Dr Andrew Purkiss-Trew Cancer Research UK
TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.
Ms. Andrejko 2-2 Logic. Real World Legally Blonde.
Reasoning and Proof Chapter Use Inductive Reasoning Conjecture- an unproven statement based on an observation Inductive reasoning- finding a pattern.
Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.
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
Section 3.2: Truth Tables for Negation, Conjunction, and Disjunction
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
Propositional Logic.
MAT 3100 Introduction to Proof
Presentation transcript:

Logical functors and connectives

Negation: ¬ The function of the negation is to reverse the truth value of a given propositions (sentence). If A is true, then ¬A is false. If A is false then ¬A is true. In natural language the equivalent of negation is: it is not the case that X. or it is false that X. where X is a proposition.

p¬p P¬P TF FT It is raining. The negation: It is not true that it is raining. I love ice-cream. The negation: It is not the case that I love ice-cream.

Conjunction: ∧ ∧ Single propositions: P, Q – An action is good when it makes people happy. – Keeping your promises is always good. Conjunction: P ∧ Q – An action is good when it makes people happy, and keeping your promises is always good. – Conjuncts of P ∧ Q are P, Q.

How to analyze conjunction? Analysis of conjunctions 1.Ice cream is tasty and I love my dog. 2.I have a heart and a kidney. 3.I am married and I have two kids. – What are the conjuncts? – When is it true? – Truth table and definition of the conjunction. Definition of conjunction PQ P∧QP∧Q TTT TFF FTF FFF

Conjunctions in arguments Conjunction introduction 1.P 2.Q Therefore P ∧ Q Conjunction elimination 1.P ∧ Q Therefore P 1.P ∧ Q Therefore Q

Problematic examples for ∧ Justice and tolerance are valuable. Colleen and Errol got married. I went out and had dinner. One false move and I shoot. He was tired but he wanted to keep going.

Disjunction: v V Single propositions: P, Q – An action is good when it makes people happy. – Keeping your promises is always good. Disjunction: P V Q – Either an action is good when it makes people happy, or keeping your promises is always good. – Disjuncts of P V Q are P, Q.

How to analyze disjunction? Blue is a color or 7+3=10. I am a teacher or I am a man. You are students or you are young. It is raining now or it is Friday. – What are the disjuncts? – When is it true? – Truth table and definition of the disjunction.

Problematic disjunctions Either an action is good when it makes people happy, or keeping your promises is always good. Socrates is dead or Socrates is alive. A proposition is either true or false.

Inclusive and exclusive disjuntion Inclusive disjunction PQPVQ TTT TFT FTT FFF Exclusive disjunction PQ P⊕QP⊕Q TTF TFT FTT FFF

Find the difference inclusive or exclusive You either pass or fail this course. A person is either tall or blonde. It is either raining or it is not. One hour is exactly 55 minutes or 24 hours is 1440 minutes. America was discovered by Colombus or Americo Vespucci.

Disjunction types in arguments Valid inference: Disjunctive syllogism. 1.P ⊕ Q 2.¬P Therefore Q. A formal fallacy! Affirming the disjunct 1.PvQ 2.P Therefore ¬Q

Conditionals: ⊃ ⊃ Single propositions: P, Q – An action is good when it makes people happy. – Keeping your promises is always good. Conditional: P ⊃ Q: if P then Q. – If an action is good when it makes people happy then keeping your promises is always good. – Antecedent: P – Consequence: Q

Problematic cases for conditionals Which one is the antecedent? If P then Q If R, S D if E Z only if F If p refers always to the antecedent

The case of a biconditional p≡q P≡Q An action is good when it makes people happy if and only if keeping your promises is always good. IFF P≡Q is the same as (If P then Q) and (If Q then P).

Definition of a conditional? Conditional: P ⊃ Q PQ P⊃QP⊃Q TTT TFF FTT FFT P≡Q PQ TTT TFF FTF FFT Not (P and not Q) Not (P ⊕ Q)