Michael Franke Fritz Hamm. January 26, 2011
|
|
- Constance Goodwin
- 6 years ago
- Views:
Transcription
1 Michael Franke Fritz Hamm Seminar für Sprachwissenschaft January 26, 2011
2 Three n would, p would, l would, n might p might l might
3 Basic intuition (1) If that match had been scratched, it would have lighted. The first problem [in the interpretation of counterfactuals] is... to specify what sentences are meant to be taken in conjunction with the antecedent as a basis for inferring the consequent. Goodman, 1947
4 Basic Apparatus I A model M is a pair < W,V > consisting of a non-empty set of worlds W and a valuation function V. Definition 1 [[p ]] M w = 1 iff w V(p). 2 [[φ ψ]] M w = 1 iff [[φ]] M w = [[ψ]] M w = 1 3 [[φ ψ]] M w = 0 iff [[φ]] M w = [[ψ]] M w = 0 4 [[φ ψ]] M w = 0 iff [[φ]] M w = 1 and [[ψ]] M w = 0 5 [[ φ]] M w = 1 iff [[φ]] M w = 0
5 Basic Apparatus II Prem w (φ) is the set of premise sets associated with φ at world w. Definition (would-counterfactual) [[φ ψ]] w = 1 iff X Prem w (φ) Y Prem w (φ)[x Y \ Y W ψ] The would counterfactual φ ψ is true at w if and only if every set in PREM w (φ) has a superset in PREM w (φ) which entails ψ.
6 Basic Apparatus III Definition (might-counterfactual) [[φ ψ]] w = 1 iff X Prem w (φ) Y Prem w (φ)[x Y \ Y ψ W /0] The might-counterfactual φ ψ is true at w if and only if there is a set in PREM w (φ) all of whose supersets in PREM w (φ) are consistent with ψ.
7 Basic Apparatus IV Proposition φ ψ iff (φ ψ)
8 Naive premise semantics I Definition (Naive premise set) Prem n w(φ) = {X f(w) {φ} : T X /0 and φ X}, where f(w) = {p (W) : w p}. (2) a. If Paula weren t buying a pound of apples, the Atlantic Ocean might be drying up. b. (If Paula isn t buying a pound of apples ) n (the Atlantic Ocean is drying up).
9 Naive premise semantics II Definition (Kratzer s might-counterfactuals) A might -counterfactual is true in a world w if and only if not every way of adding propositions which are true in w to the antecedent while preserving consistency reaches a point where adding the consequent would result in an inconsistent set. (3) a. Paula is buying a pond of apples. b. The Atlantic Ocean isn t drying up. c. Paula is buying a pound of apples or the Atlantic Ocean is drying up.
10 Naive premise semantics III Proposition 1 φ n ψ (φ ψ) ( φ (φ ψ)) 2 φ n ψ (φ ψ) ( φ (φ ψ))
11 Naive premise semantics IV If ψ is a false sentence that is consistent with the negation of a true sentence φ, then φ n ψ is true.
12 Partition semantics I Definition (Partition function) A function f : W ( (W)) is a partition function if and only if for every w W, T f(w) = {w}. Definition (Partition premise set) let f be a partition function. Then Prem p w(φ) = {X f(w) {φ} : \ X /0 and φ X}
13 Partition semantics II Each premise set corresponds to an equivalent ordering frame. Proposition (Lewis, 1981) Equivalent frames evaluate counterfactuals alike, at least in the finite case.
14 Partition semantics III (4) Let a world w be such that a. a zebra escaped; b. it was caged with another zebra; c. a giraffe was also in the same cage. (5) a. If a different animal had escaped, it might have been a giraffe. b. (a different animal escaped) p (it was a giraffe)
15 semantics: Motivation I Pedant: What did you do yesterday evening? Paula: The only thing I did yesterday evening was paint this still life over there. Pedant: This cannot be true. You must have done something else like eat, drink, look out of the window. Paula: Yes, strictly speaking, I did other things besides paint this still life. I made myself a cup of tea, ate a piece of bread, discarded a banana, and went to the kitchen to look for an apple.
16 semantics: Motivation II Lunatic: What did you do yesterday evening? Paula: The only thing I did yesterday evening was paint this still life over there. Lunatic: This cannot be true. You also painted apples and you also painted bananas. Hence painting this still life was not the only thing you did yesterday evening.
17 semantics: Motivation III There is an aspect of the actual world that makes the proposition that Paula painted a still life true. And that very aspect of our world also makes the proposition that she painted apples true. [... ] Let us say that the proposition that Paula painted a still life lumps the proposition that she painted apples in the actual world. Kratzer, 1989, p 609.
18 semantics: Motivation IV The proposition that Paula painted apples does not lump the proposition that she painted a still life in the actual world. If Paula had painted only apples and no bananas then the proposition that Paula painted apples would lump the proposition that she painted a still life in the actual world.
19 semantics: Formalization I Definition (Situation Model) A situation model is a triple M =< S,,V >, where S is a non-empty set of situations. is a partial order on S satisfying the following condition: For all s S there is a unique s S such that s s and for all s S, if s s then s s. V is a function mapping propositional variables to subsets of S. Definition (Truth) A proposition p is true in a situation s S if and only if s p.
20 semantics: Formalization II Definition (Worlds) For each s S, let w s S be the maximal situation such that s w s. The set of worlds in M is the set W = {w s : s S}. Definition (Consistencys) A set of propositions A (S) is consistent if T A W /0. Definition (Logical consequence) A proposition p (S) logically follows from a set of propositions A (S) if and only if T A W p.
21 semantics: Formalization III Definition (Persistence) A proposition p S is persistent if and only if for all s,s S, if s p and s s, then s p. Definition [[φ ψ]] s = 1 iff [[φ]] s = 1 and [[ψ]] s = 1 [[φ ψ]] s = 1 iff [[φ]] s = 1 or [[ψ]] s = 1 (6) a. φ is persistent. b. {φ, φ} is inconsistent; hence, by persistence, for all w W, if w φ then there is no s w such that s φ. c. W φ φ.
22 semantics: Formalization IV Definition (Relevance function) A function f : W ( (S)) is a relevance function iff for all w W, f(w) {p (S) : w p and p is persistent}. Definition () For all p,q S and w W, p lumps q in w if and only if w p and p {s : s w} q. We write p w q for p lumps q in w.
23 semantics: Formalization V Proposition Let p and q be persistent propositions. If w p and w q, then (p q) w q. Definition (Closure under lumping) A set of propositions A (S) is closed under lumping in w (relative to f(w)) if and only if for all p A and all q f(w), if p lumps q in w, then q A. Definition (Closure under logical consequence) A set of propositions A (S) is closed under logical consequence (relative to f(w)) if and only if for all p f(w), if p follows logically from A, then p A.
24 semantics: Formalization VI Definition ( premise set) Let f be a relevance function. Prem l w(φ) = {X f(w) {φ} : T X W /0 φ X p X q f(w)[p w q q X] p f(w)[ T (X f(w)) W p p X f(w)]}.
25 Kratzer s solution I (7) If Paula weren t buying a pond of apples, the Atlantic Ocean might be drying up. (8) a. Paula is buying a pond of apples. b. The Atlantic Ocean isn t drying up. c. Paula is buying a pound of apples or the Atlantic Ocean is drying up. Proposition (8-c) lumps proposition (8-a) in the actual world. (8-a), however, is not compatible with the antecedent of the counterfactual (7). Therefore we cannot add the proposition expressed by (8-c) to the antecedent of the counterfactual. Therefore (7) is not true in the actual world.
26 Kratzer s solution II (9) If a different animal had escaped, it might have been a giraffe. (10) a. A zebra escaped b. A striped animal escaped c. A black and white animal escaped d. A male animal escaped e....
27 premise set: Kratzer s version I Definition Let f be a relevance function. Prem l w(φ) = {X f(w) {φ} : T X W /0 φ X p X q f(w)[p w q q X] p f(w)[ T (X \ {φ}) W p p X \ {φ}]}.
28 premise set: Kratzer s version II (11) a. If Paula were buying a pound of apples, she would be buying a pound of Golden delicious. b. (Paula is buying a pound of apples) l (Paula is buying a pound of Golden Delicious) (12) a. If Paula were buying a pound of apples, she might be buying a pound of Golden delicious. b. (Paula is buying a pound of apples) l (Paula is buying a pound of Golden Delicious)
29 Preliminary lemmas Lemma Suppose φ is true at w. Then φ l ψ is true at w iff f(w) {φ} is consistent with ψ. Lemma If φ and ψ are true at w, then φ l ψ is true at w. Lemma Suppose φ and ψ are true at w, and ψ f(w). Then φ l ψ is true at w. Lemma Suppose { ψ} {p (S) : w p} f(w). If φ is true at w, φ l ψ is true at w iff ψ is true at w.
30 Triviality of lumping semantics I Proposition Suppose that {W,{w}} f(w). Then φ l ψ is true at w iff φ ψ is true at w. Proposition Under the same assumption, φ l ψ is true at w iff φ ψ is true at w.
31 Triviality of lumping semantics II Proposition Suppose that {φ φ, φ, ψ} {p (S) : w p} f(w). Then φ l ψ is true at w iff φ ψ is true at w, and φ l ψ is true at w iff φ ψ is true at w.
32 Triviality of lumping semantics III (13) a. If Paula were not buying a pound of apples, she might not be buying a pound of apples. b. (Paula is buying a pound of apples) l (Paula is buying a pound of apples)
33 Triviality of lumping semantics IV Proposition Suppose that (i) f(w) contains no propositions that are true in all possible worlds; (ii) whenever p is in f(w), (p φ) (p φ) is in f(w) and moreover, if φ is true at w, p φ is also in f(w); and (iii) if ψ is true at w, ψ is in f(w). Then φ l ψ is true at w iff φ n ψ is true at w, and φ l ψ is true at w iff φ n ψ is true at w.
On the Lumping Semantics of Counterfactuals
Journal of Semantics 22: 129 151 doi:10.1093/jos/ffh027 Advance Access publication March 29, 2005 On the Lumping Semantics of Counterfactuals MAKOTO KANAZAWA National Institute of Informatics STEFAN KAUFMANN
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 informationNatural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson
Natural Deduction Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. An example 1. Validity by truth table 2. Validity by proof 2. What s a proof 1. Proof checker 3. Rules of
More informationKRIPKE S THEORY OF TRUTH 1. INTRODUCTION
KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed
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 informationLearning Goals of CS245 Logic and Computation
Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction
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 informationComputation and Logic Definitions
Computation and Logic Definitions True and False Also called Boolean truth values, True and False represent the two values or states an atom can assume. We can use any two distinct objects to represent
More informationInference Methods In Propositional Logic
Lecture Notes, Artificial Intelligence ((ENCS434)) University of Birzeit 1 st Semester, 2011 Artificial Intelligence (ENCS434) Inference Methods In Propositional Logic Dr. Mustafa Jarrar University of
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 informationClassical Propositional Logic
The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,
More informationProseminar on Semantic Theory Fall 2013 Ling 720 Proving the Soundness and Completeness of Propositional Logic: Some Highlights 1
Proving the Soundness and Completeness of Propositional Logic: Some Highlights 1 (1) A Summary of What We ve Done So Far for PL a. We ve given a purely syntactic characterization of valid inference in
More informationPropositional Logic: Models and Proofs
Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505
More informationUNIT-I: Propositional Logic
1. Introduction to Logic: UNIT-I: Propositional Logic Logic: logic comprises a (formal) language for making statements about objects and reasoning about properties of these objects. Statements in a logical
More informationKnowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):
Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building
More informationLING 501, Fall 2004: Laws of logic and the definitions of the connectives
LING 501, Fall 2004: Laws of logic and the definitions of the connectives Modified October 24, adding a test yourself section at the end. Modified October 21, correcting errors noted in class on October
More informationINF3170 Logikk Spring Homework #8 For Friday, March 18
INF3170 Logikk Spring 2011 Homework #8 For Friday, March 18 Problems 2 6 have to do with a more explicit proof of the restricted version of the completeness theorem: if = ϕ, then ϕ. Note that, other than
More informationNew Foundations for Hyperintensional Semantics?
New Foundations for Hyperintensional Semantics? Hannes Leitgeb LMU Munich September 2014 Hyperintensional contexts are simply contexts which do not respect logical equivalence. (Cresswell 1975; cf. Carnap
More informationKLEENE LOGIC AND INFERENCE
Bulletin of the Section of Logic Volume 4:1/2 (2014), pp. 4 2 Grzegorz Malinowski KLEENE LOGIC AND INFERENCE Abstract In the paper a distinguished three-valued construction by Kleene [2] is analyzed. The
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 informationConditional Logic and Belief Revision
Conditional Logic and Belief Revision Ginger Schultheis (vks@mit.edu) and David Boylan (dboylan@mit.edu) January 2017 History The formal study of belief revision grew out out of two research traditions:
More information09 Modal Logic II. CS 3234: Logic and Formal Systems. October 14, Martin Henz and Aquinas Hobor
Martin Henz and Aquinas Hobor October 14, 2010 Generated on Thursday 14 th October, 2010, 11:40 1 Review of Modal Logic 2 3 4 Motivation Syntax and Semantics Valid Formulas wrt Modalities Correspondence
More informationInference Methods In Propositional Logic
Lecture Notes, Advanced Artificial Intelligence (SCOM7341) Sina Institute, University of Birzeit 2 nd Semester, 2012 Advanced Artificial Intelligence (SCOM7341) Inference Methods In Propositional Logic
More informationAntecedents of counterfactuals violate de Morgan s law
Antecedents of counterfactuals violate de Morgan s law Lucas Champollion champollion@nyu.edu Joint work with Ivano Ciardelli and Linmin Zhang Fourth Workshop on Natural Language and Computer Science (NLCS
More informationCS 2740 Knowledge Representation. Lecture 4. Propositional logic. CS 2740 Knowledge Representation. Administration
Lecture 4 Propositional logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square dministration Homework assignment 1 is out Due next week on Wednesday, September 17 Problems: LISP programming a PL
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 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 informationKratzer on Modality in Natural Language
Kratzer on Modality in Natural Language 1 Modal Logic General Propositional modal logic: Syntax: 02.06.12 William Starr Phil 6710 / Ling 6634 Spring 2012 Atomic formulas: P, Q, R,..., Connecties:,,,,,,
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 informationScalar Implicatures: Are There Any?
Scalar Implicatures: Are There Any? Angelika Kratzer University of Massachusetts at Amherst Workshop on Polarity, Scalar Phenomena, and Implicatures. University of Milan-Bicocca June 18, 2003 1 The cast
More informationCompleteness in the Monadic Predicate Calculus. We have a system of eight rules of proof. Let's list them:
Completeness in the Monadic Predicate Calculus We have a system of eight rules of proof. Let's list them: PI At any stage of a derivation, you may write down a sentence φ with {φ} as its premiss set. TC
More informationModal Logics. Most applications of modal logic require a refined version of basic modal logic.
Modal Logics Most applications of modal logic require a refined version of basic modal logic. Definition. A set L of formulas of basic modal logic is called a (normal) modal logic if the following closure
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More information127: Lecture notes HT17. Week 8. (1) If Oswald didn t shoot Kennedy, someone else did. (2) If Oswald hadn t shot Kennedy, someone else would have.
I. Counterfactuals I.I. Indicative vs Counterfactual (LfP 8.1) The difference between indicative and counterfactual conditionals comes out in pairs like the following: (1) If Oswald didn t shoot Kennedy,
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 informationPropositional Dynamic Logic
Propositional Dynamic Logic Contents 1 Introduction 1 2 Syntax and Semantics 2 2.1 Syntax................................. 2 2.2 Semantics............................... 2 3 Hilbert-style axiom system
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 informationSyntactic Characterisations in Model Theory
Department of Mathematics Bachelor Thesis (7.5 ECTS) Syntactic Characterisations in Model Theory Author: Dionijs van Tuijl Supervisor: Dr. Jaap van Oosten June 15, 2016 Contents 1 Introduction 2 2 Preliminaries
More informationPropositional Logic: Methods of Proof. Chapter 7, Part II
Propositional Logic: Methods of Proof Chapter 7, Part II Inference in Formal Symbol Systems: Ontology, Representation, ti Inference Formal Symbol Systems Symbols correspond to things/ideas in the world
More informationPropositional Logic: Review
Propositional Logic: Review Propositional logic Logical constants: true, false Propositional symbols: P, Q, S,... (atomic sentences) Wrapping parentheses: ( ) Sentences are combined by connectives:...and...or
More informationPropositional Language - Semantics
Propositional Language - Semantics Lila Kari University of Waterloo Propositional Language - Semantics CS245, Logic and Computation 1 / 41 Syntax and semantics Syntax Semantics analyzes Form analyzes Meaning
More informationMathematics 114L Spring 2018 D.A. Martin. Mathematical Logic
Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)
More informationcis32-ai lecture # 18 mon-3-apr-2006
cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem
More informationRestricted truth predicates in first-order logic
Restricted truth predicates in first-order logic Thomas Bolander 1 Introduction It is well-known that there exist consistent first-order theories that become inconsistent when we add Tarski s schema T.
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 informationFormal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University
Formal Epistemology: Lecture Notes Horacio Arló-Costa Carnegie Mellon University hcosta@andrew.cmu.edu Logical preliminaries Let L 0 be a language containing a complete set of Boolean connectives, including
More informationComp487/587 - Boolean Formulas
Comp487/587 - Boolean Formulas 1 Logic and SAT 1.1 What is a Boolean Formula Logic is a way through which we can analyze and reason about simple or complicated events. In particular, we are interested
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 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 informationLogic. Part I: Propositional Logic. Max Schäfer. Formosan Summer School on Logic, Language, and Computation 2010
Logic Part I: Propositional Logic Max Schäfer Formosan Summer School on Logic, Language, and Computation 2010 1 / 39 Organisation Lecturer: Lectures: Homework: Exam Max Schäfer (Schaefer) max.schaefer@comlab.ox.ac.uk
More informationNormal Forms of Propositional Logic
Normal Forms of Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 12, 2017 Bow-Yaw Wang (Academia Sinica) Normal Forms of Propositional Logic September
More informationLogical Agents. September 14, 2004
Logical Agents September 14, 2004 The aim of AI is to develop intelligent agents that can reason about actions and their effects and about the environment, create plans to achieve a goal, execute the plans,
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 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 informationTheorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)
Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +
More informationAn inquisitive approach to occasion-sensitivity
An inquisitive approach to occasion-sensitivity Tamara Dobler ILLC November 6, 2017 Tamara Dobler (ILLC) An inquisitive approach to occasion-sensitivity November 6, 2017 1 / 37 Outline 1 Introduction 2
More informationPredicate Calculus. Formal Methods in Verification of Computer Systems Jeremy Johnson
Predicate Calculus Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. Motivation 1. Variables, quantifiers and predicates 2. Syntax 1. Terms and formulas 2. Quantifiers, scope
More informationKnowledge Representation. Propositional logic.
CS 1571 Introduction to AI Lecture 10 Knowledge Representation. Propositional logic. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework assignment 3 due today Homework assignment
More informationLogic and Philosophical Logic. 1 Inferentialism. Inferentialism and Meaning Underdetermination
Logic and Philosophical Logic Inferentialism and Meaning Underdetermination AC Paseau alexanderpaseau@philosophyoxacuk 28 January 2019 In the rst half of today's class, we looked at Tarski's account of
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 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 informationAI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic
AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic Propositional logic Logical connectives Rules for wffs Truth tables for the connectives Using Truth Tables to evaluate
More informationInquisitive Logic. Journal of Philosophical Logic manuscript No. (will be inserted by the editor) Ivano Ciardelli Floris Roelofsen
Journal of Philosophical Logic manuscript No. (will be inserted by the editor) Inquisitive Logic Ivano Ciardelli Floris Roelofsen Received: 26 August 2009 / Accepted: 1 July 2010 Abstract This paper investigates
More informationPropositional Logic Arguments (5A) Young W. Lim 10/11/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More information2. The Logic of Compound Statements Summary. Aaron Tan August 2017
2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional
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 informationDeductive Systems. Lecture - 3
Deductive Systems Lecture - 3 Axiomatic System Axiomatic System (AS) for PL AS is based on the set of only three axioms and one rule of deduction. It is minimal in structure but as powerful as the truth
More informationBelief revision: A vade-mecum
Belief revision: A vade-mecum Peter Gärdenfors Lund University Cognitive Science, Kungshuset, Lundagård, S 223 50 LUND, Sweden Abstract. This paper contains a brief survey of the area of belief revision
More information1 Completeness Theorem for First Order Logic
1 Completeness Theorem for First Order Logic There are many proofs of the Completeness Theorem for First Order Logic. We follow here a version of Henkin s proof, as presented in the Handbook of Mathematical
More informationCS 730/730W/830: Intro AI
CS 730/730W/830: Intro AI 1 handout: slides 730W journal entries were due Wheeler Ruml (UNH) Lecture 9, CS 730 1 / 16 Logic First-Order Logic The Joy of Power Wheeler Ruml (UNH) Lecture 9, CS 730 2 / 16
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 informationAgainst Preservation
Against Preservation Matthew Mandelkern * and Justin Khoo July 22, 2018 Penultimate draft; to appear in Analysis Abstract Richard Bradley offers a quick and convincing argument that no Boolean semantic
More informationMA103 STATEMENTS, PROOF, LOGIC
MA103 STATEMENTS, PROOF, LOGIC Abstract Mathematics is about making precise mathematical statements and establishing, by proof or disproof, whether these statements are true or false. We start by looking
More information15414/614 Optional Lecture 1: Propositional Logic
15414/614 Optional Lecture 1: Propositional Logic Qinsi Wang Logic is the study of information encoded in the form of logical sentences. We use the language of Logic to state observations, to define concepts,
More informationPropositional Logic: Methods of Proof (Part II)
Propositional Logic: Methods of Proof (Part II) This lecture topic: Propositional Logic (two lectures) Chapter 7.1-7.4 (previous lecture, Part I) Chapter 7.5 (this lecture, Part II) (optional: 7.6-7.8)
More informationLecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)
Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or
More informationTo every formula scheme there corresponds a property of R. This relationship helps one to understand the logic being studied.
Modal Logic (2) There appeared to be a correspondence between the validity of Φ Φ and the property that the accessibility relation R is reflexive. The connection between them is that both relied on the
More informationIntroduction to Artificial Intelligence. Logical Agents
Introduction to Artificial Intelligence Logical Agents (Logic, Deduction, Knowledge Representation) Bernhard Beckert UNIVERSITÄT KOBLENZ-LANDAU Winter Term 2004/2005 B. Beckert: KI für IM p.1 Outline Knowledge-based
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 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 informationPhilosophy 240 Symbolic Logic. Russell Marcus Hamilton College Fall 2013
Philosophy 240 Symbolic Logic Russell Marcus Hamilton College Fall 2013 Class #4 Philosophy Friday #1: Conditionals Marcus, Symbolic Logic, Fall 2013, Slide 1 Natural-Language Conditionals A. Indicative
More informationMany-Valued Semantics for Vague Counterfactuals
Many-Valued Semantics for Vague Counterfactuals MARCO CERAMI AND PERE PARDO 1 1 Introduction This paper is an attempt to provide a formal semantics to counterfactual propositions that involve vague sentences
More informationFirst Order Logic: Syntax and Semantics
CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday
More informationRemarks on Kratzer s Ordering- Premise Semantics of Modalities and Conditionals. Norry Ogata Osaka University. Contents
Remarks on ratzer s rdering- Premise Semantics of Modalities and Conditionals Norry gata saka University Contents 1. Definitions of rdering-premise Semantics 2. Their Motivations 3. Some Formal Properties
More informationLogic and Discrete Mathematics. Section 3.5 Propositional logical equivalence Negation of propositional formulae
Logic and Discrete Mathematics Section 3.5 Propositional logical equivalence Negation of propositional formulae Slides version: January 2015 Logical equivalence of propositional formulae Propositional
More informationNumbers that are divisible by 2 are even. The above statement could also be written in other logically equivalent ways, such as:
3.4 THE CONDITIONAL & BICONDITIONAL Definition. Any statement that can be put in the form If p, then q, where p and q are basic statements, is called a conditional statement and is written symbolically
More informationEQUIVALENCE OF THE INFORMATION STRUCTURE WITH UNAWARENESS TO THE LOGIC OF AWARENESS. 1. Introduction
EQUIVALENCE OF THE INFORMATION STRUCTURE WITH UNAWARENESS TO THE LOGIC OF AWARENESS SANDER HEINSALU Abstract. Here it is shown that the unawareness structure in Li (29) is equivalent to a single-agent
More informationFormal (natural) deduction in propositional logic
Formal (natural) deduction in propositional logic Lila Kari University of Waterloo Formal (natural) deduction in propositional logic CS245, Logic and Computation 1 / 67 I know what you re thinking about,
More informationRelevant Logic. Daniel Bonevac. March 20, 2013
March 20, 2013 The earliest attempts to devise a relevance logic that avoided the problem of explosion centered on the conditional. FDE, however, has no conditional operator, or a very weak one. If we
More informationThe statement calculus and logic
Chapter 2 Contrariwise, continued Tweedledee, if it was so, it might be; and if it were so, it would be; but as it isn t, it ain t. That s logic. Lewis Carroll You will have encountered several languages
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 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 informationSets, Logic, Relations, and Functions
Sets, Logic, Relations, and Functions Andrew Kay September 28, 2014 Abstract This is an introductory text, not a comprehensive study; these notes contain mainly definitions, basic results, and examples.
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 informationMathematical Logics Description Logic: Introduction
Mathematical Logics Description Logic: Introduction Fausto Giunchiglia and Mattia Fumagallli University of Trento *Originally by Luciano Serafini and Chiara Ghidini Modified by Fausto Giunchiglia and Mattia
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 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 informationPart 1: Propositional Logic
Part 1: Propositional Logic Literature (also for first-order logic) Schöning: Logik für Informatiker, Spektrum Fitting: First-Order Logic and Automated Theorem Proving, Springer 1 Last time 1.1 Syntax
More informationKnowledge Representation. Propositional logic
CS 2710 Foundations of AI Lecture 10 Knowledge Representation. Propositional logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Knowledge-based agent Knowledge base Inference engine Knowledge
More informationBisimulation for conditional modalities
Bisimulation for conditional modalities Alexandru Baltag and Giovanni Ciná Institute for Logic, Language and Computation, University of Amsterdam March 21, 2016 Abstract We give a general definition of
More information