CAS LX 502 Semantics 1b. The Truth Ch. 1.

Slides:



Advertisements
Similar presentations
1 Knowledge Representation Introduction KR and Logic.
Advertisements

Utterance By: Shorooq Al-Masoudi.
Introduction to Set Theory
F22H1 Logic and Proof Week 5 Overview of weeks 5—9 Predicates and Quantifiers.
CAS LX 502 Semantics 10b. Presuppositions, take
Copyright © Cengage Learning. All rights reserved.
 Assertions: unsupported declaration of a belief  Prejudice: a view without evidence for or against  Premises: explicit evidence that lead to a conclusion.
Artificial intelligence. I believe that in about fifty years' time it will be possible, to programme computers, with a storage capacity of about 10.
Copyright © Cengage Learning. All rights reserved.
GEB class notes jan 18 A Logic Puzzle Classification Problems, Equivalence Relations, and Disjoint Unions Logic and Set Theory.
F22H1 Logic and Proof Week 7 Clausal Form and Resolution.
CAS LX 502 8a. Formal semantics Truth and meaning The basis of formal semantics: knowing the meaning of a sentence is knowing under what conditions.
CAS LX b. Questions. Seeking truth Much of what we’ve done this semester has to do with characterizing (our knowledge of) the conditions under which.
CAS LX 502 7a. Speech acts Ch. 8. How to do things with words Language as a social function. — I bet you $1 you can’t name the Super Tuesday states. —You’re.
CAS LX 502 Semantics 8b. Propositional attitudes 7, 9.
CSRU 1100 Logic. Logic is concerned with determining: Is it True? Is it False?
Knowledge in intelligent systems So far, we’ve used relatively specialized, naïve agents. How can we build agents that incorporate knowledge and a memory?
Presentation on Formalising Speech Acts (Course: Formal Logic)
CAS LX 502 Semantics 11b. Questions. Seeking truth Much of what we’ve done this semester has to do with characterizing (our knowledge of) the conditions.
Meaning and Language Part 1.
Logic In Part 2 Modules 1 through 5, our topic is symbolic logic. We will be studying the basic elements and forms that provide the structural foundations.
Intro to Set Theory. Sets and Their Elements A set A is a collection of elements. If x is an element of A, we write x  A; if not: x  A. Say: “x is a.
Linguistic Theory Lecture 3 Movement. A brief history of movement Movements as ‘special rules’ proposed to capture facts that phrase structure rules cannot.
Pragmatics.
CAS LX 502 Semantics 3a. A formalism for meaning (cont ’ d) 3.2, 3.6.
1.1 Sets and Logic Set – a collection of objects. Set brackets {} are used to enclose the elements of a set. Example: {1, 2, 5, 9} Elements – objects inside.
 We have been considering ways in which we interpret the meaning of an utterance in terms of what the speaker intended to convey.  However, we have.
LDK R Logics for Data and Knowledge Representation Context Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
7 Graph 7.1 Even and Odd Degrees.
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
 Predicate: A sentence that contains a finite number of variables and becomes a statement when values are substituted for the variables. ◦ Domain: the.
Understanding PML Paulo Pinheiro da Silva. PML PML is a provenance language (a language used to encode provenance knowledge) that has been proudly derived.
0 Validity & Invalidity (Exercises) December 23, 2005.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 Extending the Number System.
Syntax Lecture 5: More On Wh-movement. Review Wh-movement: – Moves interrogative ‘wh’-phrase – from various positions inside the IP – to the specifier.
MIDTERM EXAMINATION THE MIDTERM EXAMINATION WILL BE ON FRIDAY, MAY 2, IN THIS CLASSROOM, STARTING AT 1:00 P.M. BRING A BLUE BOOK. THE EXAM WILL COVER:
Collecting Things Together - Lists 1. We’ve seen that Python can store things in memory and retrieve, using names. Sometime we want to store a bunch of.
Advanced Topics in Propositional Logic Chapter 17 Language, Proof and Logic.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 10 By Herbert I. Gross and Richard A. Medeiros next.
Computational Semantics Day 5: Inference Aljoscha.
Lecture 3: The nature of epistemic justification.
Introduction to Philosophy Lecture 1-b What is Philosophy? (Part 2) By David Kelsey.
02 Truth and Rationality Philosophy. 2 Part I: Sentences and Propositions.
Copyright © 2014 Curt Hill Sets Introduction to Set Theory.
Entity Theories of Meaning. Meaning Talk Theory should make sense of meaning talk Theory should make sense of meaning talk What sorts of things do we.
LDK R Logics for Data and Knowledge Representation PL of Classes.
Albert Gatt LIN3021 Formal Semantics Lecture 4. In this lecture Compositionality in Natural Langauge revisited: The role of types The typed lambda calculus.
0 Validity & Invalidity (Exercises) All dogs have two heads. 2. All tigers are dogs. ___________________________________ 3. All tigers have two.
Copyright © Cengage Learning. All rights reserved.
Week 6 - Friday.  What did we talk about last time?  Solving recurrence relations.
SEMANTICS VS PRAGMATICS Semantics is the study of the relationships between linguistic forms and entities in the world; that is how words literally connect.
Naïve Set Theory. Basic Definitions Naïve set theory is the non-axiomatic treatment of set theory. In the axiomatic treatment, which we will only allude.
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Lecture 2 (Chapter 2) Introduction to Semantics and Pragmatics.
Week 6. Statistics etc. GRS LX 865 Topics in Linguistics.
Introduction to Philosophy Lecture 1-b What is Philosophy? (Part 2) By David Kelsey.
Propositional Logic Rather than jumping right into FOL, we begin with propositional logic A logic involves: §Language (with a syntax) §Semantics §Proof.
Logics for Data and Knowledge Representation ClassL (part 1): syntax and semantics.
SPEECH ACTS Saying as Doing See R. Nofsinger, Everyday Conversation, Sage, 1991.
Complete the provided worksheet as you read Lessons 24 and 25 in your Student Manual over Values and Standards. Make sure you write your responses IN.
Logics for Data and Knowledge Representation ClassL (part 1): syntax and semantics.
Lecture 6: More On Wh-movement
Chapter 2 Sets and Functions.
Knowledge Representation using First-Order Logic
CAS LX 502 3b. Truth and logic
Noun Clauses Chapter 12.
7/3/2018 EMR 17 Logical Reasoning Lecture 11.
A new perspective on philosophical debates
Logics for Data and Knowledge Representation
Presentation transcript:

CAS LX 502 Semantics 1b. The Truth Ch. 1

Specifics of meaning Basic goals initially: What kind of thing is the meaning of a sentence? What kind of thing is the meaning of a word (or word part)? How do they relate? These initial goals will take us through much of the semester, in some form or another

Meaning? It’s difficult to pin down anything we could confidently call meaning. A sentence might “mean something,” but what does that tell us? Where do we start? Images? Memories? Associations?

The meaning of a (simple) sentence Starting point: Homer is standing. Whatever the meaning is, if we know it, there’s a trick we can do.

Separating situations Reduce the problem to an easier one: Forget trying to decide what the sentence Homer is standing means. Concentrate instead on what someone who knows what Homer is standing means can do. If we know the meaning of Homer is standing, we can separate situations into those in which it is true and those in which it is false. We know the truth conditions.

Truth conditions So, whatever meaning of a (simple) sentence is, it includes the truth conditions of that sentence. Perhaps that’s even all meaning is. Inside every hydrogen atom, there is a small blue-and-white orb which continually displays the original episode of The Twilight Zone.

Sentences vs. propositions If we’re basing our semantics on a notion of true, false, and possible worlds, the objects we are investigating are things that can be true or false in a possible world. John realized that Mary closed the door and began to dance. Mary closed the door. John realized (something). John is dancing. John was not dancing before.

Truth conditions = meaning? Intuitions about logic. Mary closed the door. John danced. Mary closed the door and John danced. What is the effect of and?

Truth conditions = meaning? Intuitions about logic. Mary closed the door or John danced. Mary closed the door and John did not dance.

Aside on set theory A set is a collection of things: {a, 1, Bill, tomorrow} = A Here, a is a member of the set A, and improbable is not. a  {a, 1, Bill, tomorrow} improbable  {a, 1, Bill, tomorrow} Things are either members of a set or not. {a, a} = {a}.

Aside on set theory There are relations we can describe between sets: Elements that are in both sets are said to be in the intersection of the sets. Elements that are in one or the other are said to be in the union of the sets. {A, B, D, E}  {B, D, F} = {B, D} {A, B, D}  {B, F, G} = {A, B, D, F, G} A set A is a subset of a set B if every element in A is also in B. {A, B}  {A, B, C}; {A, B, C}  {A, B, C} A is a proper subset of B if (1) A is a subset of B, and (2) there is some element in B that is not in A. {A, B}  {A, B, C}; {A, B, C}  {A, B, C}

Aside on set theory If we designate a domain, we can also talk about the complement of a set. Domain: {A, B, C, D} A = {A, C} A = {B, D} An element x is in A if (1) it is not in A, (2) under no other conditions. An element x is in A if and only if x is not in A. An element x is in A iff x is not in A. x  A iff x  A x  A  x  A x  A  x  A

Special sets We sometimes have cause to talk of a set that has no members: The empty set. {} or Ø Or a set that has exactly one member, a singleton set. {Ralph}

Set notation Set notation is a convenient (and potentially quite precise) terminology in which to discuss meanings in terms of possible worlds. P = the set of worlds in which p is true. Q = the set of worlds in which q is true. P  Q ? P  Q ? P? We can define “logical connectives” quite simply, in a way which matches our intuitions about that they mean.

More on intuitions When are two propositions synonymous? The switch is on. The switch is not off. Or contrary/opposite? The switch is on. The switch is off. When is a proposition tautological? The switch is on or the switch is off. When is a proposition contradictory? The switch is on and the switch is off.

Entailment This is a red dot. This is red. This is a dot. We believe (intuitively) that if the first one is true, the second and third are also necessarily true. The first one entails the second and third. And the relation of entailment is easy to state and understand in the set/world terms we are developing. This is promising…

Thoughts and beliefs Sets of possible worlds can also model quite nicely information states. Suppose I believe that Mary opened the door. There are many, many possible worlds. With respect to Mary opened the door, they can be divided into two sets. The actual world is one of the possible worlds. My belief is essentially one about which set of possible worlds contains the actual world.

Thoughts and beliefs w0 = {w: Mary opened the door in w} We can divide the worlds in which Mary opened the door into two subsets with respect to the proposition John dropped his pencil. If all I know is that Mary opened the door, and someone tells me that John dropped his pencil (and I believe it), then I have narrowed the possibilities for where the actual world is in the space of all possible worlds.

The games we play At least a certain type of information interchange can be thought of as a game in which the goal is to “find the actual world” by narrowing down the places it might be. The more information you have, the closer you are to finding the actual world—the more places you know it isn’t.

Did Mary open the door? We can actually get pretty far working with the machinery so far developed, but it is worth considering that there are other kinds of sentences that don’t immediately lend themselves to an interpretation directly in terms of truth conditions. Is “Did Mary open the door?” true or false?

Declaratives/interrogatives We’ve been discussing declaratives, statements. An interrogative seems to do something else, but we can still understand it by applying the same kinds of analysis. A declarative divides possible worlds into two (disjoint) sets. And so does a yes/no question. The difference seems to be that a declarative is positioning w0 in one of them, while an interrogative leaves the position of w0 open—interpreted as a request.

Imperatives (You) close the door(!). Also not true and not false. But the fact that it is imperative seems to be communicating something like: Make it come about that w0 is in the true set of the door is closed.

Conversation Actual language use can be quite a bit more complicated, however. By leveraging the literal meaning of sentences and using them in certain ways, we can communicate something different. In part, this often relies on a mutual “agreement” between speakers that they will converse according to certain conventions, such as: Do not assert something you know to be false. Be as informative as possible (within reason).

A distant preview How many computers do you own? I own two computers. I own n computers entails that I own n-1 computers. I have an actual number k of computers. To say I own k+1 computers would be false. It is true that I have 2 computers whether I have 2 or more computers. It’s true that I have 3 computers in fewer situations. It’s more informative (stronger) to say that I have 3 computers. Conclusion: I do not own more than two computers. But notice this is not part of the literal meaning, it comes from working out why this was said and not something else, according to the “rules of the game.”

       