For Wednesday, read chapter 2, sections 3 and 4. As nongraded homework, do the problems at the end each section. Also try exercises 7.1, C, D, and E on.

Slides:



Advertisements
Similar presentations
Chapter 21: Truth Tables.
Advertisements

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.
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
Chapter Two Symbolizing in Sentential Logic This chapter is a preliminary to the project of building a model of validity for sentential arguments. We.
Introductory Logic PHI 120 Presentation: "Intro to Formal Logic" Please turn off all cell phones!
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.
Conditional Propositions and Logical Equivalence.
Today’s Topics Logical Syntax Logical Syntax o Well-Formed Formulas o Dominant Operator (Main Connective) Putting words into symbols Putting words into.
For Wednesday, 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.
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
Exam #3 is Friday. It will consist of proofs, plus symbolizations in predicate logic.
1. 2 Day 1Intro Day 2Chapter 1 Day 3Chapter 2 Day 4Chapter 3 Day 5Chapter 4 Day 6Chapter 4 Day 7Chapter 4 Day 8EXAM #1 40% of Exam 1 60% of Exam 1 warm-up.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
An Introduction to Propositional Logic Translations: Ordinary Language to Propositional Form.
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.
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.
For Friday, read chapter 2, section 5. As nongraded homework, do the problems at the end of the section. Reminder: try exercises 7.1, C, D, and E on the.
PHIL 120: Jan 8 Basic notions of logic
On Monday, we’ll work on Chapter 2, sections 4 and 5. Exam #1 is one week from today. It covers Chapters 1 and 2 (except for chapter 2, section 6). On.
Reading: Chapter 4, section 4 Nongraded Homework: Problems at the end of section 4. Graded Homework #4 is due at the beginning of class on Friday. You.
For Monday, read Chapter 4, Sections 1 and 2. Nongraded homework: Problems on pages Graded HW #4 is due on Friday, Feb. 11, at the beginning of.
Exam #1 is Friday. It will take the entire period. You do not need to bring an exam booklet; you’ll write directly on the exam. Outline: I. T/F, covering.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
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.
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;
Copyright © Cengage Learning. All rights reserved.
No new reading for Wednesday. Exam #1 will be given in class on Friday. It covers Chapters 1 and 2 (except for chapter 2, section 6). On Monday, I’ll give.
Logic and Philosophy Alan Hausman PART ONE Sentential Logic Sentential Logic.
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.
Chapter Six Sentential Logic Truth Trees. 1. The Sentential Logic Truth Tree Method People who developed the truth tree method: J. Hintikka— “model sets”
FALSE PREMISE.
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
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
For Wednesday, read chapter 2, sections 3 and 4. As nongraded homework, do the problems at the end each section. Also try exercises 7.1, C, D, and E on.
Introductory Logic PHI 120 Presentation: “Basic Concepts Review "
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.
Thinking Mathematically Arguments and Truth Tables.
No new reading for Wednesday. Keep working on chapter 5, section 3. Exam #3 is next Monday.
Higher / Int.2 Philosophy 12. Our Learning  Fallacy Reminder  Summary following Homework NAB  Class NAB.
For Friday, read Chapter 2, section 5. As nongraded homework, do the problems at the end of the section. I sent out graded HW#2 yesterday. It’s due on.
Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.
Chapter Eight Predicate Logic Semantics. 1. Interpretations in Predicate Logic An argument is valid in predicate logic iff there is no valuation on which.
Lecture 2 Discrete Mathematics 9/3/ Introduction What is Discrete Mathematics? Discrete Mathematics concerns processes that consist of a sequence.
Deductive Reasoning. Inductive: premise offers support and evidenceInductive: premise offers support and evidence Deductive: premises offers proof that.
Logic.
2. The Logic of Compound Statements Summary
AND.
FALSE PREMISE.
Identifying Counterexamples
Chapter 8 Logic Topics
Section 3.1 Statements and Logical Connectives
Copyright © Cengage Learning. All rights reserved.
Logic Problems and Questions
Logic Math Studies IB Propositions, truth tables, logic symbols, negation, conjunction, disjunction.
The Logic of Declarative Statements
Deductive Arguments: Checking for Validity
Validity & Invalidity Valid arguments guarantee true conclusions but only when all of their premises are true Invalid arguments do not guarantee true conclusions.
TRUTH TABLES.
Introductory Logic PHI 120
6.4 Truth Tables for Arguments
Statements and Logical Connectives
For Wednesday, read Chapter 4, section 3 (pp )
Propositional Logic 1) Introduction Copyright 2008, Scott Gray.
Evaluating Deductive 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.
Starting out with formal logic
Presentation transcript:

For Wednesday, read chapter 2, sections 3 and 4. As nongraded homework, do the problems at the end each section. Also try exercises 7.1, C, D, and E on the Power of Logic web tutor: It uses a dot in place of the ampersand. Also, look at the ‘help’ link to see how to enter the symbols.

Soundness If possible, we would like our arguments to be valid and to have all true premises. An argument with both characteristics (valid, with all true premises) is sound. Any argument that is not sound is unsound. An unsound argument is either invalid or has at least one false premise (or both).

All whales are fish. No fish live in trees. Therefore, no whales live in trees. Valid? Sound? Answer: Valid, but unsound; one false premise is enough to make the argument unsound.

Some fruits are green. Some fruits are apples. Therefore, some fruits are green apples. Answer: Invalid, and unsound—even though all three statements in the argument are true. A note about ‘some’: For our purposes, ‘some’ means ‘at least one’.

These arguments involve category relations: all humans are said to be in the category of reptiles. But for the next few weeks, we’ll be studying sentential logic; we will treat entire simple sentences as single units: If I win the lottery, then I’ll be rich. I just won the lottery. Therefore, I’m rich

Sentential Logic The system contains three kinds of symbol, each playing a different role: 1. The five sentential connectives: ~ (tilde), & (ampersand), v (vee), → (arrow), and ↔ (double- arrow). These connect smaller formulae together (or preface them, in the case of the tilde). 2. Capital letters A-Z abbreviate simple (or atomic) statements. These are grammatically simple sentences that have no words corresponding to sentential connectives in them.

‘~’ abbreviates ‘not’ and equivalent phrases, such as ‘it is not the case that’ Joanne is not tall. (J: Joanne is tall) ~ J ~ J It is not the case that Tom is a lawyer. (T: Tom is a lawyer) ~ T

‘&’ abbreviates ‘and’ and equivalent terms José is a doctor and Martin is a lawyer. (J: José is a doctor; M: Martin is a lawyer) J & M Theresa is poor, even though she is a doctor. (P: Theresa is poor; D: Theresa is a doctor) P & D

‘v’ abbreviates the inclusive ‘either...or...’ and equivalent phrases (inclusive ‘or’ is ‘and/or’) Either Jane is over four years old or over forty pounds. (F: Jane is over four years old; P: Jane is over forty pounds) F v P We often use ‘or’ to mean ‘either...or...but not both’; this is the exclusive ‘or’. We can symbolize it if need be, but the formula is somewhat complex.

3. Parentheses are used for grouping. Either Tom is a doctor or Jill is a doctor, but not both. (T: Tom is a doctor; J: Jill is a doctor) (T v J) & ~ (T & J) This expresses the exclusive ‘or’.