Propositional Logic.

Slides:



Advertisements
Similar presentations
Copyright © Peter Cappello Propositional Logic. Copyright © Peter Cappello Sentence Restrictions Building more precise tools from less precise tools Precise.
Advertisements

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.
2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.
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.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
1 Section 1.1 Logic. 2 Proposition Statement that is either true or false –can’t be both –in English, must contain a form of “to be” Examples: –Cate Sheller.
Copyright © Peter Cappello 2013 Propositional Logic.
What is the hypothesis in the sentence “I go swimming if the sun is out and the temperature is over 80.” 1.I go swimming 2. the sun is out 3.the temperature.
CSE 321 Section 1. Draw a picture of yourself Click on the envelope with wings to submit.
Adapted from Discrete Math
Predicates and Quantifiers
The Foundations: Logic and Proofs
Propositions and Truth Tables
Propositions and Truth Tables. Proposition: Makes a claim that may be either true or false; it must have the structure of a complete sentence.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
2009/9 1 Logic and Proofs §1.1 Introduction §1.2 Propositional Equivalences §1.3 Predicates and Quantifiers §1.4 Nested Quantifiers §1.5~7 Methods of Proofs.
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.
CS 285- Discrete Mathematics Lecture 2. Section 1.1 Propositional Logic Propositions Conditional Statements Truth Tables of Compound Propositions Translating.
Chapter 1: The Foundations: Logic and Proofs
Propositional Logic Dr. Yasir Ali. Formal or propositional logic was first developed by the ancient Greeks, who wanted to be able to reason carefully.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
1 Section 1.1 A Proof Primer A proof is a demonstration that some statement is true. We normally demonstrate proofs by writing English sentences mixed.
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
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.
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.
MAIN TOPIC : Statement, Open Sentences, and Truth Values Negation Compound Statement Equivalency, Tautology, Contradiction, and Contingency Converse, Inverse,
Thinking Mathematically
6.1 Logic Logic is not only the foundation of mathematics, but also is important in numerous fields including law, medicine, and science. Although the.
Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)
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
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
Logic The Lost Art of Argument. Logic - Review Proposition – A statement that is either true or false (but not both) Conjunction – And Disjunction – Or.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
LECTURE 1. Disrete mathematics and its application by rosen 7 th edition THE FOUNDATIONS: LOGIC AND PROOFS 1.1 PROPOSITIONAL LOGIC.
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.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
CS104 The Foundations: Logic and Proof 1. 2 What is Discrete Structure?  Discrete Objects  Separated from each other (Opposite of continuous)  e.g.,
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Simple Logic.
Chapter 1 Propositional Logic
2. The Logic of Compound Statements Summary
Conditional Statements
CSNB 143 Discrete Mathematical Structures
Truth Tables and Equivalent Statements
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
Logic.
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Chapter 8 Logic Topics
Information Technology Department
CS 220: Discrete Structures and their Applications
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Copyright © Cengage Learning. All rights reserved.
(1.4) An Introduction to Logic
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Lecture 2: Propositional Logic
PROPOSITIONAL LOGIC - SYNTAX-
MAT 3100 Introduction to Proof
Discrete Mathematics Lecture 2: Propositional Logic
Equivalent Statements
Do Now:.
The Foundations: Logic and Proofs
Presentation transcript:

Propositional Logic

Sentence Restrictions Precise use of natural language is difficult. Want a notation that is suited to precision. Restrict discussion to sentences that are: declarative either true or false but not both. Such sentences are called propositions.

Examples of propositions Which of the sentences below are propositions? “Mastercharge, dig me into a hole!” “Peter Cappello thinks this class is fascinating.” “Do I exist yet?” “This sentence is false.”

5 Basic Connectives Not (~): p is true exactly when ~p is false. Let p denote “This class is the greatest entertainment since the Entourage.” ~p denotes “It is not the case that this class is the greatest entertainment since the Entourage.”

Or operator (disjunction) Or ( ): proposition p  q is true exactly when either p is true or q is true:

And operator (conjunction) And ( ): proposition p  q is true exactly when p is true and q is true:

If and only if operator (iff) If and only if (): proposition p  q is true exactly when (p  q) or (~ p  ~ q):

Exclusive-Or Exclusive-or (  ) is the negation of  .

Implies operator (if … then) Implies (): proposition p  q is true exactly when p is false or q is true:

If … then ... Example: “If pigs had wings they could fly.” In English, use of implies normally connotes a causal relation: p implies q means that p causes q to be true. Not so with the mathematical definition! If 1  1 then Peter hates Family Guy.

Converse & inverse The converse of p  q is q  p. The inverse of p  q is ~p  ~q. The contrapositive of p  q is ~q  ~p. If p  q then which, if any, is always true: Its converse? Its inverse? Its contrapositive? Use a truth table to find the answer. Describe the contrapositive of p  q in terms of converse & inverse.

p  q may be expressed as p implies q if p then q p only if q (if ~q then ~p) q if p q follows from p q provided p q is a consequence of p q whenever p q is a necessary condition for p (if ~q then ~p) p is a sufficient condition for q

Capturing the form of a Proposition in English Let g, h, and b be the propositions g: Grizzly bears have been seen in the area. h: Hiking is safe on the trail. b: Berries are ripe along the trail. Translate the following sentence using g, h, and b, and logical operators: If berries are ripe along the trail, hiking is safe on the trail if and only if grizzly bears have not been seen in the area.

If berries are ripe along the trail, hiking is safe on the trail if and only if grizzly bears have not been seen in the area. If b, (h if and only if  g). b  ( h   g).