Introductory Logic PHI 120 Presentation: "Intro to Formal Logic" Please turn off all cell phones!

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 
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.
Propositional Logic CMSC 471 Chapter , 7.7 and Chuck Dyer
An Introduction to Propositional Logic Translations: Ordinary Language to Propositional Form.
Today’s Topics Logical Syntax Logical Syntax o Well-Formed Formulas o Dominant Operator (Main Connective) Putting words into symbols Putting words into.
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
Symbolic Logic: Conjunction • , Negation ~, Disjunction v
This is Introductory Logic PHI 120 Get a syllabus online, if you don't already have one Presentation: "Good Arguments"
Today’s Topics n Symbolizing conditionals and bi-conditionals n Other complex symbolizations. n Unless.
Logic in general Logics are formal languages for representing information such that conclusions can be drawn Syntax defines the sentences in the language.
Exam #3 is Friday. It will consist of proofs, plus symbolizations in predicate logic.
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.
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 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.
Let remember from the previous lesson what is Knowledge representation
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;
The Language of Propositional Logic The Syntax and Semantics of PL.
Copyright © Cengage Learning. All rights reserved.
Intro to Discrete Structures
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.
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.
1 Propositional Logic Proposition 2 Propositions can be divided into simple propositions and compound propositions. A simple (or basic) proposition is.
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.
Propositional Logic Dr. Rogelio Dávila Pérez Profesor-Investigador División de Posgrado Universidad Autónoma Guadalajara
Introductory Logic PHI 120 Presentation: “Basic Concepts Review "
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 8.
MLS 570 Critical Thinking Reading Notes for Fogelin: Propositional Logic Fall Term 2006 North Central College.
Introductory Logic PHI 120 Presentation: "Natural Deduction – Introduction“ Bring this book to lecture.
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
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. 
Chapter 1: The Foundations: Logic and Proofs
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
No new reading for Wednesday. Keep working on chapter 5, section 3. Exam #3 is next Monday.
Sentential Logic.
Albert Gatt LIN3021 Formal Semantics Lecture 3. Aims This lecture is divided into two parts: 1. We make our first attempts at formalising the notion of.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
Week 8 Discussion: Ch 8, TA: Karin Howe PHIL 121 Spring 2012.
Introductory Logic PHI 120 Presentation: "Truth Tables – Sentences"
 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.
Simple Logic.
Sentential logic. Lecture based on: Graeme Forbes, Modern Logic Katarzyna Paprzycka, online lectures.
Presented by: Tutorial Services The Math Center
Logic.
AND.
Lecture 1 – Formal Logic.
Truth Tables for Negation, Conjunction, and Disjunction
COT 3100, Spr Applications of Discrete Structures
The Boolean Connectives
Identifying Counterexamples
Introductory Logic PHI 120
Information Technology Department
Discrete Mathematics Lecture 2: Propositional Logic
The Logic of Declarative Statements
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
Compounding.
boolean Expressions Relational, Equality, and Logical Operators
Presentation transcript:

Introductory Logic PHI 120 Presentation: "Intro to Formal Logic" Please turn off all cell phones!

Homework 1.Study Allen/Hand Logic Primer – "Well-formed Formula," pp. 6-7 – "Binary and Unary Connectives," p. 7 – "Parentheses Dropping Conventions," p. 9 – ("Denial,“ – logically opposite sentences, p. 7) 2.Handout on Class Web Page: – Truth Tables Handout Truth Tables Handout 3.Watch At Home: – “Basic Concepts Review” presentation Bring this handout to class from now on!

New Unit Formal (Symbolic) Logic Today: Basic Grammar of Sentences Sentential Logic

SYMBOLIC ELEMENTS OF THE LOGIC Part I

Expressions any sequence of symbols in the logic Sentences (WFFs) expressions that are well-formed The Well-Formed Formula An initial distinction

Sentences: two basic kinds i.atomic or simple i.cannot be broken into simpler sentences ii.no connectives ii.complex i.made up of simpler sentences ii.they always contain some connective

Symbolic Elements of the Logic 1.Atomic sentences 2.Connectives (or Logical Operators) 3.Parentheses ( … )

Symbolic Elements of the Logic 1.Atomic or Simple Sentences Sentence variables – Examples: » Pe.g., “John dances on the table.” » Q e.g., “The table will be broken.” » R e.g., "James is the man next to the wall over there.

Symbolic Elements of the Logic 2.Connectives (or Logical Operators) ~ the tilde “it is not the case that …” or simply "not" & the ampersand “ … and … ” v the wedge “either … or … ” -> the arrow “if … then … ” the double arrow “ … if and only if … ” Examples: ~P P & Q P v Q P -> Q P Q

Symbolic Elements of the Logic 3.Parentheses – Examples: 1.( P & (Q -> R )) 2.P & (Q -> R) 3.P & Q -> R 4.P & (Q & R) P and (if Q then R) If P and Q then R See page 9: “parentheses dropping conventions” P and (Q and R) Outermost parentheses unnecessary Inner Parentheses When necessary?

Parenthesis Dropping 1.Drop parentheses surrounding sentence. 2.Drop embedded parentheses only if unambiguous. Parenthesis Dropping 1.Drop parentheses surrounding sentence. 2.Drop embedded parentheses only if unambiguous.

KINDS OF VARIABLES Excursus

Kinds of Variables Sentence Variable: P, Q, R, S, T,... – an element of the formal language – stands for any simple (atomic) sentence in natural language Metavariable: Φ (Phi) or Ψ (Psi) – not an element of the formal language – stands for the any WFF – used to represent logical form

The 6 Sentences (WFFs) (pages 6-7) 1) Atomic Sentence (P, Q, R, S, …) 2) Negation~Φ 3) ConjunctionΦ & Ψ 4) Disjunction Φ v Ψ 5) Conditional Φ -> Ψ 6) BiconditionalΦ Ψ 7) and nothing else Unary Binary

READING SYMBOLIC LOGIC Part III (Order of Operations)

The Key to Recognizing Sentences Binding Strength See page 9 Strongest ~ & and/or v -> Weakest

P = We are studying symbolic logic. Q = It is interesting. P = We are studying symbolic logic. ~P = We are not studying symbolic logic. ~~P =It is false that we are not studying symbolic logic. Recognizing Negations The ~ attaches to the symbol directly to the right of it. Examples: ~P~P ~~P ~(P & Q) ~P & ~Q ~(~P & ~Q) NB: the middle statement is not a negation (Note the parentheses) Strongest ~ & and/or v -> Weakest ~Φ~Φ ~Φ~Φ ~Φ~Φ ~Φ~Φ

P = You study hard Q = You will do well on the exams R = Your GPA will go up Conjunctions and Disjunctions The & or v connects two WFFs. Examples: P & Q P v Q P & (Q v R) (P & Q) v R P & (Q -> R) (P -> Q) v R (Note the parentheses) Strongest ~ & and/or v -> Weakest Φ & Ψ and Φ v Ψ Φ & Ψ and Φ v Ψ Φ & Ψ and Φ v Ψ Φ & Ψ and Φ v Ψ P = You study hard Q = You will do well on the exams

P = You study hard Q = You will do well on the exams R = Your GPA will go up Conditional Statements The -> connects two WFFs. Examples: P -> Q P -> ~Q P -> (Q -> R) (P -> Q) -> R P -> Q v R P & Q -> R (Note the parentheses) Strongest ~ & and/or v -> Weakest Φ -> Ψ

P = You study hard Q = You will do well on the exams R = Your GPA will go up Biconditionals The connects two WFFs. Examples: P Q P ~Q P Q & R P v Q R P -> Q R P (Q R) (Note the parentheses) Strongest ~ & and/or v -> Weakest Φ Ψ

Parentheses and Ambiguity What kind of statement is this? P v (Q & R) P v Q & R (unambiguous) (ambiguous) Strongest ~ & and/or v -> Weakest

Summary 1.Elements of Symbolic Logic – (i) Variables, (ii) Connectives, (iii) Parentheses 2.Sentences (or WFFs) – Atomic – Complex 3.Key to Reading Symbolic Logic – Binding Strength of Connective

Homework 1.Study Allen/Hand Logic Primer – "Well-formed Formula," pp. 6-7 – "Binary and Unary Connectives," p. 7 – "Parentheses Dropping Conventions," p. 9 – ("Denial,“ – logically opposite sentences, p. 7) 2.Handout on Class Web Page: – Truth Tables Handout Truth Tables Handout 3.Watch At Home: – “Basic Concepts Review” presentation Bring this handout to class from now on!