Copyright 2008, Scott Gray1 Propositional Logic 2) The Formal Language.

Slides:



Advertisements
Similar presentations
Copyright 2008, Scott Gray1 Propositional Logic 9) Or.
Advertisements

Copyright 2008, Scott Gray1 Propositional Logic 4) If.
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.
Logic & Critical Reasoning Translation into Propositional Logic.
Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 3.
Symbolic Logic: The Language of Modern Logic
Sentential Logic. One of our main critical thinking questions was: Does the evidence support the conclusion? How do we evaluate whether specific evidence.
Chapter Two Symbolizing in Sentential Logic This chapter is a preliminary to the project of building a model of validity for sentential arguments. We.
04 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
An Introduction to Propositional Logic Translations: Ordinary Language to Propositional Form.
Today’s Topics Logical Syntax Logical Syntax o Well-Formed Formulas o Dominant Operator (Main Connective) Putting words into symbols Putting words into.
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
6.1 Symbols and Translation
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.
Today’s Topics n Review Logical Implication & Truth Table Tests for Validity n Truth Value Analysis n Short Form Validity Tests n Consistency and validity.
For Wed, read Chapter 3, section 3. Nongraded Homework: Exercises the end of the section. Even better, do Power of Logic, 7.3, A and B. Graded homework.
PHIL 120: Jan 8 Basic notions of logic
Sentential Logic(SL) 1.Syntax: The language of SL / Symbolize 2.Semantic: a sentence / compare two sentences / compare a set of sentences 3.DDerivation.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
The Language of Propositional Logic The Syntax and Semantics of PL.
Copyright © Cengage Learning. All rights reserved.
Critical Thinking: A User’s Manual
Adapted from Discrete Math
Chapter 20: Simple and Compound Statements. Compound Statements (pp )  A compound statement contains another statement as a proper part. Nontruth-functionally.
Propositional Logic Review
Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 4.
Propositions and Truth Tables
Course Outline Book: Discrete Mathematics by K. P. Bogart Topics:
Chapter 2 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
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.
1 Propositional Logic Proposition 2 Propositions can be divided into simple propositions and compound propositions. A simple (or basic) proposition is.
Chapter 1 Logic Section 1-1 Statements Open your book to page 1 and read the section titled “To the Student” Now turn to page 3 where we will read the.
2.2 Statements, Connectives, and Quantifiers
Symbolic Language and Basic Operators Kareem Khalifa Department of Philosophy Middlebury College.
Copyright © Curt Hill Mathematical Logic An Introduction.
Chapter Three Truth Tables 1. Computing Truth-Values We can use truth tables to determine the truth-value of any compound sentence containing one of.
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.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 8.
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 Symbolic logic If A, then B A  B Capital letters stand for simple sentences A simple sentence is an affirmative single statement “It’s.
Argument Diagramming Part I
Chapter 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Sentential Logic.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
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.
Simple Logic.
Sentential logic. Lecture based on: Graeme Forbes, Modern Logic Katarzyna Paprzycka, online lectures.
Logic.
2. The Logic of Compound Statements Summary
CSNB 143 Discrete Mathematical Structures
Today’s Topics Symbolizing conditionals and bi-conditionals
Truth Tables – Logic (Continued)
6.1 Symbols and Translation
Identifying Counterexamples
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Chapter 8 Logic Topics
The Logic of Declarative Statements
MAT 3100 Introduction to Proof
CHAPTER 3 Logic.
TRUTH TABLES.
Statements and Logical Connectives
Introduction to Computational Linguistics
Propositional Logic 5) And Copyright 2008, Scott Gray.
Propositional Logic 8) Iff Copyright 2008, Scott Gray.
Truth tables.
Presentation transcript:

Copyright 2008, Scott Gray1 Propositional Logic 2) The Formal Language

Copyright 2008, Scott Gray 2 Some Examples of Last Week’s Topics □Some mammals are winged A bat is a mammal ∴ a bat is winged □Which is to say: Some ■ are ● ♦ is ■ ∴ ♦ is ● □ Invalid : substitute dog for bat – a winged bat?

Copyright 2008, Scott Gray 3 More Examples □No Supreme Court justice is a woman Ruth Ginsberg is a woman ∴ Ruth Ginsberg is not a Supreme Court justice □Some ■ are ● ♦ is ● ∴ ♦ is ■ □ Valid : We went from falsity (premise #1) to truth; however, T, T -> F would be invalid

Copyright 2008, Scott Gray 4 More Examples, cont. □Some NFL players are major league baseball players Some major league baseball players make millions ∴ some NFL players make millions □Some ■ are ● some ● is ♦ ∴ some ■ is ♦ □ Invalid : can you come up with a counter example?

Copyright 2008, Scott Gray 5 More Examples, cont. □Some cats are tailless animals Tailless animals are amphibians ∴ some cats are amphibians □It may help to think of this in terms of a Venn diagram: NFLMLB y = has millions $ y y y y y y x = doesn’t have millions $ x x x

Copyright 2008, Scott Gray 6 More Examples, cont. □Some transfinite sets are non-denumerable sets All non-denumerable sets are demonstrated by the diagonalization principle ∴ some transfinite sets are demonstrated by the diagonalization principle □Can you symbolize this? □Valid or invalid?

Copyright 2008, Scott Gray 7 More Examples, cont. □Some ■ are ● all ● is ♦ ∴ some ■ is ♦ T N D N T N D

Copyright 2008, Scott Gray 8 Elements of the Formal Language □Proposition letters: A, B, C,…Z □Connectives: ~ & v → ↔ □Brackets: () □You can say the connectives this way: ~ = tilde & = ampersand v = wedge → = arrow ↔ = double arrow □Your book uses additional brackets ([] & {}), but they are (IMO) unnecessary

Copyright 2008, Scott Gray 9 Dictionary □Sometime (usually?) called an interpretation □For instance, the dictionary will tell us that W = John won’t work □When first starting out, you should be explicit in your dictionary

Copyright 2008, Scott Gray 10 Notes on Connectives □ & – this approximates ( ≈ ) the English “and”; the letters can be flip-flopped (they are commutative) □ v – ≈ “or”; inclusive, meaning “possibly both” (exclusive means “not both”); we will treat this as commutative also □ ~ – ≈ “not” □ → – ≈ “if…then”; no sense of causality, nor A temporal proceeds B ; read “implies”

Copyright 2008, Scott Gray 11 Translating to Connectives □ A if & only if B == (B → A) & (A → B) ; this is the same as A ↔ B or B ↔ A □ A only if B == A → B □ A if B == B → A □The logical content of “but” is usually “and” □“Neither…nor” == ~(A v B) == (~A & ~B)

Copyright 2008, Scott Gray 12 Translating to Connectives, cont. □ ~A → ~B == A → B □necessary condition on the right of the → ; sufficient condition on the left □“only if” == necessary, not sufficient

Copyright 2008, Scott Gray 13 Translating to Connectives, cont. □“Unless” can be used in a weak or strong sense: A unless B == ~B → A A unless B == (A → ~B) & (B → ~A) We will use the weak sense □“Provided” == A provided B == B → A

Copyright 2008, Scott Gray 14 Additional Descriptions of Connectives □ ~ = negation □ & = conjunction □ v = disjunction □ → = conditional □ ↔ = bi-conditional conjuncts A & B disjuncts A v B antecedent A → B consequent

Copyright 2008, Scott Gray 15 Truth-Functional Sentence Connectives □Sentence connective = a symbol in a language such that by juxtaposing it in some appropriate way with some appropriate number of sentences of the language a new sentence of language is formed

Copyright 2008, Scott Gray 16 Truth-Functional Sentence Connectives, cont. □Truth-functional = a sentence connective is truth functional if and only if the value of the sentence it forms depends entirely upon the truth value of the component sentences

Copyright 2008, Scott Gray 17 Truth-Functional Sentence Connectives, cont. □AND: A & BA B T T F T T F F F T F F F □AND is truth-functional

Copyright 2008, Scott Gray 18 Truth-Functional Sentence Connectives, cont. □“Because” is not truth functional □Example: “Taft was fat and Taft didn’t exercise” □Both parts are true and the entire statement is true □But: “Taft was fat because Taft didn’t exercise” □Both parts are true, but “because” is not truth functional – we don’t cover this

Copyright 2008, Scott Gray 19 Assignments □Learn the connectives □Begin to collect translations (we have listed a few in this lesson) □Collect 10 truth-functional sentences and 10 non-truth-functional sentences from your reading □Be able to identify truth-functional and non-truth-functional sentences