Introduction to Pragmatics
|
|
- Martin Houston
- 5 years ago
- Views:
Transcription
1 Introduction to Pragmatics Summer 2016 Tuesdays 2321.HS 3H INSTRUCTOR Todor Koev (Todor.Koev@uni-duesseldorf.de)
2 Presupposition projection Presupposition is a prevalent type of inference in language. We have looked at various properties of presupposition, incl. presupposition projection. Presupposition projection: the ability of presuppositions to survive when the sentence is negated, modalized, conditionalized, or questioned. Example: Both sentences in (1) imply (2). (1) a. Ben found his glasses. b. Ben didn t find his glasses. (2) Ben has/wears glasses.
3 The projection problem The projection problem: How do the presuppositions of a sentence depend on the presuppositions of its parts? The cumulative hypothesis: The sentence as a whole inherits all of the presuppositions of its parts. Example: (3) A presupposes p B presupposes q A and B presupposes p and q A or B presupposes p and q... This is the idea behind the Family of Sentences Test.
4 Three-valued logic We fleshed out the cumulative hypothesis in a three-valued logic. There are three truth values: 1 (true) 0 (false) # ( undefined / infelicitous ) Three-valued logic incorporates classical logic: o If truth values assigned to subformulas are classical (1 or 0), then the entire formula is classical (1 or 0). o If, however, one or more parts of a formula are undefined (#), then the entire formula is undefined (#). Undefinedness projects from smaller parts to the entire sentence. A single instance of presupposition failure renders the entire sentence infelicitous. This analysis predicts that presuppositions never disappear.
5 Problems Presuppositions typically project past operators (negation, etc.). However: Presuppositions are sometimes cancelable. They do not always project! Presuppositions can be blocked in a variety of syntactic environments, e.g. conditionals, conjunctions, disjunctions. Conditional antecedents (=if-clauses) can sometimes block presuppositions triggered in the main sentence (the consequent). (4) Jessica s brother must be tall. Jessica has a brother. (5) If Jessica has a brother, her brother must be tall. >/> Jessica has a brother.
6 Problems cont d Initial conjuncts can block presuppositions triggered by by second conjunct. (6) presupposes that Mike has a car. (7) entails but does not presuppose that Mike has a car, as seen from (8). (6) Mike s car is expensive. Mike has a car. (7) Mike s has a car and his car is expensive. Mike has a car. >/> Mike has a car. (8) It s possible that [Mike has a car and his car is expensive]. >/> Mike has a car.
7 Problems cont d Finally, disjuncts too can block presuppositions. (9) The bathroom is in a funny place. There is a bathroom. (10) This house has no bathroom or the bathroom/it is in a funny place. >/> There is a bathroom. Presuppositions do not always project. This argues against the cumulative hypothesis and is bad news for the three-valued account of projection. The million dollar question: Is presupposition cancelation random or is there a pattern to it?
8 Empirical generalizations Presuppositions are not canceled by negation. (11) Ben didn t find his glasses. Ben has/wears glasses. Presuppositions are canceled when entailed by a previous conjunct. (12) It s possible that [Mike has a car and his car is expensive]. >/> Mike has a car. Presuppositions are canceled when entailed by a previous if-clause. (13) If Jessica has a brother, her brother must be tall. >/> Jessica has a brother. Presuppositions are canceled when negated in a previous disjunct. (14) This house has no bathroom or the bathroom is in a funny place. >/> There is a bathroom.
9 A discourse-based account We discuss the local context account of presupposition projection. It preserves the idea that presupposition failure results in infelicity. However, it also pays attention to the way information is processed in discourse. Main idea: Presuppositions should be entailed by the context (the shared body of information) with respect to which a clause (not the entire sentence!) is interpreted. Static view: Sentence meaning is truth conditions. Dynamic view: Sentence meaning is context change (the way a sentence updates the information shared among interlocuters). The account is termed in set theory.
10 Possible world semantics Static view: Semantics is about truth conditions. Each sentence is true or false. John is smart 1 or John is smart 0 o is the interpretation function. o S is the meaning of sentence S. Static possible world view: A sentence is true or false with respect to a possible world (w 1, w 2, ). w John is smart 1 w 1, John is smart 2 0, etc. Equivalently: The meaning of a sentence is the set of all possible worlds in which the sentence is true. John is smart { w John is smart in w }
11 What is a possible world? A possible world is any conceivable way the world could be. You can think of a possible world as a situation or a state of affairs or what is the case or. Formally: A possible world is a formal object that determines the truth value of each sentence. So: Sentences are not true or false simpliciter. They are true or false in a given possible world. If is the actual world (=the world as we know it), then Snow is white is true in
12 From statics to dynamics Utterances update our information about the world. The meaning of a sentence is the effect it has on the (linguistic) context. Def (context): The set of possible worlds which are compatible with everything we know. c { w w is compatible with everything we know} Alternatively: A context is the set of possible worlds which are live candidates to represent the actual world Sentences affect c in different ways depending on their content and their structure. c +A means we update context c with sentence A OR sentence A is uttered in context c
13 Dynamic semantics Def (entailment): Context c entails atomic sentence q iff In words: c entails q iff q is true in all worlds in c. Atomic sentences: (15) In words: c p if c entails q c p q # otherwise Complex sentences: c q. p can be felicitously uttered in c only if c entails its presupposition q. (16) c not- A c ( c A ) (negation) (17) c A and B ( c A) B (conjunction) (18) c A or B ( c A) ( c not- A) B (disjunction) (19) c if A then B ( c not- A) ( c A) B (conditional)
14 Comments This dynamic semantics achieves two things at the same time: I. It gets the truth conditions right. II. It accounts for the pattern of presupposition projection observed above, namely: i. Presuppositions project through negation (and other operators). ii. Presuppositions can be blocked in conjunctions, disjunctions, and conditional sentences.
15 Getting the truth conditions Assume that p and q are atomic sentences with no presupposition triggers in them. So p and q trigger no presuppositions. c not- p c ( c p ) (16) c ( c p ) (15) c p (set theory) o Updating c with not-p removes all worlds in c in which p is true. c p and q ( c p) q (17) ( c p ) q (15) o Updating c with p and q intersects c with p and with q. Practice: What do c p or q and c if p then q amount to?
16 Example: Using the semantics Let the conjunctive sentence It s sunny and I m going out be uttered in the context c, where c ={w 1, w 2, w 3 }, It s sunny ={w 1, w 2 }, I m going out ={w 1, w 3 } Compute the meaning of the sentence in c. c + It s sunny and I m going out = (c + It s sunny) + I m going out (17) = (c It s sunny ) I m going out (15), applied twice = ({w 1, w 2, w 3 } {w 1, w 2 }) {w 1, w 3 } (given) = {w 1, w 2 } {w 1, w 3 } (intersection) = {w 1 } (intersection) Q: Why is this the intuitively correct result?
17 Getting presupposition projection Assume that p and q are atomic sentences and that q presupposes p. c not- q c ( c q ) (16) p p o According to (15), c q p is only defined if c, the starting or global context, already entails p. o That is, presuppositions project through negation. c p and q ( c p) q (17) p p o According to (15), ( c p) q p is only defined is c + p entails p. o This is necessarily true! So asserting p in the first conjunct blocks the presupposition p of the second conjunct. Practice: What is the predicted projection pattern for c not- p or q p and c if p then q p?
18 Example 2: Conditionals Generalization from above: Presuppositions are canceled when entailed by a previous if-clause. (20) Jessica s brother is tall. >> Jessica has a brother. (21) If Jessica has a brother, her brother is tall. >/> Jessica has a brother. Model: c = {w 1, w 2, w 3, w 4 } q c p = Jessica has a brother = {w 1, w 2 } p w 1 w 2 q = her brother is tall = {w 1, w 3 } w 3 w 4 Logical form for (21): if p then q p
19 Example 2: Tasks Tasks: i. Truth conditions If (21) is uttered in the context c, what do you expect the context c + (21) to be (ignoring any presuppositions)? Compute the truth conditions for c + if p then q in the above model. ii. Presupposition projection Derive from the dynamic semantics the intuition that the presupposition p of q is canceled / does not project / does not impose any restrictions on the global context c.
20 Example 2: Intuitions Truth table for (21): w w w w p q We can view the rows in the truth table as possible worlds. The input context is c = {w 1, w 2, w 3, w 4 }. The only world that falsifies the sentence is w 2, so we expect the output context to be c + if p then q = {w 1, w 3, w 4 }. Let s find out!
21 Example 2: Truth conditions c if p then q ( c not- p) ( c p) q (19) ( c ( c p)) ( c p) q (16) c p c p (15) { w1, w2, w3, w4} { w1, w 2} (given) { w, w } ( ) 1 2 ( c { w, w }) { w, w } q (above) c { w1, w 2} { w1, w2, w3, w4} { w1, w2} { w3, w 4} (given, ) { w, w } q { w, w } q { w, w } { w, w } { w } (15, given, ) { w3, w 4} { w1} (above) { w, w, w } ( ) 1 3 4
22 Example 2: Presupposition proj c if p then q p ( c not- p) ( c p) q p (19) ( c ( c p)) ( c p) q p (16) ( c ( c p)) (( c p) q ), if c + p entails p (15) Tackling the presupposition p of q requires that the context c + p entails p. Since this will always hold no matter what p might stand for the presupposition p is guaranteed to be always true. We correctly predict that the presupposition of (21) that Jessica has a brother does not project / is canceled / does not impose any restrictions on the global context c!
23 Global vs. local context Two notions of a context in semantics/pragmatics: o Linguistic context: The information shared among speech participants, because it was uttered or can be safely assumed as background knowledge. (We covered this notion today.) o Non-linguistic/Utterance context: the speaker, the hearer, the time, the place of the utterance, etc. (Yet to be discussed.) Global vs. local linguistic context: o Global context: The initial context against which the entire sentence is interpreted. o Local context: The initial context + any information introduced by a previous part of the same sentence. o For sentence-initial clauses: global context = local context.
24 Quick check Imagine that a derivation delivered the following, where p and q are atomic sentences: c ( p and q) ( c p) q o What is the global context for p? o What is the local context for p? o What is the global context for q? o What is the local context for q? o Is the global context the same for all parts of the sentence? o Is the local context the same for all parts of the sentence?
25 Summary Dynamic semantics makes a shift in perspective: from static truth conditions to dynamic updates of the context. It captures the truth conditions of complex sentences and explains why presuppositions are sometimes canceled. If a presupposition is independent of the sentence meaning, the presupposition needs to be entailed by the global/initial context. o We get the intuition of that this presupposition projects. If, however, some initial part of the sentence has already added to the context the presupposition of a later part of the sentence, the presupposition will necessarily be entailed by the local context. o We feel that the presupposition is blocked / not required to hold in the initial context. Presuppositions need to be entailed by the local/immediate context, not necessarily by the global context in which the entire sentence is uttered!
26 For next time Please read: Conventional implicature
Presuppositions (introductory comments)
1 Presuppositions (introductory comments) Some examples (1) a. The person who broke the typewriter was Sam. b. It was Sam who broke the typewriter. c. John screwed up again. d. John likes Mary, too. e.
More informationBasics of conversational implicatures
Semantics I, Rutgers University Week 12 Yimei Xiang November 19, 2018 1. Implication relations Basics of conversational implicatures Implication relations are inferential relations between sentences. A
More informationBar-Hillel and the Division of Labor in Language
Bar-Hillel and the Division of Labor in Language On the interaction of grammar, logic, and pragmatics Luka Crnič November 2, 2015 Language, Logic and Cognition Center http://scholars.huji.ac.il/llcc Luka
More informationDeduction by Daniel Bonevac. Chapter 3 Truth Trees
Deduction by Daniel Bonevac Chapter 3 Truth Trees Truth trees Truth trees provide an alternate decision procedure for assessing validity, logical equivalence, satisfiability and other logical properties
More informationBreaking de Morgan s law in counterfactual antecedents
Breaking de Morgan s law in counterfactual antecedents Lucas Champollion New York University champollion@nyu.edu Ivano Ciardelli University of Amsterdam i.a.ciardelli@uva.nl Linmin Zhang New York University
More informationLogic: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
More informationDescription Logics. Foundations of Propositional Logic. franconi. Enrico Franconi
(1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge
More informationLogical Agents. Knowledge based agents. Knowledge based agents. Knowledge based agents. The Wumpus World. Knowledge Bases 10/20/14
0/0/4 Knowledge based agents Logical Agents Agents need to be able to: Store information about their environment Update and reason about that information Russell and Norvig, chapter 7 Knowledge based agents
More informationInquisitive semantics
Inquisitive semantics NASSLLI 2012 lecture notes Ivano Ciardelli University of Bordeaux Floris Roelofsen University of Amsterdam June 25, 2012 Jeroen Groenendijk University of Amsterdam About this document
More informationGender in conditionals
Gender in conditionals Fabio Del Prete 1 Sandro Zucchi 2 1 CLLE-ERSS (CNRS, Toulouse), 2 Università degli Studi di Milano 9 November 2017 The University of Sheffield, Department of Philosophy Indexical
More informationPropositional Logic: Part II - Syntax & Proofs 0-0
Propositional Logic: Part II - Syntax & Proofs 0-0 Outline Syntax of Propositional Formulas Motivating Proofs Syntactic Entailment and Proofs Proof Rules for Natural Deduction Axioms, theories and theorems
More informationLogical Representations. LING 7800/CSCI 7000 Martha Palmer 9/30/2014
Logical Representations LING 7800/CSCI 7000 Martha Palmer 9/30/2014 1 The Semantic Wall Physical Symbol System World +BLOCKA+ +BLOCKB+ +BLOCKC+ P 1 :(IS_ON +BLOCKA+ +BLOCKB+) P 2 :((IS_RED +BLOCKA+) Truth
More informationOn the semantics and logic of declaratives and interrogatives
Noname manuscript No. (will be inserted by the editor) On the semantics and logic of declaratives and interrogatives Ivano Ciardelli Jeroen Groenendijk Floris Roelofsen Received: date / Accepted: 17-9-2013
More informationGlobal Approach to Scalar Implicatures in DRT*
Article Global Approach to Scalar Implicatures in DRT* Jae-Il Yeom Hongik University Language and Linguistics 16(1) 3 42 The Author(s) 2015 Reprints and permissions: sagepub.co.uk/journalspermissions.nav
More informationFirst-Degree Entailment
March 5, 2013 Relevance Logics Relevance logics are non-classical logics that try to avoid the paradoxes of material and strict implication: p (q p) p (p q) (p q) (q r) (p p) q p (q q) p (q q) Counterintuitive?
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationGeneralized Quantifiers Logical and Linguistic Aspects
Generalized Quantifiers Logical and Linguistic Aspects Lecture 1: Formal Semantics and Generalized Quantifiers Dag Westerståhl University of Gothenburg SELLC 2010 Institute for Logic and Cognition, Sun
More informationTHE LOGIC OF COMPOUND STATEMENTS
CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 2.1 Logical Form and Logical Equivalence Copyright Cengage Learning. All rights reserved. Logical Form
More informationHomogeneity and Plurals: From the Strongest Meaning Hypothesis to Supervaluations
Homogeneity and Plurals: From the Strongest Meaning Hypothesis to Supervaluations Benjamin Spector IJN, Paris (CNRS-EHESS-ENS) Sinn und Bedeutung 18 Sept 11 13, 2013 1 / 40 The problem (1) Peter solved
More informationAlternative Notations and Connectives
Appendix B-1 Alternative Notations and Connectives The logical language we have studied in this chapter is the best known classical system oflogic of statements. There are various alternative symbolic
More informationTruth-Functional Logic
Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence
More informationUniform Definability in Assertability Semantics
Uniform Definability in Assertability Semantics Institute for Logic, Language and Computation, Universiteit van Amsterdam S.N.M.Steinert-Threlkeld@uva.nl Abstract This paper compares two notions of expressive
More informationThe Importance of Being Formal. Martin Henz. February 5, Propositional Logic
The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets
More informationBerlin, May 16 / 2003
Berlin, May 16 / 2003 1 The challenge of free choice permission The basic puzzle epistemic variants wide disjunction FC permission and quantification Conjunctive permission 2 The basic puzzle (1) a. You
More informationIntroduction to Artificial Intelligence Propositional Logic & SAT Solving. UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010
Introduction to Artificial Intelligence Propositional Logic & SAT Solving UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010 Today Representation in Propositional Logic Semantics & Deduction
More informationInference in Propositional Logic
Inference in Propositional Logic Deepak Kumar November 2017 Propositional Logic A language for symbolic reasoning Proposition a statement that is either True or False. E.g. Bryn Mawr College is located
More informationToday s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)
Today s Lecture 2/25/10 Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Announcements Homework: -- Ex 7.3 pg. 320 Part B (2-20 Even). --Read chapter 8.1 pgs. 345-361.
More information(6) Some students who drank beer or wine were allowed to drive.
Global Approach to Scalar Implicatures in Dynamic Semantics Jae-Il Yeom Hongik University English Language and Literature 94 Wausan-ro, Sangsu-dong, Mapo-gu Seoul 121-791 KOREA jiyeom@hongik.ac.kr Abstract
More informationOverview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural
More informationE-type interpretation without E-type pronoun: How Peirce s Graphs. capture the uniqueness implication of donkey sentences
E-type interpretation without E-type pronoun: How Peirce s Graphs capture the uniqueness implication of donkey sentences Author: He Chuansheng (PhD student of linguistics) The Hong Kong Polytechnic University
More informationCS 4700: Artificial Intelligence
CS 4700: Foundations of Artificial Intelligence Fall 2017 Instructor: Prof. Haym Hirsh Lecture 12 Prelim Tuesday, March 21 8:40-9:55am Statler Auditorium Homework 2 To be posted on Piazza 4701 Projects:
More informationArtificial Intelligence. Propositional logic
Artificial Intelligence Propositional logic Propositional Logic: Syntax Syntax of propositional logic defines allowable sentences Atomic sentences consists of a single proposition symbol Each symbol stands
More informationPhilosophy 220. Truth-Functional Equivalence and Consistency
Philosophy 220 Truth-Functional Equivalence and Consistency Review Logical equivalency: The members of a pair of sentences [of natural language] are logically equivalent if and only if it is not [logically]
More informationArtificial Intelligence: Knowledge Representation and Reasoning Week 2 Assessment 1 - Answers
Artificial Intelligence: Knowledge Representation and Reasoning Week 2 Assessment 1 - Answers 1. When is an inference rule {a1, a2,.., an} c sound? (b) a. When ((a1 a2 an) c) is a tautology b. When ((a1
More informationPropositional Logic. Spring Propositional Logic Spring / 32
Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements
More informationLogic. Readings: Coppock and Champollion textbook draft, Ch
Logic Readings: Coppock and Champollion textbook draft, Ch. 3.1 3 1. Propositional logic Propositional logic (a.k.a propositional calculus) is concerned with complex propositions built from simple propositions
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More information22c:145 Artificial Intelligence
22c:145 Artificial Intelligence Fall 2005 Propositional Logic Cesare Tinelli The University of Iowa Copyright 2001-05 Cesare Tinelli and Hantao Zhang. a a These notes are copyrighted material and may not
More informationChapter 4: Classical Propositional Semantics
Chapter 4: Classical Propositional Semantics Language : L {,,, }. Classical Semantics assumptions: TWO VALUES: there are only two logical values: truth (T) and false (F), and EXTENSIONALITY: the logical
More informationDiscrete Mathematics
Discrete Mathematics Discrete mathematics is devoted to the study of discrete or distinct unconnected objects. Classical mathematics deals with functions on real numbers. Real numbers form a continuous
More informationA Weakness for Donkeys
(1) Math Review A Weakness for Donkeys Carl Pollard Linguistics 794.14/812 April 21, 2011 Recall that if S, and P, are two preordered sets, then f : S P is called monotonic (antitonic) iff for all s, s
More informationCS 331: Artificial Intelligence Propositional Logic I. Knowledge-based Agents
CS 331: Artificial Intelligence Propositional Logic I 1 Knowledge-based Agents Can represent knowledge And reason with this knowledge How is this different from the knowledge used by problem-specific agents?
More informationKnowledge-based Agents. CS 331: Artificial Intelligence Propositional Logic I. Knowledge-based Agents. Outline. Knowledge-based Agents
Knowledge-based Agents CS 331: Artificial Intelligence Propositional Logic I Can represent knowledge And reason with this knowledge How is this different from the knowledge used by problem-specific agents?
More informationIndicative Scorekeeping
Indicative Scorekeeping Malte Willer Abstract Folklore has it that counterfactual Sobel sequences favor a variably strict analysis of conditionals over its plainly strict alternative. Recent discussions
More information10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference
Logic? Propositional Logic (Rosen, Chapter 1.1 1.3) TOPICS Propositional Logic Truth Tables Implication Logical Proofs 10/1/12 CS160 Fall Semester 2012 2 What is logic? Logic is a truth-preserving system
More informationTwo sets of alternatives for numerals
ECO5 @ Harvard April 11, 2015 Teodora Mihoc, tmihoc@fas.harvard.edu Alexander Klapheke, klapheke@fas.harvard.edu Two sets of alternatives for numerals Contents 1 Preliminaries 1 2 Horn-style alternatives:
More informationLanguage of Propositional Logic
Logic A logic has: 1. An alphabet that contains all the symbols of the language of the logic. 2. A syntax giving the rules that define the well formed expressions of the language of the logic (often called
More informationEpistemic Modals and Informational Consequence
Epistemic Modals and Informational Consequence [This is a penultimate draft. Please quote only from the published version. The paper is already available through Online First at http://www.springerlink.com/content/0039-7857]
More informationKnowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.
Knowledge representation Introduction Knowledge is the progression that starts with data which s limited utility. Data when processed become information, information when interpreted or evaluated becomes
More informationCOMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning
COMP9414, Monday 26 March, 2012 Propositional Logic 2 COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning Overview Proof systems (including soundness and completeness) Normal Forms
More informationIntelligent Systems. Propositional Logic. Dieter Fensel and Dumitru Roman. Copyright 2008 STI INNSBRUCK
Intelligent Systems Propositional Logic Dieter Fensel and Dumitru Roman www.sti-innsbruck.at Copyright 2008 STI INNSBRUCK www.sti-innsbruck.at Where are we? # Title 1 Introduction 2 Propositional Logic
More informationLogic and Inferences
Artificial Intelligence Logic and Inferences Readings: Chapter 7 of Russell & Norvig. Artificial Intelligence p.1/34 Components of Propositional Logic Logic constants: True (1), and False (0) Propositional
More informationPragmatic effects in processing superlative and comparative quantifiers: epistemic-algorithmic approach
Pragmatic effects in processing superlative and comparative quantifiers: epistemic-algorithmic approach Maria Spychalska, Institute of Philosophy II, Ruhr-University Bochum September 27, 2013 1 2 3 Superlative
More informationOutline. A Uniform Theory of Conditionals Stalnaker and Beyond. Stalnaker (1975) Uniform Theory of Conditionals and Response to Direct Argument
Outline A Uniform Theory of Conditionals Stalnaker and Beyond William Starr 03.05.12 1 Stalnaker on the Direct Argument 2 Two Kinds of Conditionals 3 Stalnaker s Analysis 4 A New Analysis William Starr
More informationCSCI 5582 Artificial Intelligence. Today 9/28. Knowledge Representation. Lecture 9
CSCI 5582 Artificial Intelligence Lecture 9 Jim Martin Today 9/28 Review propositional logic Reasoning with Models Break More reasoning Knowledge Representation A knowledge representation is a formal scheme
More informationSymbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.
Symbolic Logic 3 Testing deductive validity with truth tables For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true. So, given that truth tables
More informationA Review of the Essentials of Extensional Semantics 1
A Review of the Essentials of Extensional Semantics 1 1. The Big Picture (1) Our Ultimate Goal A precise, formal theory of a particular sub-component the human language faculty: the ability to productively
More informationPropositional Logic. Fall () Propositional Logic Fall / 30
Propositional Logic Fall 2013 () Propositional Logic Fall 2013 1 / 30 1 Introduction Learning Outcomes for this Presentation 2 Definitions Statements Logical connectives Interpretations, contexts,... Logically
More informationa. ~p : if p is T, then ~p is F, and vice versa
Lecture 10: Propositional Logic II Philosophy 130 3 & 8 November 2016 O Rourke & Gibson I. Administrative A. Group papers back to you on November 3. B. Questions? II. The Meaning of the Conditional III.
More information5. And. 5.1 The conjunction
5. And 5.1 The conjunction To make our logical language more easy and intuitive to use, we can now add to it elements that make it able to express the equivalents of other sentences from a natural language
More informationApplied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018
More informationWarm-Up Problem. Is the following true or false? 1/35
Warm-Up Problem Is the following true or false? 1/35 Propositional Logic: Resolution Carmen Bruni Lecture 6 Based on work by J Buss, A Gao, L Kari, A Lubiw, B Bonakdarpour, D Maftuleac, C Roberts, R Trefler,
More informationMust... stay... strong!
Alex Goebel 620 Spring 2016 Paper Presentation of von Fintel & Gillies (2010) Synopsis Must... stay... strong! Von Fintel & Gillies (vf&g) argue against a weakened semantics of must and propose an alternative
More informationIntermediate Logic. Natural Deduction for TFL
Intermediate Logic Lecture Two Natural Deduction for TFL Rob Trueman rob.trueman@york.ac.uk University of York The Trouble with Truth Tables Natural Deduction for TFL The Trouble with Truth Tables The
More informationRecap from Last Time
NP-Completeness Recap from Last Time Analyzing NTMs When discussing deterministic TMs, the notion of time complexity is (reasonably) straightforward. Recall: One way of thinking about nondeterminism is
More informationAnnouncements. CS243: Discrete Structures. Propositional Logic II. Review. Operator Precedence. Operator Precedence, cont. Operator Precedence Example
Announcements CS243: Discrete Structures Propositional Logic II Işıl Dillig First homework assignment out today! Due in one week, i.e., before lecture next Tuesday 09/11 Weilin s Tuesday office hours are
More informationLecture 7. Logic. Section1: Statement Logic.
Ling 726: Mathematical Linguistics, Logic, Section : Statement Logic V. Borschev and B. Partee, October 5, 26 p. Lecture 7. Logic. Section: Statement Logic.. Statement Logic..... Goals..... Syntax of Statement
More informationSemantics and Pragmatics of NLP
Semantics and Pragmatics of NLP Alex Ewan School of Informatics University of Edinburgh 28 January 2008 1 2 3 Taking Stock We have: Introduced syntax and semantics for FOL plus lambdas. Represented FOL
More informationA modal analysis of presupposition and modal subordination
A modal analysis of presupposition and modal subordination Robert van Rooij Institute for Logic, Language and Computation University of Amsterdam R.A.M.vanRooij@uva.nl Abstract In this paper I will give
More informationIndicative conditionals
Indicative conditionals PHIL 43916 November 14, 2012 1. Three types of conditionals... 1 2. Material conditionals... 1 3. Indicatives and possible worlds... 4 4. Conditionals and adverbs of quantification...
More informationPropositional logic. First order logic. Alexander Clark. Autumn 2014
Propositional logic First order logic Alexander Clark Autumn 2014 Formal Logic Logical arguments are valid because of their form. Formal languages are devised to express exactly that relevant form and
More informationHedging Your Ifs and Vice Versa
Hedging Your Ifs and Vice Versa Kai von Fintel and Anthony S. Gillies MIT and Rutgers November 21 University of Latvia Ramsey s Test If two people are arguing If p will q? and are both in doubt as to p,
More informationINTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims
Introduction INTRODUCTION TO LOGIC 2 Syntax and Semantics of Propositional Logic Volker Halbach In what follows I look at some formal languages that are much simpler than English and define validity of
More informationArtificial Intelligence. Propositional Logic. Copyright 2011 Dieter Fensel and Florian Fischer
Artificial Intelligence Propositional Logic Copyright 2011 Dieter Fensel and Florian Fischer 1 Where are we? # Title 1 Introduction 2 Propositional Logic 3 Predicate Logic 4 Reasoning 5 Search Methods
More informationAdvanced Topics in LP and FP
Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection
More informationMinimal models with three-valued logic: The case of counterfactual conditionals
Minimal models with three-valued logic: The case of counterfactual conditionals 1. Introduction This paper is about non-monotonic logic and its applications. I will try to bring together two different
More informationThe Semantics of Questions Introductory remarks
MIT, September-October 2012 1 1. Goals for this class The Semantics of Questions Introductory remarks (1) a. Which boy (among John, Bill and Fred) read the book? Uniqueness presupposition (UP): exactly
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationNatural Deduction for Propositional Logic
Natural Deduction for Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 10, 2018 Bow-Yaw Wang (Academia Sinica) Natural Deduction for Propositional Logic
More informationPropositional Logic Review
Propositional Logic Review UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane The task of describing a logical system comes in three parts: Grammar Describing what counts as a formula Semantics Defining
More informationChapter 14: More on Quantification
Chapter 14: More on Quantification 14.1 Numerical quantification In what we ve seen so far of FOL, our quantifiers are limited to the universal and the existential. This means that we can deal with English
More informationCounterfactuals to the Rescue
Counterfactuals to the Rescue Cleo Condoravdi Stanford University 1 Introduction Edgington (2008) argues that the stakes of philosophical theorizing about conditionals are so high because of the role conditionals
More informationSemantics Basics for Syntacticians
Department of Linguistics Ohio State University January 19, 2012 Expressions, Utterances, and Meanings (1/2) We distinguish expressions from utterances (uses of expressions in specific circumstances).
More informationPropositions and Proofs
Chapter 2 Propositions and Proofs The goal of this chapter is to develop the two principal notions of logic, namely propositions and proofs There is no universal agreement about the proper foundations
More informationModal Dependence Logic
Modal Dependence Logic Jouko Väänänen Institute for Logic, Language and Computation Universiteit van Amsterdam Plantage Muidergracht 24 1018 TV Amsterdam, The Netherlands J.A.Vaananen@uva.nl Abstract We
More informationIntroduction to Intelligent Systems
Logical Agents Objectives Inference and entailment Sound and complete inference algorithms Inference by model checking Inference by proof Resolution Forward and backward chaining Reference Russel/Norvig:
More informationINQUISITIVE SEMANTICS AND THE PARADOXES OF MATERIAL IMPLICATION
INQUISITIVE SEMANTICS AND THE PARADOXES OF MATERIAL IMPLICATION MSc Thesis (Afstudeerscriptie) written by Pawel Lojko (born May 1st, 1987 in Szczecin, Poland) under the supervision of Dr. Floris Roelofsen
More informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
More informationPropositional Logic. Yimei Xiang 11 February format strictly follow the laws and never skip any step.
Propositional Logic Yimei Xiang yxiang@fas.harvard.edu 11 February 2014 1 Review Recursive definition Set up the basis Generate new members with rules Exclude the rest Subsets vs. proper subsets Sets of
More informationChapter 1: The Logic of Compound Statements. January 7, 2008
Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive
More informationInquisitive Semantics and Pragmatics
Inquisitive Semantics and Pragmatics Jeroen Groenendijk & Floris Roelofsen ILLC/Department of Philosophy Universiteit van Amsterdam http://www.illc.uva.nl/inquisitive-semantics Abstract. This paper starts
More informationModal Calculus of Illocutionary Logic
1 Andrew Schumann Belarusian State University Andrew.Schumann@gmail.com Modal Calculus of Illocutionary Logic Abstract: The aim of illocutionary logic is to explain how context can affect the meaning of
More informationMathematics for linguists
Mathematics for linguists WS 2009/2010 University of Tübingen January 7, 2010 Gerhard Jäger Mathematics for linguists p. 1 Inferences and truth trees Inferences (with a finite set of premises; from now
More informationDescription Logics. Deduction in Propositional Logic. franconi. Enrico Franconi
(1/20) Description Logics Deduction in Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/20) Decision
More informationImplicit Skolemization: Efficient Reference to Dependent Entities
Implicit Skolemization: Efficient Reference to Dependent Entities Lenhart Schubert Department of Computer Science University of Rochester Rochester, NY 14627-0226, USA schubert@cs.rochester.edu 1 Introduction
More informationTHE LOGIC OF COMPOUND STATEMENTS
THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment
More informationKnowledge based Agents
Knowledge based Agents Shobhanjana Kalita Dept. of Computer Science & Engineering Tezpur University Slides prepared from Artificial Intelligence A Modern approach by Russell & Norvig Knowledge Based Agents
More informationPrice: $25 (incl. T-Shirt, morning tea and lunch) Visit:
Three days of interesting talks & workshops from industry experts across Australia Explore new computing topics Network with students & employers in Brisbane Price: $25 (incl. T-Shirt, morning tea and
More informationPhilosophy 244: #8 Counterfactuals, Neighborhood Semantics, Probability, Predicative Necessity, etc.
Philosophy 244: #8 Counterfactuals, Neighborhood Semantics, Probability, Predicative Necessity, etc. Modal operators are non-truth-functional; the truth-value of α at a world is not determined by α s s
More information