Sentential logic. Lecture based on: Graeme Forbes, Modern Logic Katarzyna Paprzycka, online lectures.

Slides:



Advertisements
Similar presentations
Logic & Critical Reasoning Translation into Propositional Logic.
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 
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.
Introductory Logic PHI 120 Presentation: "Intro to Formal Logic" Please turn off all cell phones!
Semantics and Inference Part I Johan Bos. Overview of this lecture Inferences on the sentence level –Entailment –Paraphrase –Contradiction Using logic.
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.
6.1 Symbols and Translation
Symbolization techniques Identify component propositions.
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.
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.
PHIL 120: Jan 8 Basic notions of logic
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
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.
Adapted from Discrete Math
Intro to Discrete Structures
Discrete Mathematics and Its Applications
Logic Introduction to 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.
1 Propositional Logic Proposition 2 Propositions can be divided into simple propositions and compound propositions. A simple (or basic) proposition is.
The Language S : Æ Ç ! $.
Symbolic Language and Basic Operators Kareem Khalifa Department of Philosophy Middlebury College.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Objectives 1. Statements, quantifiers, and compound statements 2. Statements involving the words not,
Pattern-directed inference systems
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.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
PHIL 120: Third meeting I. I. What to know for Test 1 (in general terms). II. II. Symbolizing compound sentences (cont’d) a. a. Paying attention to English.
Propositional Logic Symbolic logic If A, then B A  B Capital letters stand for simple sentences A simple sentence is an affirmative single statement “It’s.
Metalogic. TWO CONCEPTIONS OF LOGICAL CONSEQUENCE.
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.
Symbolization techniques Identify component propositions.
Week 8 Discussion: Ch 8, TA: Karin Howe PHIL 121 Spring 2012.
Introductory Logic PHI 120 Presentation: "Truth Tables – Sentences"
March 3, 2016Introduction to Artificial Intelligence Lecture 12: Knowledge Representation & Reasoning I 1 Back to “Serious” Topics… Knowledge Representation.
Logic.
CSNB 143 Discrete Mathematical Structures
Today’s Topics Symbolizing conditionals and bi-conditionals
Knowledge Representation and Reasoning
Logic.
Identifying Counterexamples
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Truth Functions.
Information Technology Department
CS201: Data Structures and Discrete Mathematics I
Back to “Serious” Topics…
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Lecture 2: Propositional Logic
The Logic of Declarative Statements
CHAPTER 3 Logic.
TRUTH TABLES.
Statements and Logical Connectives
Logic of Informatics Introduction.
The Structure of Sentential Logic
CS201: Data Structures and Discrete Mathematics I
Truth tables.
Presentation transcript:

Sentential logic

Lecture based on: Graeme Forbes, Modern Logic Katarzyna Paprzycka, online lectures

Sentential logic or propositional logic?

Logic is the most boring class Jane has ever taken. The most boring class Jane has ever taken is logic.

A sentence in the logical sense is only an unambiguous declarative sentence. it is either true or false. (a) No exclamations are sentences L. “Heyah!” “Come here!” (b) No questions are sentences L Are you bored already?

(c) No ambiguous declarative sentences are sentences L (d) No declarative sentences with indexical expressions are sentences L. There is a class of sentences containing the so- called “indexical” expressions (like ‘I’, ‘he’, ‘she’, ‘there’, ‘now’, etc.) that are notoriously ambiguous because the indexical expressions change their referent depending on the context in which they are uttered. I am hungry now.

NEGATION Connective: It is not the case that Symbol: ~ [the tilde] Logical form: ~p Component: p – negated sentence

CONJUNCTION Connective: and Symbol:  Logical form: p  q Components: p, q – conjuncts

both... and as well as but however though although even though nevertheless …... still …... but still …... also …... while …... despite the fact that …... moreover …... in addition …

DISJUNCTION Connective: or Symbol: ∨ [the wedge] Logical form: p ∨ q Components: p, q – disjuncts

either... or... … or else …

CONDITIONAL Connective: if … then … Symbol: → [the arrow] Logical form: p → q Components: p – antecedent q – consequent

... if provided that given that in case in the event that as long as assuming that supposing that on the condition that on the assumption that...

BICONDITIONAL Connective: if and only if Symbol:  Logical form: p  q Components: p, q – terms of the biconditional; right and left hand sides

... if but only if... … when and only when … … just in case … … iff … … exactly if …

Symbolization Our currency will lose value. Our currency will lose value and our trade deficit will narrow. Either our currency will lose value, or exports will decrease and inflation will rise.

John will attend the meeting but Mary will not. Insider trading is unethical and illegal. At least one of our two deficits, budget and trade, will rise. Neither John nor Mary will attend the meeting. John and Mary won’t both attend the meeting.

If Smith bribes the instructor, then Smith will get an A.

Smith will get an A if Smith bribes the instructor.

Smith’s bribing the instructor is a sufficient condition for Smith to get an A.

Smith will get an A only if Smith bribes the instructor. Smith bribing the instructor is a necessary condition for Smith to get an A.

Smith will get an A provided Smith bribes the instructor. Smith will get an A whenever Smith bribes the instructor.

Smith will fail unless he bribes the instructor.

Your car will not start unless it has fuel in its tank.

Smith will get an A if and only if Smith bribes the instructor. Smith will get an A just in case Smith bribes the instructor.

John will study hard and also bribe the instructor, and if he does both then he’ll get an A, provided the instructor likes him.

If Smith bribes the instructor then he’ll get an A. And if he gets an A potential employers will be impressed and will make him offers. But Smith will receive no offers. Therefore Smith will not bribe the instructor.

If logic is difficult, then few students will take logic courses unless such courses are obligatory. If logic is not difficult then logic courses will not be obligatory. So if a student can choose whether or not to take logic, then either logic is not difficult or few students take logic courses.

If God exists, there will be no evil in the world unless God is unjust, or not omnipotent, or not omniscient. But if God exists the He is none of these, and there is evil in the world. So we have to conclude that God does not exist.

SYNTAX uninterpreted: the basic elements (apart from the connectives) do not have their own meaning the basic elements are sentence-letters (not words) The lexicon of LSL contains infinitely many sentence-letters

A sentence-letter symbolizes an atomic sentence; stands for a fixed sentence p, q – sentential variables, metavariables; do not stand for fixed sentences

The lexicon of LSL: All sentence-letters “A”, “B”, “C”, Connectives Punctuation marks “(“, “)” Well-formed formula = grammatical formula (wff)

Formation rules: conditionals: if it is given a wff or wffs as input, then such and such a wff results as an output

Formation rules Every sentence letter is a well formed formula (wff). If p is a wff, so is  p  If p and q are wffs, so is  p  q  If p and q are wffs, so is  p  q  If p and q are wffs, so is  p  q  If p and q are wffs, so is  p  q  Closure condition: nothing is a wff unless certified as such by the above rules

The object language – the metalanguage mouse ”mouse”

Use/mention distinction Warsaw is the capital of Poland. use “Warsaw” contains 6 letters.Mention “Mouse” is an animal. Mouse is a noun.

Corner quotes = selective quotes – corner quotes around a whole expression put ordinary quotes selectively around parts of the expression, those parts which are object language symbols. If p and q are wffs, so is “p  q” – incorrect If p and q are wffs, the result of writing p followed by “  ” followed by q is a wff.

SEMANTICS If a sentence is true then it is said to have the truth-value true The Principle of Bivalence: there are exactly two truth-values, truth and false. Every meaningful sentence, simple or compound, has one or the other, but not both, of these truth-values.

Any sentential connective whose meaning can be captured in a truth-table is called a truth-functional connective and is said to express a truth-function.