The Language S : Æ Ç ! $.

Slides:



Advertisements
Similar presentations
Logic & Critical Reasoning Translation into Propositional Logic.
Advertisements

Logic & Critical Reasoning
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!
Formal Semantics of S. Semantics and Interpretations There are two kinds of interpretation we can give to wffs: –Assigning natural language sentences.
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.
The Language P 8 9 ( 8 x) ( 9 y) ( 8 z) 9 8. Quantificational Logic Quantificational Logic: Quantificational Logic is the logic of sentences involving.
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.
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.
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.
Sentential Logic(SL) 1.Syntax: The language of SL / Symbolize 2.Semantic: a sentence / compare two sentences / compare a set of sentences 3.DDerivation.
Let remember from the previous lesson what is Knowledge representation
SEVENTH EDITION and EXPANDED SEVENTH EDITION
First Order Logic. Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not.
The Language of Propositional Logic The Syntax and Semantics of PL.
Intro to Discrete Structures
Propositions and Truth Tables
Discrete Mathematics and Its Applications
CS 285- Discrete Mathematics Lecture 2. Section 1.1 Propositional Logic Propositions Conditional Statements Truth Tables of Compound Propositions Translating.
Chapter 2 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
SD: Natural Deduction In S. Valid or Not? 1.If Carol drives, Ann will go to the fair 2.Carol will drive, if Bob goes and pays for gas 3.Bob will pay for.
1 Propositional Logic Proposition 2 Propositions can be divided into simple propositions and compound propositions. A simple (or basic) proposition is.
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 "
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.
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
SSK3003 DISCRETE STRUCTURES
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.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
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
Chapter 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Sentential Logic.
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.
Propositional Logic Rather than jumping right into FOL, we begin with propositional logic A logic involves: §Language (with a syntax) §Semantics §Proof.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
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"
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
March 3, 2016Introduction to Artificial Intelligence Lecture 12: Knowledge Representation & Reasoning I 1 Back to “Serious” Topics… Knowledge Representation.
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Sentential logic. Lecture based on: Graeme Forbes, Modern Logic Katarzyna Paprzycka, online lectures.
2. The Logic of Compound Statements Summary
Today’s Topics Symbolizing conditionals and bi-conditionals
Knowledge Representation and Reasoning
Critical Reasoning Lecture 16 An Introduction to Truth Tables
Truth Tables – Logic (Continued)
Identifying Counterexamples
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Chapter 8 Logic Topics
Information Technology Department
Back to “Serious” Topics…
The Logic of Declarative Statements
PROPOSITIONAL LOGIC - SYNTAX-
Statements of Symbolic Logic
CHAPTER 3 Logic.
TRUTH TABLES.
Statements and Logical Connectives
Logic of Informatics Introduction.
Presentation transcript:

The Language S : Æ Ç ! $

Simple and Compound Statements By simple statement we mean a statement which does not contain further statements as parts By compound (or complex) statement we mean a statement which has one or more further statements as a part or parts

Simple and Compound Statements 1. Manet changed painting 2. Manet subverted traditional artistic norms 3. Manet cleared the way for Monet 4. Manet did not change painting 5. Manet changed painting or he subverted traditional artistic norms 6. If Manet did not change painting, then Manet did not clear the way for Monet 7. Monet believed that Manet changed painting 8. Picasso doubted that Monet believed that Manet subverted traditional artistic norms 9. Manet cleared the way for Monet because he subverted traditional artistic norms 10. Manet subverted traditional artistic norms after he cleared the way for Monet

Truth-Functional Compounds Truth-Functional Compound: A statement is a truth-functional compound iff the truth value of the compound statement is completely and uniquely determined by (is a function of) the truth values of the simple component statements.

Truth-Functional Logic Truth-Functional Logic: Truth-Functional Logic is the logic of truth-functional combinations of simple statements. We will study the properties which arguments and statements have in virtue of their truth-functional structure. We will use capital letters, A-Z, to represent simple statements, and truth-functional connective symbols : Æ Ç ! $ to combine simple statements into more complex statements

Negation—The Hook : It is not the case that … Not … The hook is appended directly to the left of the statement to be negated The negation has the truth value opposite that of the negated statement

Conjunction—The Wedge Æ Both … and - - - The two components of the conjunction are called the (left and right) conjuncts A conjunction is T iff both conjuncts are T conjuncts

Disjunction—The Vee Ç Either … or - - - The two components of the disjunction are called the (left and right) disjuncts A disjunction is F iff both disjuncts are F This is an inclusive ‘or’; not an exclusive ‘or’; i.e. it is T when both disjuncts are T disjuncts

Material Conditional— The Arrow ! If …, then - - - … only if - - - The left side of the conditional is the antecedent; the right side is the consequent The material conditional is F iff the antecedent is T and the consequent is F This is not implication, and should not be read as “implies” antecedent consequent

Material Biconditional— The Double Arrow $ … if and only if - - - … iff - - - The material biconditional is T when the two components have the same truth value, and F when they do not This is not equivalence and should not be read as “equals”

Object Language and Metalanguage Object Language: When one is talking about a language, the object language is the language being talked about Metalanguage: When talking about a language, the metalanguage is the language in which one is talking about the object language

Use and Mention Most of the time we use words, phrases, statements to communicate. Sometimes we want to talk about words themselves, so we mention them by enclosing them in quotation marks or by displaying them set off from the main text: Socrates is a Greek philosopher ‘Socrates’ is a Greek name ‘Socrates’ is a Greek philosopher Socrates is a Greek name Blah blah blah blah. The name Socrates is Greek. Blah blah blah blah…

Metavariables Metavariables: Metavariables are variables of the metalanguage which range over (take as possible values) expressions of the object language. A, B, C,…, Z, A1, B1,… Metavariables allow us to speak generally about (mention) the form of expressions in the object language.

Form and Instance

Syntax & Semantics Syntax: Syntax is the study of the signs of a language with regard only to their formal properties—e.g., which shapes are signs the language, what their permissible combinations and transformations are Semantics: Semantics is the study of language with regard to meaningful interpretations or valuations of the components—e.g., what the signs mean and how the meanings of simpler signs contribute to the meanings of combinations of signs

The Symbols of S Statement Letters: A, B, C,…, Z, A1, B1, C1,…, A2,… Truth-Functional Connectives: : Æ Ç ! $ Punctuation Marks: ( )

Expressions of S Definition 2.3.1 (Expression of S). An expression of S is any finite sequence of symbols of S Expression: A1))BZ))!Æ: )($$$B32 :(A Æ :B) Not an Expression: A1$)BZ)@!Æ: )($ga$$B32 :(A Æ :B)

Well-Formed Formulas of S Definition 2.3.2 (Well-Formed Formula of S). Where P and Q range over expressions of S, If P is a statement letter, then P is a wff of S If P and Q are wffs of S, then :P is a wff of S (P Æ Q) is a wff of S (P Ç Q) is a wff of S (P ! Q) is a wff of S (P $ Q) is a wff of S Nothing is a wff of S unless it can be shown so by a finite number of applications of clauses (1) and (2)

Labeled Syntax Tree The labels on the branches indicate which clause of Definition 2.3.2 they represent

Unlabeled Syntax Tree

Syntactic Concepts Atomic Formula: Any wff which qualifies simply in virtue of clause (1) of Def. 2.3.2 (that is, any wff which just is some statement letter), is called an atomic formula, wff, or statement. By analogy, all other wffs are molecular.

Syntactic Concepts Atomic wffs have no main connective. Main Connective, Well-Formed Components: Atomic wffs have no main connective. The main connective of a molecular wff R is the connective appearing in the clause of Def. 2.3.2 cited last in showing R to be a wff. The immediate well-formed components of a molecular wff are the values of P and Q (in the case of clause (2a) simply P) in the last-cited clause of Def. 2.3.2. The well-formed components of a wff are the wff itself, its immediate well-formed components, and the well-formed components of its immediate well-formed components. The atomic components of a wff are the well-formed components which are atomic wffs.

Main Connective and Components Atomic components Well-formed components Immediate well-formed components Main Connective The wff itself

:((D ! A) Æ (:C $ A)) Syntactic Concepts Scope: The scope of a connective is that portion of the wff containing its immediate sentential component(s). :((D ! A) Æ (:C $ A))

‘Not’, ‘And’, ‘Or’ Not Both P and Q :(P Æ Q) Both Not-P and Not-Q m Either Not-P or Not-Q :P Ç :Q Neither P nor Q :(P Ç Q)

‘If’, ‘Only If’, ‘If and Only If’ ‘if’ alone: If P, then Q P ! Q Q, if P ‘only if’ alone: Only if P, Q Q ! P Q, only if P ‘if’ and ‘only if’: P if and only if Q P $ Q P if Q, and only if Q If P then Q, and if Q then P P iff Q

Necessary and Sufficient P is sufficient for Q For Q, it is sufficient that P If P, then Q P ! Q P is necessary for Q For Q, it is necessary that P Q only if P Q ! P P is necessary and sufficient for Q P iff Q P $ Q Q $ P

‘Unless’ P unless Q Unless Q, P :Q ! P :P ! Q P Ç Q

A Translation Key (Interpretation) E: Elmo is a monster G: Grover is a monster F: Elmo is furry U: Grover is furry R: Elmo is red B: Grover is blue L: Elmo has googly eyes O: Grover has googly eyes S: Elmo can sing D: Elmo can dance I: Grover can sing A: Grover can dance

Another Translation Key A: Ann goes to the fair B: Bob goes to the fair C: Carol goes to the fair D: Ann drives E: Bob drives F: Carol drives L: Ann eats lots of popcorn M: Bob eats lots of popcorn N: Carol eats lots of popcorn O: Ann pays P: Bob pays Q: Carol pays R: Ann rides the roller coaster S: Bob rides the roller coaster T: Carol rides the roller coaster X: Ann throws up Y: Bob throws up Z: Carol throws up

A Third Translation Key S: Figure 1 is a square Q: Figure 1 is a quadrilateral U: Figure 1 has opposite sides equal A: Figure 1 has equal angles R: Figure 1 is a rectangle E: Figure 1 has equal sides