Symbolic Language and Basic Operators Kareem Khalifa Department of Philosophy Middlebury College.

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

Logic & Critical Reasoning Translation into Propositional Logic.
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.
Conditional Propositions and Logical Equivalence.
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
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 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.
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
Conditional Statements & Material Implication Kareem Khalifa Department of Philosophy Middlebury College.
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.
First Symbolic Exercises
Logic A statement is a sentence that is either true or false (its truth value). Logically speaking, a statement is either true or false. What are the values.
Lecture 8 Introduction to Logic CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Propositional Logic Review
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.
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
Intro to Discrete Structures
Propositions and Truth Tables
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
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
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.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
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.
Truth Functions Relationships A function is a relation that links members of sets. The set of all x which are in relation R with some y is called the.
MATH 102 Contemporary Math S. Rook
1 Introduction to Abstract Mathematics The Logic and Language of Proofs Instructor: Hayk Melikya Proposition: Informal introduction to.
Logic & Propositions Kareem Khalifa Department of Philosophy Middlebury College.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Objectives 1. Statements, quantifiers, and compound statements 2. Statements involving the words not,
Of 33 lecture 12: propositional logic – part I. of 33 propositions and connectives … two-valued logic – every sentence is either true or false some sentences.
Truth Tables and Validity Kareem Khalifa Department of Philosophy Middlebury College pqrSp v qr & s~(p v q)~p~q~p & ~q~(p v q) -> (r & s) (~p & ~q) ->
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
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.
MLS 570 Critical Thinking Reading Notes for Fogelin: Propositional Logic Fall Term 2006 North Central College.
PHIL 120: Third meeting I. I. What to know for Test 1 (in general terms). II. II. Symbolizing compound sentences (cont’d) a. a. Paying attention to English.
Thinking Mathematically
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
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.
Statement Forms and Material Equivalence Kareem Khalifa Department of Philosophy Middlebury College.
Section 1.1 Propositions and Logical Operations. Introduction Remember that discrete is –the study of decision making in non-continuous systems. That.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
 Statement - sentence that can be proven true or false  Truth value – true or false  Statements are often represented using letters such as p and q.
CS104 The Foundations: Logic and Proof 1. 2 What is Discrete Structure?  Discrete Objects  Separated from each other (Opposite of continuous)  e.g.,
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
Chapter 1 Propositional Logic
Presented by: Tutorial Services The Math Center
Logic.
Symbolic Language and Basic Operators
Truth Tables – Logic (Continued)
The Boolean Connectives
Propositions & Arguments
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
TRUTH TABLES.
CHAPTER 3 Logic.
TRUTH TABLES.
Statements and Logical Connectives
Compounding.
Starting out with formal logic
Truth tables.
Presentation transcript:

Symbolic Language and Basic Operators Kareem Khalifa Department of Philosophy Middlebury College

Overview  Why this matters  Artificial versus natural languages  Conjunction  Negation  Disjunction  Punctuation  Sample Exercises

Why this matters  Symbolic language allows us to abstract away the complexities of natural languages like English so that we can focus exclusively on ascertaining the validity of arguments Judging the validity of arguments is an important skill, so symbolic languages allow us to focus and hone this skill.  Symbolic language encourages precision. This precision can be reintroduced into natural language.

More on why this matters  You are learning the conditions under which a whole host of statements are true and false. This is crucial for criticizing arguments. It is a good critical practice to think of conditions whereby a claim would be false.

Artificial versus natural languages  Symbolic language (logical syntax) is an artificial language It was designed to be as unambiguous as possible.  English (French, Chinese, Russian, etc.) are natural languages They weren’t really designed in any strong sense at all. They emerge and evolve through very “organic” and (often) unreflective cultural processes. As a result, they have all sorts of ambiguities.  The tradeoff is between clarity and expressive richness. Both are desirable, but they’re hard to combine.

Propositions as letters  Logical syntax represents individual propositions as letters. When we don’t care what the proposition actually stands for, we represent it with a lowercase letter, typically beginning with p. When we have a fixed interpretation of a proposition, we represent it with a capital letter, typically beginning with P.  Ex. Let P = “It’s raining.”  Sometimes, letters are subscripted. Each subscripted letter should be interpreted as a different proposition.

Dispensable translation manuals  Often, the letters are given an interpretation, i.e., they are mapped onto specific sentences in English. Ex. Let P be “It is raining;” Q be “The streets are wet,” etc.  However, this is not necessary. The validity of an argument doesn’t hinge on the interpretation. If p then q p  q

Logical connectives: some basics  A logical connective is a piece of logical syntax that: Operates upon propositions; and Forms a larger (compound) proposition out of the propositions it operates upon, such that the truth of the compound proposition is a function of the truth of its component propositions.  Today, we’ll look at AND, NOT, and OR. Khalifa is cunning and cute. Khalifa is not cunning. Either Khalifa is cunning or he is foolish.

Conjunction  AND-statements Middlebury has a philosophy department AND it has a neuroscience program.  Represented either as “” or as “&” I recommend “&,” since it’s just SHIFT+7  “p & q” will be true when p is true and q is true; false otherwise.

Truth-tables  Examine all of the combinations of component propositions, and define the truth of the compound proposition. pqp & q TT TF FT FF T F F F

Subtleties in translating English conjunctions into symbolic notation  The “and” does not always appear in between two propositions. Khalifa is handsome and modest. Khalifa and Grasswick teach logic. Khalifa teaches logic and plays bass.

More subtleties  Sometimes “and” in English means “and subsequently.” The truth-conditions for this are the same as “&”, but the meaning of the English expression is not fully captured by the formal language.  Many English words have the same truth- conditions as “&” but have additional meanings. Ex. “but,” “yet,” “still,” “although,” “however,” “moreover,” “nevertheless”  General lesson: The meaning of a proposition is not (easily) identifiable with the truth-functions that define it in logical notation.

Negation  Represented by a “~”  In English, “not,” “it’s not the case that,” “it’s false that,” “it’s absurd to think that,” etc. p~p T F F T

Disjunction  Represented in English by “or.”  However, there are two senses of “or” in English: Inclusive: when p AND q are true, p OR q is true Exclusive: when p AND q is true, p OR q is false  Logical disjunction (represented as “v”) is an inclusive “or.”

Which is inclusive and which is exclusive?  You can take Intro to Logic in the fall or the spring. Exclusive. You can’t take the same course twice!  You can take Intro to Logic or Calculus I. Inclusive. You’d then be learned in logic and in math!

Truth table for disjunction pqp v q TT TF FT FF F T T T

Punctuation  We can daisy-chain logical connectives together. Either Polly and Quinn or Rita and Sam will not win the game show.  If we have no way of grouping propositions together, it becomes ambiguous ~P & Q v R & S  Logic follows the same conventions as math { [ ( ) ] }, though some logicians prefer to use only ( ( ( ) ) ). [(~P&~Q) v (~R&~S)]

A few quirks  A negation symbol applies to the smallest statement that the punctuation permits. Ex. “~p & q” is equivalent to “(~p) & q”  It is NOT equivalent to “~(p & q)” This reduces the number of ( )  We can also drop the outermost brackets of any expression. Ex. “[p & (q v r)]” is equivalent to “p & (q v r)”

Lessons about punctuation from logic  Make sure, in English, that you phrase things so that there is no ambiguity Commas are very useful here  When reading, be especially sensitive to small subtleties about logical structure that would change the meaning of a passage.

Sample Exercise A3 (327)  ~London is the capital of England & ~Stockholm is the capital of Norway  ~T & ~F  F & T FF

Sample Exercise A4 (327)  ~(Rome is the capital of Spain v Paris the capital of France)  ~(F v T)  ~(T) FF

Sample Exercise A9 (327)  (London is the capital of England v Stockholm is the capital of Norway) & (~Rome is the capital of Italy & ~Stockholm is the capital of Norway)  (T v F) & (~T & ~F)  (T) & (F & T)  (T) & (F) FF

Sample Exercise C3 (329)  Q v ~X  Q v ~F  Q v T TT

Exercise C12 (329)  (P & Q) & (~P v ~Q)  The first conjunct (P&Q), can only be true if P = Q = T  However, this would make the whole conjunction false. Here’s the ‘proof’: (T&T) & (~T v ~T) (T) & (F v F) (T) & (F) F

Exercise D9 (330)  It is not the case that Egypt’s food shortage worsens, and Jordan requests more U.S. aid.  ~E & J