The Structure of Sentential Logic

Slides:



Advertisements
Similar presentations
Logic & Critical Reasoning Translation into Propositional Logic.
Advertisements

Preview of SL Logic Class 3. Either it is raining or it is snowing A A: It is raining B: It is snowing B  : Or 
Chapter Two Symbolizing in Sentential Logic This chapter is a preliminary to the project of building a model of validity for sentential arguments. We.
Simple & compound sentences
Today’s Topics Logical Syntax Logical Syntax o Well-Formed Formulas o Dominant Operator (Main Connective) Putting words into symbols Putting words into.
2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
PHIL 120: Jan 8 Basic notions of logic
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.
Let remember from the previous lesson what is Knowledge representation
Propositional Logic USEM 40a Spring 2006 James Pustejovsky.
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.
The Language of Propositional Logic The Syntax and Semantics of PL.
Copyright © Cengage Learning. 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
The Foundations: Logic and Proofs
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
English II Sentence Notes. So… what is a sentence? A sentence is a group of words with a subject and a verb that expresses a complete thought. Ex. The.
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
Chapter 1: The Foundations: Logic and Proofs
The Language S : Æ Ç ! $.
2.2 Statements, Connectives, and Quantifiers
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Objectives 1. Statements, quantifiers, and compound statements 2. Statements involving the words not,
Introductory Logic PHI 120 Presentation: “Basic Concepts Review "
Today’s Topics Review of Sample Test # 2 A Little Meta Logic.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
Logic. Statements, Connectives, and Quantifiers In symbolic logic, we only care whether statements are true or false – not their content. In logic, a.
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 1: The Foundations: Logic and Proofs
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.
Introduction to Logic Lecture 13 An Introduction to Truth Tables By David Kelsey.
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.
A sentence in English What we need to write a sentence.
INTRODUCTION TO LOGIC. PURPOSE: – To distinguish good arguments from poor ones Arguments consist of STATEMENTS – A statement is a sentence that can be.
Sentential logic. Lecture based on: Graeme Forbes, Modern Logic Katarzyna Paprzycka, online lectures.
Chapter 1 Propositional Logic
Logic.
Conditional Statements
AND.
Logic.
More sentence structure stuff…
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Chapter 8 Logic Topics
Simple, Complex, & Compound Sentences
CSCI 3310 Mathematical Foundation of Computer Science
Simple, Compound and Complex Sentences.
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
Section 3.1 Statements and Logical Connectives
CHAPTER 1: LOGICS AND PROOF
Copyright © Cengage Learning. All rights reserved.
Back to “Serious” Topics…
Discrete Mathematics and Its Applications Kenneth H
Phrases, Clauses, Simple Sentences and Compound Sentences
Discrete Mathematics Lecture 2: Propositional Logic
Statements of Symbolic Logic
Phrases, Clauses, Simple Sentences and Compound Sentences
CHAPTER 3 Logic.
Statements and Logical Connectives
Sentence Structure: Sentence Types
Logic of Informatics Introduction.
Review of the structure of sentences
Simple, compound and complex sentences
The Foundations: Logic and Proofs
Truth tables.
Presentation transcript:

The Structure of Sentential Logic

Objectives Distinguish between simple and compound sentences and be able to identify the simple components of compound sentences. Learn the definitions of sentential operator, compound sentence, and simple sentence. Learn five sentential operators and the symbols for them. Learn how compound formulas are constructed out of more elementary parts.

Compound Sentence It contains another complete declarative sentence as a component Compound or not? John loves Mary and Mary loves David. The person who ate the cake has a guilty conscience. John went to New York and Mary went to New York. Mary will be a good student or a good tennis player. (1) A compound sentence (2) Not a compound sentence because the phrase who ate the cake is not a complete declarative sentence. (3) Not a compound sentence. It just has a compound subject. This may be written as John and Mary went to New York. (4) Compound. It has a compound predicate. Mary will be a good student or Mary will be a good tennis player.

Compound Sentences Sentences with compound subjects and/or compound predicates will be considered compound if they can be paraphrased into sentences that are explicitly compound. One sentence contains another if it literally contains the other as a component or it can be paraphrased into an explicitly compound sentence.

Cases when you cannot tell whether the sentence is genuinely compound or just stating a relationship John and Mary are married The art of paraphrasing is not exact

The ff. Sentences are all simple Jose is happy. Dogs like bones. Children fight a lot. Keith likes bananas on his porridge. The man standing by the door is a doctor. The President liked to have complete silence during his many long, tedious speeches about the virtues of democratic government.

The ff. Sentences are all compound Jose and Maria like cats. John likes cats and snakes. Harvey thinks that the earth is flat. If there are flying saucers, then fish live in trees. Jose, Maria and Harvey like lobster and Big Macs.

A Sentential operator Is an expression containing blanks such that, when the blanks are filled with complete sentences, the result is a sentence. There are a lot of sentential operators in English, although we will be using only 5 in sentential logic.

A Sentential operator in Logic Either _____ or _____ Neither _____ nor _____ _____ and _____ If _____, then _____ _____ if and only if _____ _____ unless _____ _____ after _____ _____ only if _____ _____ because _____

5 Sentential operators  or  Negation Not  p Or p , & or  Technical Name Meaning Example  or  Negation Not  p Or p , & or  Conjunction And p  q V Disjunction Or p v q  or V Exclusive OR XOR p  q ,  or  Conditional Implication If ___ then ____ p  q , , iff or  Biconditional If and only if p  q

5 Sentential operators In p  q, p and q are called conjuncts. In p v q, p and q are called disjuncts. In p  q, p is the antecedent, q is the consequent. We will use single capital letters to represent simple English sentences. (4) Will use the first letter of the sentence or anything that reminds use of the meaning of the sentence.

5 Sentential operators and () Let P be P-Noy is president, B be Binay is vice-president. E be Erap is president. M be Mar Roxas is vice-president. Convert these into symbols: Binay is vice-president and P-Noy is president. Erap or P-Noy is president. Binay is vice-president if and only if P-Noy is president. If Binay is vice-president, then P-Noy is president. Erap is not the president. Not both Erap and P-Noy are president. Either Erap is president and Binay is vice-president, or P-Noy is president and Mar Roxas is vice-president. Mar Roxas is vice-president if and only if P-Noy is president. The necessary use of parentheses in arithmetic is as important its use in logic.

Some important terms Sub-formula – a meaningful formula that occurs as a part of another formula. Major operator/connective – the operator that determines the overall form of the sentence, and is the operator introduced last in the process of constructing the formula from its more elementary components.

What is the major operator? ((A  B)  (C v D)) (((A  B)  (C v D)) v ((E F)  G)) (((A  B) v ((C  D) v F))  ((H  E) v C))

Do Worksheet 1