Tweedledum: “I know what you’re thinking, but it isn’t so. No how.” Tweedledee: “Contrariwise, if it was so, it might be; and if it were so, it would be;

Slides:



Advertisements
Similar presentations
Geometry Logic.
Advertisements

TRUTH TABLES Section 1.3.
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.
Truth-Tables. Recap Deductive Validity We say that an argument is deductively valid when it has the following property: If the premises of the argument.
Logic & Critical Reasoning
Sentential Logic 2. REVIEW Deductive Validity We say that an argument is deductively valid when it has the following property: If the premises of the.
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.
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.
Semantics of SL and Review Part 1: What you need to know for test 2 Part 2: The structure of definitions of truth functional notions Part 3: Rules when.
Philosophy 103 Linguistics 103 Introductory Logic: Critical Thinking Fall 2007 Dr. Robert Barnard.
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
Review: Logic of Categories = Categorical Logic.
DEDUCTIVE REASONING: PROPOSITIONAL LOGIC Purposes: To analyze complex claims and deductive argument forms To determine what arguments are valid or not.
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.
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.
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
The semantics of SL   Defining logical notions (validity, logical equivalence, and so forth) in terms of truth-value assignments   A truth-value assignment:
Propositional Logic USEM 40a Spring 2006 James Pustejovsky.
Through the Looking Glass, 1865
The Language of Propositional Logic The Syntax and Semantics of PL.
Truth Tables for Negation, Conjunction, and Disjunction.
Conjunctions, Disjunctions, and Negations Symbolic Logic 2/12/2001.
The Foundations: Logic and Proofs
Intro to Discrete Structures
1.1 Sets and Logic Set – a collection of objects. Set brackets {} are used to enclose the elements of a set. Example: {1, 2, 5, 9} Elements – objects inside.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Course Outline Book: Discrete Mathematics by K. P. Bogart Topics:
Lecture for Week Spring.   Introduction to Propositional Logic  Types of Proposition  Operator and Truth table Agenda.
Truth-Tables. Midterm Grades Grade Distribution.
CS 285- Discrete Mathematics Lecture 2. Section 1.1 Propositional Logic Propositions Conditional Statements Truth Tables of Compound Propositions Translating.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
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.
1 Propositional Logic Proposition 2 Propositions can be divided into simple propositions and compound propositions. A simple (or basic) proposition is.
Math 240: Transition to Advanced Math Deductive reasoning: logic is used to draw conclusions based on statements accepted as true. Thus conclusions are.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
Logic Review. FORMAT Format Part I 30 questions 2.5 marks each Total 30 x 2.5 = 75 marks Part II 10 questions Answer only 5 of them! Total 5 x 5 marks.
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.
2.8 Methods of Proof PHIL 012 1/26/2001.
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,
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.
1/10/ Math/CSE 1019N: Discrete Mathematics for Computer Science Winter 2007 Suprakash Datta Office: CSEB 3043 Phone:
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
1 Propositional Logic Introduction. 2 What is propositional logic? Propositional Logic is concerned with propositions and their interrelationships. 
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
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.
Sentential Logic.
Chapter 7 Evaluating Deductive Arguments II: Truth Functional Logic Invitation to Critical Thinking First Canadian Edition.
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.
Invitation to Critical Thinking Chapter 7 Lecture Notes Chapter 7.
Outline Logic Propositional Logic Well formed formula Truth table
رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.
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.
TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.
Metalogic Soundness and Completeness. Two Notions of Logical Consequence Validity: If the premises are true, then the conclusion must be true. Provability:
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Chapter 1 Logic and proofs
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
Logical functors and connectives. Negation: ¬ The function of the negation is to reverse the truth value of a given propositions (sentence). If A is true,
The Logic of Declarative Statements
Starting out with formal logic
Presentation transcript:

Tweedledum: “I know what you’re thinking, but it isn’t so. No how.” Tweedledee: “Contrariwise, if it was so, it might be; and if it were so, it would be; but as it isn’t, it ain’t. That’s logic.”

PHIL 120: Introduction to Logic Professor: Lynn Hankinson-Nelson Instructors: Lars Enden Cheryl Fitzgerald Mitch Kaufman Joe Ricci

PHIL 120: Introduction to Logic Course website: Syllabus and course requirements Power point lectures Sample tests Office hours and locations; addresses. Announcements Course Text: The Logic Book, 5 th edition. McGraw Hill. A solutions manual is available online.

PHIL 120 Requirements I. I. Attendance and participation in lectures and discussion sections, including assigned homework and pop quizzes (20%) II. II. 5 tests (16% each) III. III. You may take 1 test over to raise the grade IV. IV. Practice, practice, practice… logic is not a spectator sport! V. V. Ask questions!

Logic   The study of reasoning   The drawing of inferences: what follows from what and what doesn’t follow   We can talk in terms of ‘ideas’, ‘beliefs’, and the like, but it’s more concrete to talk about ‘sentences’ – those entities that we use to express ideas, beliefs, and claims.   One focus: arguments   A set of at least two sentences, one of which is the conclusion and the other or others is/are reasons (premises) that support it.

Good arguments vs. bad arguments All men are mortal Socrates is a man. __________________ Socrates is mortal. This argument is truth- preserving. It is deductively valid. If it is true that all men are mortal, and true that Socrates is a man, then it must be true that Socrates is mortal All men are mortal Socrates is mortal. ____________________ Socrates is a man. This argument is not truth preserving. It is deductively invalid. Even if the premises are true, they do not guarantee the truth of the conclusion. Socrates could be the name of any living thing.

Logic and humor

Good arguments vs. bad arguments If you studied a lot, you did well in the logic course You studied a lot. _________________________ You did well in the logic course. This argument is truth- preserving. It is deductively valid. It is not possible for the premises to be true and the conclusion false If you studied a lot, you did well in the logic course You did well in the logic course. ____________________ You studied a lot. This argument is not truth preserving. It is deductively invalid. It is possible for the premises to be true and the conclusion false.

The language SL   A symbolic language used to illustrate the logical structure of sentences, of sets of sentences, of arguments, and of other relationships between sentences   In sentential logic, the most basic unit is the simple declarative sentence.   Simple: no logical connectives   Declarative: either true or false   We assume bivalence

The language SL The vocabulary of SL: 1. 1.Roman capital letters, A through Z, with or without subscripts (e.g., S and S 3 ) used to symbolize simple, declarative sentences (sentential) connectives: ~ (tilde) & (ampersand) v (wedge)  (horseshoe)  (triple bar) The first is a unary connective. The rest are binary connectives Punctuation: ( ) and [ ]

The language SL   Every sentence of SL is either simple/atomic or compound/molecular.   Simple/atomic sentences have no connectives.   Compound/molecular sentences have at least one connective. Meta variables Object language and meta language P, Q, R, and S are meta variables used to talk about sentences of SL.

The recursive definition of SL Every sentence letter is a sentence If P is a sentence of SL, ~P is a sentence of SL If P and Q are sentences, then (P & Q) is a sentence If P and Q are sentences, then (P v Q) is a sentence If P and Q are sentences, then (P  Q) is a sentence If P and Q are sentences, then (P  Q) is a sentence Nothing else is a sentence.

What the recursive definition of SL does   It tells us what will count as a sentence of SL   It also tells us what will not.   For example, these are not sentences of SL: A & clause 3: & is a binary connective B & C ? SL does not include ‘?’ ~ & ~ must be used before a sentence (clause 2); and & must connect 2 sentences (clause 3)

What the recursive definition of SL does   It tells us what will count as a sentence of SL   These are sentences of SL: A & B (clause 3) (B & B) & B (clause 3) ~~B (clause 2) A v B (clause 4) A  B (clause 5) A  B (clause 6)

Using SL to symbolize sentences Roman capital letters A through Z (with or without subscripts) to symbolize simple declarative sentences: ‘Mary went to the store’ (we could symbolize as M). ‘John went to the store’ (we could symbolize as J). These are NOT simple declarative sentences: Either Mary went to the store or John did. Mary did not (or didn’t) go to the store.

Using SL to symbolize sentences   ‘Mary did not (or didn’t) go to the store’   The logic of this sentence is: ‘It is not the case that Mary went to the store’   ~ symbolizes ‘it is not the case that’   So, using M for ‘Mary went to the store’, we use ~M to symbolize ‘It is not the case that Mary went to the store’   Sentences whose main connective is the tilde are called negations.

The characteristic truth table for the ~ P ~P~P~P~P TF FT

Using SL to symbolize sentences   ‘Mary and John went to the store’   This is a compound/molecular sentence to be translated as:   ‘Mary went to the store and John went to the store’   We can use M to symbolize ‘Mary went to the store’, and J to symbolize ‘John went to the store’   We use the & for ‘and’   So we have: M & J

The characteristic truth table for the & PQ P & Q TTT TFF FTF FFF

Using SL to symbolize sentences   Sentences whose main connective is the & are called conjunctions and each of the sentences connected by the & is called a conjunct. We can refer to them as the right or the left conjunct.   We use & as a connective in all cases in which the compound sentence is only true if both of its component sentences are true.   This is the case for: ‘Mary went to the store but John did too’ the logical structure of which is: ‘Mary went to the store and John went to the store’

Using SL to symbolize sentences   ‘Mary went to the store but John did not’   Is paraphrased as:   ‘Mary went to the store and it is not the case that John went to the store’   M can symbolize ‘Mary went to the store’   And & is used for but. So far we have:   M &   ~J can symbolize ‘it is not the case that John went to the store’   So we have: M & ~J

Using SL to symbolize sentences   ‘Either Mary went to the store or John did’   Is translated as:   ‘Either Mary went to the store or John went to the store’   We use the v to symbolize ‘either/or’   If we use M to symbolize ‘Mary went to the store’ and J to symbolize ‘John went to the store’ we symbolize the whole sentence as: M v J

The characteristic truth table for v PQ P v Q TTT TFT FTT FFF

Using SL to symbolize sentences   Because ‘either/or’ and the v assume the inclusive sense of ‘or’ (at least one is true), we will need to do more if we believe a sentence makes use of the exclusive sense of ‘or’ (at most one of the two) and should be symbolized to reflect this.   On a restaurant menu, for example, the phrase ‘either soup or salad is included’ reflects the exclusive sense of ‘or’.   Context may tell us that a claim comes to ‘Either Mary went to the store or John did, but not both’

Using SL to symbolize sentences   ‘If Mary went to the store, John did’   ‘If Mary went to the store, then John went to the store’   M: Mary went to the store   J: John went to the store   We use  to symbolize ‘if, then’   So we have: M  J

The characteristic truth table for the  PQ P  Q TTT TFF FTT FFT

Using SL to symbolize sentences   The reasoning behind the    Consider the following claim:   If the operation is a success, the patient survives.   The condition, ‘the operation is a success’, is a sufficient but not a necessary condition for the patient’s survival.   The docs decided not to operate and the patient survived… they discovered they were wrong about the need for an operation…   If the claim was ‘Only if the operation is a success, the patient survives’, then the operation’s success would require the patient’s survival for the claim to be true … but that is not what ‘If’ by itself entails.

Using SL to symbolize sentences   ‘Mary went to the store if and only if John did’   ‘Mary went to the store if and only if John went to the store’   We use  for ‘if and only if’   So we have: M  J   ‘P if and only if Q’ is equivalent to:   (If P then Q) and (If Q then P)

The characteristic truth table for the  PQ P  Q TTT TFF FTF FFT