Elementary Logic PHIL 105-302 Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 3.

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

Truth Functional Logic
Logic & Critical Reasoning
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.
An Introduction to Propositional Logic Translations: Ordinary Language to Propositional Form.
Other Info on Making Arguments
2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.
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 Friday, read chapter 2, sections 1-2 (pp ). As nongraded homework, do the problems on p. 19. Graded homework #1 is due at the beginning of class.
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
Copyright © Cengage Learning. All rights reserved.
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.
Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 4.
Intro to Discrete Structures
Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 2.
Propositions and Truth Tables
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.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Logic and Philosophy Alan Hausman PART ONE Sentential Logic Sentential Logic.
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.
Logic Geometry Unit 11, Lesson 5 Mrs. Reed. Definition Statement – a sentence that is either true or false. Example: There are 30 desks in the room.
Ch.2 Reasoning and Proof Pages Inductive Reasoning and Conjecture (p.62) - A conjecture is an educated guess based on known information.
The Science of Good Reasons
Question of the Day!  We shared a lot of examples of illogical arguments!  But how do you make a LOGICAL argument? What does your argument need? What.
Chapter 3: MAKING SENSE OF ARGUMENTS
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.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
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.
Chapter 8 – Symbolic Logic Professor D’Ascoli. Symbolic Logic Because the appraisal of arguments is made difficult by the peculiarities of natural language,
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
Chapter 9 Logic. Problem Three dogs called Lassie, Timmy and Fido have either black, brown or tri-colour hair. The dogs have lived with their owners.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Sentential Logic.
Chapter 7 Evaluating Deductive Arguments II: Truth Functional Logic Invitation to Critical Thinking First Canadian Edition.
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.
Symbolic Logic ⊃ ≡ · v ~ ∴. What is a logical argument? Logic is the science of reasoning, proof, thinking, or inference. Logic allows us to analyze a.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
What is the logic? The primary concern in logic is to identify and classify valid form of inference. The notions of 'validity' ,'form' and 'inference'
Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.
Chapter 1 Logic and proofs
Formal Methods (Spring 2015) Lecture 2 Abid Rauf 1.
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.
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,
Presented by: Tutorial Services The Math Center
Logic.
2. The Logic of Compound Statements Summary
Deductive Arguments.
6.1 Symbols and Translation
Chapter 8 Logic Topics
Validity and Soundness
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
Truth Trees.
Concise Guide to Critical Thinking
The Method of Deduction
Discrete Mathematics and Its Applications Kenneth H
The Logic of Declarative Statements
TRUTH TABLES.
6.4 Truth Tables for Arguments
8C Truth Tables, 8D, 8E Implications 8F Valid Arguments
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Presentation transcript:

Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 3

Argument evaluation What makes an argument good? 1) true premises 2) conclusion at least probable, given 1 3) premises are related to the conclusion 4) the conclusion can’t be undermined

Argument evaluation 3) premises are related to the conclusion 1) Scientists have not yet found any sign of aliens. 2) The universe would be boring without any aliens. 3) Therefore, there must be undiscovered aliens. Premise 1 is relevant to the opposite of the conclusion; premise 2 is irrelevant to either the conclusion or its opposite.

Argument evaluation 4) the conclusion can’t be undermined A deductive argument is valid when it is impossible (in the strongest sense) for the premises to all be true and the conclusion to be false.

Argument evaluation it is impossible for … the conclusion to be false Any argument where the conclusion cannot be false is always valid. The prime case of this is found with logically necessary conclusions. 1) All squares are rectangles. 2) 10 is greater than 6. 3) If it is red, then it is red.

Argument evaluation 1) Lincoln is the capital of Nebraska. 2) Barack Obama is the president. 3) Therefore, all bachelors are unmarried. Valid, because it is impossible for the premises to all be true and the conclusion false. The conclusion cannot be false.

Argument evaluation it is impossible for … the premises to all be true Any argument where the premises cannot all be true is always valid. The prime case of this is found with logically inconsistent premises. These are premises where the truth of one guarantees the falsehood of another.

Argument evaluation 1) All dogs are brown. 2) No dogs are brown. 3) Therefore, Mark McGwire is overrated. Valid, because it is impossible for the premises to all be true and the conclusion false. The premises cannot both be true (truth of one implies the falsity of the other).

Argument evaluation Inductive arguments do not share this standard of validity. Instead, they rely on complex standards of evidence, relevance, and probability… (which we’re skipping in the interest of time, see S, pp , etc.).

Formalization Arguments in natural language (e.g. English, Spanish, Arabic, etc.) can be very complicated to follow. Formalization offers a way to simplify and to make explicit the underlying structure (that is, logic) of arguments.

Argument form Consider the following arguments: 1)The ice cream is either chocolate or vanilla. 2)The ice cream isn’t chocolate. 3)So, the ice cream is vanilla.

Argument form Consider the following arguments: 1)John is either taller or shorter than Mary. 2)John isn’t taller than Mary. 3)So, John is shorter than Mary.

Argument form Consider the following arguments: 1)The sauce is either ketchup or mustard. 2)It isn’t ketchup. 3)So, the sauce is mustard.

Argument form Commonality between the three: 1) This or that. 2) NOT THIS. 3) Therefore, THAT. This is called a “disjunctive syllogism.” “Disjunctive syllogism” is the argument’s form.

Argument form All arguments have forms, though some are easier to find than others. All (deductive) argument forms are either valid or invalid. Disjunctive syllogism, for instance, is valid.

Seventh Inning Stretch (“…Take Me Out to the Crowd, …”)

Formalizing Symbolization: - simplifies arguments - quicker than natural language - helps in finding form

Formalizing Symbolizing Propositional Logic Basic unit:the proposition (the statement, for us) Statement symbolization: any capital letter

Formalizing Statement symbolization: 1)The ice cream is either chocolate or the cream is vanilla. 2)The ice cream isn’t chocolate. 3)So, the ice cream is vanilla. “The ice cream is chocolate” = P “The ice cream is vanilla” = Q “The ice cream isn’t chocolate” = Z “It is not the case that P”

Formalizing Statement symbolization: 1)The ice cream is either chocolate or the cream is vanilla. 2)The ice cream isn’t chocolate. 3)So, the ice cream is vanilla. 1)Either P or Q. 2) It is not the case that P. 3) So, Q. Symbol for conclusions: ∴ 3) ∴

Formalizing Negation symbolization: “The ice cream isn’t chocolate.” “It is not the case that P.” Symbol for “it is not the case that”: ~ “It is not the case that P” = ~P (You may also see ¬P, −P, NP, !P)

Formalizing Conjunction symbolization: “The ice cream is chocolate and cold.” “The ice cream is chocolate and cold” = P “The ice cream is chocolate” = P “Cold” = Q “The ice cream is cold” = Q

Formalizing Conjunction symbolization: “The ice cream is chocolate and cold.” P and Q Symbol for “and” = & “The ice cream is chocolate and cold” = P&Q (You may also see ∧, ·)

Formalizing Conjunction symbolization: Symbol for “and” = & Other words that take “&” as their symbol: butyetalthough nevertheless moreover

Formalizing Disjunction symbolization: “The ice cream is chocolate or vanilla.” P or Q Symbol for “or” = v “The ice cream is chocolate or vanilla” = PvQ

Formalizing Material conditional symbolization: “If the ice cream is chocolate, then it is cold.” If P, then Q Symbol for “if … then” = → “If the ice cream is chocolate, then it’s cold” = P → Q (You may also see ⊃, >)

Formalizing Material conditional symbolization: Symbol for “if … then” = → If I get a puppy, then I’ll be so happy. Antecedent = the part after the ‘if’ Consequent = the part after the ‘then’

Formalizing Biconditional symbolization: “The ice cream is chocolate if and only if it’s cold.” P if and only if Q Symbol for “if and only if” = ↔ “The ice cream is chocolate if and only if it’s cold” = P ↔ Q (You may also see ≡.)

Formalizing Biconditional symbolization: Symbol for “if and only if” = ↔ “The ice cream is chocolate if and only if it is cold.” is equivalent to “If the ice cream is chocolate, then it is cold and if the ice cream is cold, then it is chocolate.”

Formalizing Symbolization chart: It is not the case= ~ And= & Or= v If … then= → If and only if = ↔ Therefore= ∴

Formalization tips 1) Negation applies to whatever is to its immediate right ~P & Q is different than ~(P & Q) (they’re also different than ~P & ~Q) 2) All other operators apply both to their left and right

Formalization tips 3) Use parentheses, and then brackets, to avoid confusion. ~P v Q & Z = confusing (~P v Q) & Z, ~(PvQ) & Z, ~[P v (Q & Z)], etc. = less confusing

Formalization tips All formulas must be well-formed This means they must be syntactically correct (Exactly what the ‘English sentence’ “jo.!hn wa2s isn’t.) 1) All statement letters are well-formed formula. 2) All negations of statement letters are wffs. 3) All operators between two statement letters, and their negations, are well-formed formula. (A slightly less complex version of S, p )

For next time… Read ahead, S, pp Not difficult, but lots to memorize / apply