Linguistics and Philosophy 23: , Is Compositionality Formally Vacuous? Francis Jeffry Pelletier

Similar documents
Propositional Logic. Part I

Semantics via Syntax. f (4) = if define f (x) =2 x + 55.

This is already grossly inconvenient in present formalisms. Why do we want to make this convenient? GENERAL GOALS

This book is licensed under a Creative Commons Attribution 3.0 License

Propositional Logic Formal Syntax and Semantics. Computability and Logic

Reflection in the Chomsky Hierarchy

The Diagonal Lemma: An Informal Exposition

Types and Static Type Checking (Introducing Micro-Haskell)

Lecture 5. Logic I. Statement Logic

Ramsey s Theorem on Graphs

ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

Recursively Enumerable Languages, Turing Machines, and Decidability

The syntax and semantics of Beginning Student

The syntax and semantics of Beginning Student

Types and Static Type Checking (Introducing Micro-Haskell)

Programming Languages Third Edition

Formally-Proven Kosaraju s algorithm

CSE 12 Abstract Syntax Trees

Course notes for Data Compression - 2 Kolmogorov complexity Fall 2005

3.7 Denotational Semantics

We will show that the height of a RB tree on n vertices is approximately 2*log n. In class I presented a simple structural proof of this claim:

Lecture 5: The Halting Problem. Michael Beeson

ISA 562: Information Security, Theory and Practice. Lecture 1

14.1 Encoding for different models of computation

Typed Lambda Calculus for Syntacticians

CS103 Spring 2018 Mathematical Vocabulary

Typed Lambda Calculus

SFU CMPT Lecture: Week 8

6.001 Notes: Section 31.1

(Refer Slide Time: 4:00)

Understanding Recursion

CS 161 Computer Security

Parameterized Complexity of Independence and Domination on Geometric Graphs

Goals: Define the syntax of a simple imperative language Define a semantics using natural deduction 1

CSC 501 Semantics of Programming Languages

2. CONNECTIVITY Connectivity

COMPUTABILITY THEORY AND RECURSIVELY ENUMERABLE SETS

Core Membership Computation for Succinct Representations of Coalitional Games

Operational Semantics 1 / 13

Induction and Semantics in Dafny

We show that the composite function h, h(x) = g(f(x)) is a reduction h: A m C.

Instructor: Padraic Bartlett. Lecture 2: Schreier Diagrams

6.001 Notes: Section 1.1

2 Ambiguity in Analyses of Idiomatic Phrases

CS 395T Computational Learning Theory. Scribe: Wei Tang

A computer implemented philosophy of mathematics

Foundations of AI. 9. Predicate Logic. Syntax and Semantics, Normal Forms, Herbrand Expansion, Resolution

Organizing Information. Organizing information is at the heart of information science and is important in many other

Formal semantics of loosely typed languages. Joep Verkoelen Vincent Driessen

p x i 1 i n x, y, z = 2 x 3 y 5 z

Reference Resolution and Views Working Note 25

Steven Skiena. skiena

Computation Club: Gödel s theorem

Context-Free Grammars

L322 Syntax. Chapter 3: Structural Relations. Linguistics 322 D E F G H. Another representation is in the form of labelled brackets:

Towards a Logical Reconstruction of Relational Database Theory

Theory of Computer Science. D2.1 Introduction. Theory of Computer Science. D2.2 LOOP Programs. D2.3 Syntactic Sugar. D2.

Handout 9: Imperative Programs and State

CPSC 536N: Randomized Algorithms Term 2. Lecture 5

CSCC24 Functional Programming Scheme Part 2

MC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points

Propositional Logic. Andreas Klappenecker

EXTREME POINTS AND AFFINE EQUIVALENCE

Lecture 4: Petersen Graph 2/2; also, Friendship is Magic!

Supplementary Notes on Abstract Syntax

COMP 410 Lecture 1. Kyle Dewey

The discussion of Chapter 1 will be split into two sessions; the first will cover 1.1 and 1.2; the second will cover 1.3, 1.4, and 1.5.

Scribe: Virginia Williams, Sam Kim (2016), Mary Wootters (2017) Date: May 22, 2017

To prove something about all Boolean expressions, we will need the following induction principle: Axiom 7.1 (Induction over Boolean expressions):

Lecture 3: Recursion; Structural Induction

Denotational semantics

So many Logics, so little time

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science Algorithms For Inference Fall 2014

A Small Interpreted Language

6.001 Notes: Section 8.1

8 Matroid Intersection

1 Overview. 2 Applications of submodular maximization. AM 221: Advanced Optimization Spring 2016

Jaykov Foukzon. Israel Institute of Technology, Haifa, Israel.

Notes on Turing s Theorem and Computability

Implementation of Axiomatic Language

Logic: The Big Picture. Axiomatizing Arithmetic. Tautologies and Valid Arguments. Graphs and Trees

Denotational Semantics of a Simple Imperative Language Using Intensional Logic

Context-Free Grammars

Definition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1

Topic 3: Propositions as types

COMP 330 Autumn 2018 McGill University

Some Interdefinability Results for Syntactic Constraint Classes

MA651 Topology. Lecture 4. Topological spaces 2

Chapter 3: Theory of Modular Arithmetic 1. Chapter 3: Theory of Modular Arithmetic

Incompatibility Dimensions and Integration of Atomic Commit Protocols

Lecture 15 : Review DRAFT

CPSC 427a: Object-Oriented Programming

Harvard School of Engineering and Applied Sciences CS 152: Programming Languages

Mathematically Rigorous Software Design Review of mathematical prerequisites

Outcome-Oriented Programming (5/12/2004)

CSE 21 Spring 2016 Homework 5. Instructions

Computer Science 21b: Structure and Interpretation of Computer Programs (Spring Term, 2004)

the Computability Hierarchy

Theory of Computer Science

Theorem 2.9: nearest addition algorithm

Transcription:

Linguistics and Philosophy 23: 629-633, 1998 Is Compositionality Formally Vacuous? Ali Kazmi Dept. Philosophy Univ. Calgary Francis Jeffry Pelletier Dept. Philosophy Univ. Alberta We prove a theorem stating that any semantics can be encoded as a compositional semantics, which means that, essentially, the standard definition of compositionality is formally vacuous, says Zadrozny (1994: 329). We disagree. Consider the following very simple language L, that consists of only five strings. It is generated by a grammar with only three symbols (A, B, C) in its alphabet and one syntactic operation (concatenation). 1 We explicitly indicate this syntactic concatenation by the symbol. The language L consists of just the strings A, B, C, C A, C B. The semantics for L is given by a meaning function, m. We will not bother to state specifically what the meanings are for the various expressions of L, but will just say what are the conditions on the meaning which determine that the semantics is non-compositional: Each of the five strings in the language has a meaning; furthermore (1) a. m(a) = m(b) b. m(c A) m(c B) Even though we have not said what the meanings of the various expressions of L are, we have required that any such specific semantics must be non-compositional because the meaning of C A couldn t be a function just of the meanings of C and of A; for if it were, then the meaning of C A would be the same as that of C B, since the meanings of A and of B are the same. 2 Yet Zadrozny claims that this semantics can be encoded compositionally. What s going on? 1 Zadrozny considers only grammars having concatenation as their sole syntactic rule. He clearly believes that the points he makes will carry over to grammars with more intricate syntactic rules and with a rich non-terminal vocabulary. But his article does not expand on this, and we will merely follow the sort of examples he considers. 2 Of course, if C A and C B were not complex terms they could compositionally be given meanings that obey our restrictions. They could just be treated as atomic elements and assigned basic meanings. (A kind of vacuous compositionality). But given that they are syntactically complex terms of L, they then violate the condition that their meanings be a function only of the meanings of the component parts.

p.2 Here s what. 3 For each meaningful string of L, Zadrozny associates a (distinct) function. This function is defined as applying only to the one expression, plus to any of the other functions defined for the other expressions of L, so long as the syntactic concatenation of those expressions is allowed in the language. (For our simple language, we allow the function associated with C to apply to the function associated with A and also to the function associated with B). For this language we will have the set F consisting of five functions: f 1, f 2, f 3, f 4, f 5, such that: (2)a. f 1 (A) = m(a); f 1 is undefined for B, C, C A, C B b. f 2 (B) = m(b); f 2 is undefined for A, C, C A, C B c. f 3 (C) = m(c); f 3 is undefined for A, B, C A, C B d. f 4 (C A) = m(c A); f 4 is undefined for A, B, C, C B e. f 5 (C B) = m(c B); f 5 is undefined for A, B, C, C A f. f 3 is defined for f 1 : f 3 (f 1 ) = f 4 g. f 3 is defined for f 2 : f 3 (f 2 ) = f 5 h. none of the functions is defined for any other arguments The existence of the set F of functions is guaranteed by the existence of the meanings presumed by m, although in the general case we will need a non-well-founded set theory to guarantee the existence of arbitrary such functions, since if an expression can be syntactically concatenated with itself this would give rise to a function having itself in its own domain and range. From these five functions we can define another function, µ: (3) µ(a) = f 1 µ(b) = f 2 µ(c) = f 3 µ(c A) = f 4 µ(c B) = f 5 Now note that from these definitions we have (4) µ(c A) = f 4 = f 3 (f 1 ) = µ(c)(µ(a)) µ(c B) = f 5 = f 3 (f 2 ) = µ(c)(µ(b)) And this shows that µ is compositional. And from the theorems that guarantee that this can always be done, Zadroznzy concludes that we can always construct a compositional meaning function that will encode any semantics we wanted to encode. 3 Our exposition departs somewhat from Zadrozny s account, although this difference does not affect the main point of his Theorem 1 and Corollary 2. (Our example follows the main point of his Corollary 2).

p.3 We don t think this is the correct interpretation of the situation. How can it be, since the semantics of the language is by definition non-compositional! Rather than Zadrozny s conclusion, here s how we see the situation. We are given a set, M, of four meanings: (5) Meanings m 1 (= m(a) and m(b)) m 3 (= m(c)) m 4 (= m(c A)) m 5 (= m(c B) Zadrozny's proof, applied to this example, would have us consider the set, F, of five functions associated with M: (6) Meanings F m 1 f 1 f2 m 3 f 3 m 4 f 4 m 5 f 5 It will be recalled that f 1 f 5 are functions. These functions are not themselves meanings, but rather yield meanings when applied to an appropriate element of the language: f 1 (A)=m 1, f 2 (B)=m 1, f 4 (C A)=m 4, etc. Note that all these functions, even f 1 and f 2, are distinct functions, for they have different items in their domain (f 1 is not defined for B nor is f 2 defined for A). Now we add the function µ to the picture: (7) Meanings F m 1 f 1 µ(a) f 2 µ(b) m 3 f 3 µ(c) m 4 f 4 µ(c A) m 5 f 5 µ(c B) If the functions in F were the meanings relevant to the language, then µ would be a compositional meaning function for the language. But they aren t, because the meaning of A is the same as the meaning of B, but f 1 is not the same as f 2. After all, f 1 (A) yields the meaning of A, and that s the same as the meaning of B, yet f 1 is not even defined for B. The members of F are functions from the expressions of the language to meanings, but they are not themselves meanings.

p.4 Zadrozny has given us a way to map compositionally each expression of the language with something that is characteristically associated with its meaning, by using µ and the elements of F. But there is no reason to believe that this is to give a compositional account of the meanings of the expressions of the language. In fact, his detour through complex functions is not necessary for the sort of case Zadrozny discusses. Consider the following modification of Zadrozny s method, where we replace the set of F's with the set of well-formed expressions of the language and replace the function µ with an identity function, i. We then have this picture: (8) Meanings L m 1 A i(a) B i(b) m 3 C i((c) m 4 C A i(c A) m 5 C B i(c B) Note that i is a compositional function as well: i(c A) = i(c) i(a). Furthermore note that each member of L is characteristically associated with the meaning of some item of L. And so we might conclude, like Zadrozny, that we have given a way to compositionally map each expression of the language with something that is characteristically associated with its meaning, by using i and the elements of the language L. Yet what we have done certainly is not the same as giving a compositional semantic theory for L. Thus establishing the existence of µ is no more significant to establishing compositional semantics than is establishing the existence of i. There may be a temptation to think that this identity mapping (associated with each expression is that expression itself) is nevertheless a theory of meaning, perhaps a purely syntactic theory of meaning, in that the item associated with each word forms a string that mirrors exactly the syntax of L and we are then invited to associate whatever meaning we want with any complex expression. But this is a mistake. Zadrozny's theory is not a theory of meaning. It is perhaps a theory of pointers to meanings, and it is compositional; but it is not true that the meaning, in the original intuitive sense, has been used to construct a compositional theory of meaning. It is not true that we have here encoded the original semantics as a compositional semantics. The meanings of the complex

p.5 sentences are not functions of the meanings of the words of course they couldn t be, since the initial semantics was by definition not compositional! they are instead items that are characteristically associated with meanings. As we said, this is perhaps a compositional theory of something. But not of meaning. Perhaps Zadrozny is postulating yet another level of analysis where compositionality is guaranteed to hold? Perhaps so; but this level is not meaning in whatever our initial sense was, and so it is not true that our semantics has been encoded as a compositional semantics. And since Zadrozny has not shown that any semantics can be encoded as a compositional semantics, he has not shown that the standard definition of compositionality is formally vacuous. References Zadrozny, W. (1994) From Compositional to Systematic Semantics Linguistics and Philosophy 17: 391-428.