An Introduction to Propositional Logic Translations: Ordinary Language to Propositional Form.

Slides:



Advertisements
Similar presentations
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.
Advertisements

Logic & Critical Reasoning Translation into Propositional Logic.
Logic & Critical Reasoning
Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 3.
Symbolic Logic: The Language of Modern Logic
Chapter Two Symbolizing in Sentential Logic This chapter is a preliminary to the project of building a model of validity for sentential arguments. We.
An Introduction to Propositional Logic Translations: Ordinary Language to Propositional Form.
Logic Concepts Lecture Module 11.
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
CS128 – Discrete Mathematics for Computer Science
Today’s Topics n Symbolizing conditionals and bi-conditionals n Other complex symbolizations. n Unless.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
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.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
From Chapter 4 Formal Specification using Z David Lightfoot
Sentential Logic(SL) 1.Syntax: The language of SL / Symbolize 2.Semantic: a sentence / compare two sentences / compare a set of sentences 3.DDerivation.
Let remember from the previous lesson what is Knowledge representation
For Friday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C. Graded.
The Language of Propositional Logic The Syntax and Semantics of PL.
Adapted from Discrete Math
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.
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
Logical Arguments. Strength 1.A useless argument is one in which the truth of the premisses has no effect at all on the truth of the conclusion. 2.A weak.
1 Propositional Logic Proposition 2 Propositions can be divided into simple propositions and compound propositions. A simple (or basic) proposition is.
Review I Rosen , 3.1 Know your definitions!
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.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
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.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
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.
CS6133 Software Specification and Verification
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
CS2351 Artificial Intelligence Bhaskar.V Class Notes on Knowledge Representation - Logical Agents.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Copyright 2008, Scott Gray1 Propositional Logic 2) The Formal Language.
Discrete Mathematics Lecture # 1. Course Objectives  Express statements with the precision of formal logic.  Analyze arguments to test their validity.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
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.,
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
Simple Logic.
Sentential logic. Lecture based on: Graeme Forbes, Modern Logic Katarzyna Paprzycka, online lectures.
Logic.
Chapter 7. Propositional and Predicate Logic
2. The Logic of Compound Statements Summary
Today’s Topics Symbolizing conditionals and bi-conditionals
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
Logic.
6.1 Symbols and Translation
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Information Technology Department
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
CS201: Data Structures and Discrete Mathematics I
The Method of Deduction
Discrete Mathematics and Its Applications Kenneth H
The Logic of Declarative Statements
PROPOSITIONAL LOGIC - SYNTAX-
MAT 3100 Introduction to Proof
TRUTH TABLES.
CS201: Data Structures and Discrete Mathematics I
Presentation transcript:

An Introduction to Propositional Logic Translations: Ordinary Language to Propositional Form

The Focus of Propositional Logic Propositional truth is determined by consulting typical sources of information. Propositional logic is determined by examining how various propositions are related.

Types of relations between propositions 1 proposition is offered in support of another (simple argument) 1 proposition expressed the condition under which a 2 nd proposition is true (conditional statement) 1 sentence offers two proposed alternatives, and a 2 nd proposition negates one of these alternatives (disjunctive syllogism)

Propositional Symbols Symbolizing propositions allows us to focus on the relations between propositions (logic) rather than the content of those propositions (truth). P1: UCLA will either raise fees or cut back on services. P2: UCLA will not raise fees. Con: UCLA will cut back on services. P1: R or C P2: Not R Con: C

Module Objectives - 1 Learn how to symbolize complex propositions  Simple propositions, which express grammatically independent units of information, are easy to symbolize: “It is cold” = “C”  Complex propositions are sentences which contain 2 or more simple propositions. These can be more difficult to symbolize.

Module Objectives - 2 Learn how to determine the truth-value of complex propositions Remember, an argument can only establish the truth of it’s conclusion if all its premises are true (and its reasoning is valid) “Fees are rising at UCLA” is either true or false “Either fees are rising or services are being cut back” could be true or false – depending on the actual situation regarding fees and services at UCLA.

Module Objectives - 3 Create and interpret truth tables for both propositions and arguments (series of propositions). Truth tables allow us to see all possible conditions under which a statement could be true and could be false.

Module Objectives – 4 & 5 Learn to recognize common argument forms, and know when an argument form is valid or invalid Prove that an argument is valid or invalid when it doesn’t fit a common argument form.

Basics of Propositional Logic All arguments are reducible to symbols, which represent either elements of an argumentor ways these elements are put together. 1.All arguments contain statements, by definition. Each statement is represented by a “propositional variable” – p, q, r, s 2.All arguments also contain connections, or ways in which individual propositions are related. Each of these connections are represented by one of five “operators”: Putting propositional variables together with operators creates a “statement form,” or a symbolic blueprint identifying typical structures of English expressions.

Propositional Operators (p. 281) ~ (“tilde,” negation) v (“wedge,” either-or) Ξ (“biconditional,” if and only if) (“dot,” conjunction) > (“implication” or “conditional,” if,then). Not, it is false that, conjunctions like “don’t” And, also, but, in addition, moreover Or, unless Is a sufficient (or necessary) condition of, if- then, implies, given that, only if If and only if, is equivalent to, is a sufficient and necessary condition of

Note on the “Tilde” 1. All operators except the tilde must relate at least two propositions. 2. The tilde negates either a proposition directly, or an operator relating to propositions (by standing directly before a parentheses/bracket/etc.).

Examples of “Tilde” Functions ~ p = not p; p is not true, etc ~ ( p ● q ) = not both p and q (maybe one is true and one false) ~ p ● ~ q = p is false and q is false; p and q are both false

Rules for Operator Types - 1 If there is more than one operator (excluding tildes), then some portion of the statement must be included in parentheses/brackets/etc. Well-formulated formula (wff) Not a well-formulated formula (non-wff) p v ~ qp v ~ q > r

Rules for Operator Types - 2 The tilde negates either a proposition directly, or an operator relating to propositions (by standing directly before a parentheses/bracket/etc.). Well-formulated formula (wff) Not a well-formulated formula (non-wff) ~ (p ≡ q) ● r(p ~ ≡ q) ● r

Working with Propositional Symbols - 1 Expression: If I get 80 points on the test, I’ll get a B on the test. Partial symbolization of the expression: If P, then B (material implication; conditional statement) Statement form: P > B p > q (in variables)

Working with Propositional Symbols - 2 Expression: p. 290, #5 Psychologists and psychiatrists do not both prescribe prescription drugs. Partial symbolization of the expression: Not both G and T → conjunction Statement form: ~ ( G ● T ) ~ ( p ● q )

Working with Propositional Symbols - 3 Expression: p. 290, #11 If Internet use continues to grow, then more people will become cyberaddicts and normal human relations will deteriorate. Partial symbolization of the expression: If I, then both C and D → mixed forms Statement form: I > ( C ● D ) p > ( q ● r )

Tips for Translation - 1 Use “clue words”:  “If, then”; “on the condition that”: >  Both; and; also; etc: ●  Either, or; or maybe both: v  If one, then the other; if and only if; always occur together:  Negation; it is not true that, not: ~

Tips for Translation - 2 Develop a system to mark every important part of a complex proposition before trying to symbolize it. DMX abandons explicit lyrics if and only if neither Columbia nor BMG stops advertising.