Introductory Logic PHI 120 Presentation: “Basic Concepts Review "

Slides:



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

Preview of SL Logic Class 3. Either it is raining or it is snowing A A: It is raining B: It is snowing B  : Or 
Logic & Critical Reasoning
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.
Introductory Logic PHI 120 Presentation: "Intro to Formal Logic" Please turn off all cell phones!
Today’s Topics Logical Syntax Logical Syntax o Well-Formed Formulas o Dominant Operator (Main Connective) Putting words into symbols Putting words into.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
6.1 Symbols and Translation
Today’s Topics n Symbolizing conditionals and bi-conditionals n Other complex symbolizations. n Unless.
1 CA 208 Logic Ex3 Define logical entailment  in terms of material implication  Define logical consequence |= (here the semantic consequence relation.
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.
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 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.
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.
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.
Let remember from the previous lesson what is Knowledge representation
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.
The Language of Propositional Logic The Syntax and Semantics of PL.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Intro to Discrete Structures
Propositions and Truth Tables
The Language S : Æ Ç ! $.
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.
Conjunction A conjunction is a compound statement formed by combining two simple sentences using the word “AND”. A conjunction is only true when both.
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.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 8.
Introductory Logic PHI 120 Presentation: "Natural Deduction – Introduction“ Bring this book to lecture.
Chapter Five Conditional and Indirect Proofs. 1. Conditional Proofs A conditional proof is a proof in which we assume the truth of one of the premises.
Introductory Logic PHI 120 Presentation: “Solving Proofs" Bring the Rules Handout to lecture.
Thinking Mathematically
CS6133 Software Specification and Verification
1 Propositional Logic Introduction. 2 What is propositional logic? Propositional Logic is concerned with propositions and their interrelationships. 
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Chapter 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Metalogic. TWO CONCEPTIONS OF LOGICAL CONSEQUENCE.
Sentential Logic.
9.2 Compound Sentences Standard 5.0, 24.0 Standard 5.0, 24.0 Two Key Terms Two Key Terms.
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'
1 Section 6.2 Propositional Calculus Propositional calculus is the language of propositions (statements that are true or false). We represent propositions.
Introduction to Logic Lecture 13 An Introduction to Truth Tables By David Kelsey.
Week 8 Discussion: Ch 8, TA: Karin Howe PHIL 121 Spring 2012.
Introductory Logic PHI 120 Presentation: "Truth Tables – Sentences"
Simple Logic.
Sentential logic. Lecture based on: Graeme Forbes, Modern Logic Katarzyna Paprzycka, online lectures.
AND.
Today’s Topics Symbolizing conditionals and bi-conditionals
Truth Tables for Negation, Conjunction, and Disjunction
Truth Tables – Logic (Continued)
Identifying Counterexamples
Chapter 8 Logic Topics
Introductory Logic PHI 120
Information Technology Department
Section 3.1 Statements and Logical Connectives
(1.4) An Introduction to Logic
Discrete Mathematics Lecture 2: Propositional Logic
The Logic of Declarative Statements
PROPOSITIONAL LOGIC - SYNTAX-
Statements of Symbolic Logic
CHAPTER 3 Logic.
TRUTH TABLES.
Introductory Logic PHI 120
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
Propositional Logic CMSC 471 Chapter , 7.7 and Chuck Dyer
Statements and Logical Connectives
For Wednesday, read Chapter 4, section 3 (pp )
The Structure of Sentential Logic
Introduction to Computational Linguistics
Presentation transcript:

Introductory Logic PHI 120 Presentation: “Basic Concepts Review "

Review of WFFs Identifying and Reading Sentences

IDENTIFYING FORM WFFs

Sentential Logic Simple WFFs 1.P, Q, R, S, …. Complex WFFs 2.Negation (~Φ) 3.Conjunction (Φ & Ψ) 4.Disjunction (Φ v Ψ) 5.Conditional (Φ -> Ψ) 6.Biconditional (Φ Ψ) – and nothing else Learn these five forms especially!

Exercise: Seeing Form ~Φ (negation) –~P–~P – ~(P & Q)

Exercise: Seeing Form ~Φ (negation) – ~P – ~(P & Q) Φ & Ψ (conjunction) – P & Q – ~P & ~Q

Exercise: Seeing Form ~Φ (negation) – ~P – ~(P & Q) Φ & Ψ (conjunction) – P & Q – ~P & ~Q Φ v Ψ (disjunction) – P v Q – (P & Q) v R

Exercise: Seeing Form ~Φ (negation) – ~P – ~(P & Q) Φ & Ψ (conjunction) – P & Q – ~P & ~Q Φ v Ψ (disjunction) – P v Q – (P & Q) v R Φ -> Ψ (conditional) – P -> Q – P -> (Q R)

Exercise: Seeing Form ~Φ (negation) – ~P – ~(P & Q) Φ & Ψ (conjunction) – P & Q – ~P & ~Q Φ v Ψ (disjunction) – P v Q – P v (Q & R) Φ -> Ψ (conditional) – P -> Q – P -> (Q R) Φ Ψ (biconditional) – P Q – (P -> Q) (R S)

READING SENTENCES WFFs

The Key is Binding Strength Strongest ~ & and/or v -> Weakest

Exercise: Reading Complex Sentences 1.P & (Q & R) What kind of sentence is this?

Exercise: Reading Complex Sentences 1.P & (Q & R) – Obviously an & (“ampersand”) kind of WFF Φ & Ψ This is the form of a conjunction (or ampersand) kind of statement Φ & Ψ is a binary. It has a left side (Φ) and a right side (Ψ).

Exercise: Reading Complex Sentences 1.P & (Q & R) – Obviously an & (“ampersand”) kind of WFF Φ & Ψ – Question Look at the sentence as written: – What is the first conjunct (Φ)? – What is the second conjunct (Ψ)?

Exercise: Reading Complex Sentences 1.P & (Q & R) – Obviously an & (“ampersand”) kind of WFF Φ & Ψ – Answer Φ = P Ψ = Q & R – This second conjunct is, itself, a conjunction (Q & R) » Q is the first conjunct » R is the second conjunct

Exercise: Reading Complex Sentences 1.P & (Q & R) – Obviously an & (“ampersand”) kind of WFF Φ & Ψ – Answer Φ = P Ψ = Q & R – This second conjunct is, itself, a conjunction » Q is the first conjunct » R is the second conjunct – Why are there parentheses around the 2 nd conjunct?

Exercise: Reading Complex Sentences 2.P & Q -> R What kind of sentence is this?

Exercise: Reading Complex Sentences 2.P & Q -> R – Could be an & (“ampersand”) or -> (“arrow”) kind of WFF Φ & Ψ Φ -> Ψ – Question Look at the sentence as written: – What is the weaker connective: the & or the ->?

Exercise: Reading Complex Sentences 2.P & Q -> R – Not obviously an & (“ampersand”) or -> (“arrow”) kind of WFF Φ & Ψ Φ -> Ψ – Answer The -> binds more weakly than the & – You can break the sentence most easily here » Φ - “the antecedent”: P & Q » Ψ - “the consequent”: R

Exercise: Reading Complex Sentences 2.P & Q -> R – Not obviously an & (“ampersand”) or -> (“arrow”) kind of WFF Φ & Ψ Φ -> Ψ – Answer The -> binds more weakly than the & – You can break the sentence most easily here » Antecedent: P & Q » Consequent: R – Why are there no parentheses around the antecedent? ( )

Exercise: Reading Complex Sentences 3.R P v (R & Q) What kind of sentence is this?

Exercise: Reading Complex Sentences 3.R P v (R & Q) – Either Φ Ψ Φ v Ψ Φ & Ψ – Question – Which is the main connective? Conjunction is embedded within parentheses.

Exercise: Reading Complex Sentences 3.R P v (R & Q) – Either Φ Ψ Φ v Ψ Φ & Ψ – Answer Φ Ψ

Exercise: Reading Complex Sentences 3.R P v (R & Q) – What is first condition? R – What is the second condition? P v (R & Q) – Is this WFF a disjunction (v) or a conjunction (&)? – It is a v (a disjunction) » First disjunct: P » Second disjunct: R & Q – Question: can you see why are there parentheses around the second disjunct (R & Q)?

- NON-SENSE - AMBIGUITY - WELL-FORMED FORMULAS Grammar and Syntax

Non-Sense Formula Exercise 1.2.1: v (page 8) A –> (

Ambiguous Formula Exercise 1.2.3: v (page 10) P -> R & S -> T

Well-Formed Formula Exercise 1.2.3: iii (page 10) P v Q -> R S

Well-Formed Formula P v Q -> (R S)

Sentential Logic Simple WFFs 1.P, Q, R, S, …. Complex WFFs 2.Negation (~Φ) 3.Conjunction (Φ & Ψ) 4.Disjunction (Φ v Ψ) 5.Conditional (Φ -> Ψ) 6.Biconditional (Φ Ψ) – and nothing else

The end.