In this article I present the conception of syntax emerging from the “dynamic approach” to syntax and semantics, developed in the last few decades, moving from the critic to the static theories of language, either those developed in the Chomskian framework or those based on Montague’s grammar. I will suggest that this view can be fruitfully compared with Saussure’s position on syntax.

In this dissertation we present proof systems for several modal logics. These proof systems are based on analytic (or semantic) tableaux. -/- Modal logics are logics for reasoning about possibility, knowledge, beliefs, preferences, and other modalities. Their semantics are almost always based on Saul Kripke’s possible world semantics. In Kripke semantics, models are represented by relational structures or, equivalently, labeled graphs. Syntactic formulas that express statements about knowledge and other modalities are evaluated in terms of such models. -/- This dissertation (...) focuses on modal logics with dynamic operators for public announcements, belief revision, preference upgrades, and so on. These operators are defined in terms of mathematical operations on Kripke models. Thus, for example, a belief revision operator in the syntax would correspond to a belief revision operation on models. -/- The ‘dynamic’ semantics of dynamic modal logics are a clever way of extending languages without compromising on intuitiveness. We present ‘dynamic’ tableau proof systems for these dynamic semantics, with the express aim to make them conceptually simple, easy to use, modular, and extensible. This we do by reflecting the semantics as closely as possible in the components of our tableau system. For instance, dynamic operations on Kripke models have counterpart dynamic relations between tableaux. -/- Soundness, completeness, and decidability are three of the most important properties that a proof system may have. A proof system is sound if and only if any formula for which a proof exists, is true in every model. A proof system is complete if and only if for any formula that is true in all models, a proof exists. A proof system is decidable if and only if any formula can be proved to be a theorem or not a theorem in a finite number of steps. All proof systems in this dissertation are sound, complete, and decidable. -/- Part of our strategy to create modular tableau systems is to delay concerns over decidability until after soundness and completeness have been established. Decidability is attained through the operations of folding and through operations on ‘tableau cascades’, which are graphs of tableaux. -/- Finally, we provide a proof-of-concept implementation of our dynamic tableau system for public announcement logic in the Clojure programming language. (shrink)

This article focuses on foundational issues in dynamic and static semantics, specifically on what is conceptually at stake between the dynamic framework and the truth-conditional framework, and consequently what kinds of evidence support each framework. The article examines two questions. First, it explores the consequences of taking the proposition as central semantic notion as characteristic of static semantics, and argues that this is not as limiting in accounting for discourse dynamics as many think. Specifically, it explores what it (...) means for a static semantics to incorporate the notion of context change potential in a dynamic pragmatics and denies that this conception of static semantics requires that all updates to the context be eliminative and distributive. Second, it argues that the central difference between the two frameworks is whether semantics or pragmatics accounts for dynamics, and explores what this means for the oft-heard claim that dynamic semantics blurs the semantics/pragmatics distinction. (shrink)

Philosophical questions about minds and computation need to focus squarely on the mathematical theory of Turing machines (TM's). Surrogate TM's such as computers or formal systems lack abilities that make Turing machines promising candidates for possessors of minds. Computers are only universal Turing machines (UTM's)—a conspicuous but unrepresentative subclass of TM. Formal systems are only static TM's, which do not receive inputs from external sources. The theory of TM computation clearly exposes the failings of two prominent critiques, Searle's Chinese room (...) (1980) and arguments from Gödel's Incompleteness theorems (e.g., Lucas, 1961; Penrose, 1989), both of which fall short of addressing the complete TM model. Both UTM-computers and formal systems provide an unsound basis for debate. In particular, their special natures easily foster the misconception that computation entails intrinsically meaningless symbol manipulation. This common view is incorrect with respect to full-fledged TM's, which can process inputs non-formally, i.e., in a subjective and dynamically evolving fashion. To avoid a distorted understanding of the theory of computation, philosophical judgments and discussions should be grounded firmly upon the complete Turing machine model, the proper model for real computers. (shrink)

I suspect the answer to the question in the title of this paper is no. But the scope of my paper will be considerably more limited: I will be concerned with whether certain types of considerations that are commonly cited in favor of dynamic semantics do in fact push us towards a dynamic semantics. Ultimately, I will argue that the evidence points to a dynamics of discourse that is best treated pragmatically, rather than as part of the semantics.

Featured course on "Dynamic Semantics" at NASSLLI 2016. Day 1: Introduction. Abstract: Dynamic semantics is a family of semantic theories that seek to explicate the intuition that saying something changes the context for what follows. We survey the development of formal semantics from static to dynamic formalisms since 1970s. Throughout, we highlight natural language phenomena that motivate dynamic semantics, and the key pre-theoretical concepts -- information state, update, and discourse referent -- which can be implemented in (...) different ways and thus lead to various dynamic logics. (shrink)

Featured course on "Dynamic Semantics" at NASSLLI 2016. Day 2: Anaphora. Abstract: Cross-linguistic evidence shows that anaphora crucially involves context change. The logical representation system must be able to represent rank-based anaphora, because in every language the favorite anaphors -- e.g. Mandarin zeros, Kalaallisut inflections, English pronouns -- are restricted to refer to top-ranked antecedents (top-level anaphors, like Mandarin zeros or Kalaallisut inflections) or top- or 2nd-ranked antecedents (shallow anaphors, like English pronouns).

Featured course on "Dynamic Semantics" at NASSLLI 2016. Day 3: Indexicality. Abstract: Cross-linguistic evidence shows that indexicality, too, crucially involves context change. Speaking up focuses attention on that event and thereby makes it available for discourse reference (by "i", "you", etc). In Kalaallisut, this explains parallel grammatical marking of indexical reference and topic-oriented anaphora. Moreover, shiftable indexicals in Slavey show that certain expressions, e.g. attitude verbs, may update the top perspectival discourse referent from the speech event to an attitude (...) state. (shrink)

In ‘Sly Pete’ or ‘standoff’ cases, reasonable speakers accept incompatible conditionals, and communicate them successfully to a trusting hearer. This paper uses the framework of dynamic semantics to offer a new model of the conversational dynamics at play in standoffs, and to articulate several puzzles posed by such cases. The paper resolves these puzzles by embracing a dynamic semantics for conditionals, according to which indicative conditionals require that their antecedents are possible in their local context, and update this (...) body of information by eliminating the possibilities where the antecedent is true and the consequent is false. In this way, the dynamic analysis draws on insights from the material conditional and contextualist analyses, while explaining how standoffs are genuine disagreements. (shrink)

Featured course on "Dynamic Semantics" at NASSLLI 2016. Day 4: Temporality. Abstract: Cross-linguistic evidence shows that temporal reference likewise involves context change. In every language, temporal reference is similar to top-level nominal reference, except that instead of updating or referring to top-ranked individuals, temporal grammatical systems update or refer to top-ranked temporal referents (events, states, or times). We discuss and compare temporal reference in two sample languages: tense-based English and tenseless aspect-based Mandarin.

Featured course on "Dynamic Semantics" at NASSLLI 2016. Day 5: Quantification. Abstract: In discourse, quantifiers can function as antecedents or anaphors. We analyze a sample discourse in Dynamic Plural Logic (DPlL, van den Berg 1993, 1994), which represents not only current discourse referents, but also current relations by means of plural information states. This makes it possible to analyze quantification as structured discourse reference. Finally, the DPlL analysis is transposed into Update with Centering, to simplify the formalism and (...) relate quantification to earlier discussion in the course. (shrink)

Turner argues that computer programs must have purposes, that implementation is not a kind of semantics, and that computers might need to understand what they do. I respectfully disagree: Computer programs need not have purposes, implementation is a kind of semantic interpretation, and neither human computers nor computing machines need to understand what they do.

In this paper we discuss a new perspective on the syntax-semantics interface. Semantics, in this new set-up, is not ‘read off’ from Logical Forms as in mainstream approaches to generative grammar. Nor is it assigned to syntactic proofs using a Curry-Howard correspondence as in versions of the Lambek Calculus, or read off from f-structures using Linear Logic as in Lexical-Functional Grammar (LFG, Kaplan & Bresnan [9]). All such approaches are based on the idea that syntactic objects (trees, proofs, fstructures) are (...) somehow prior and that semantics must be parasitic on those syntactic objects. We challenge this idea and develop a grammar in which syntax and semantics are treated in a strictly parallel fashion. The grammar will have many ideas in common with the (converging) frameworks of categorial grammar and LFG, but its treatment of the syntax-semantics interface is radically different. Also, although the meaning component of the grammar is a version of Montague semantics and although there are obvious affinities between Montague’s conception of grammar and the work presented here, the grammar is not compositional, in the sense that composition of meaning need not follow surface structure. (shrink)

Vector models of language are based on the contextual aspects of language, the distributions of words and how they co-occur in text. Truth conditional models focus on the logical aspects of language, compositional properties of words and how they compose to form sentences. In the truth conditional approach, the denotation of a sentence determines its truth conditions, which can be taken to be a truth value, a set of possible worlds, a context change potential, or similar. In the vector models, (...) the degree of co-occurrence of words in context determines how similar the meanings of words are. In this paper, we put these two models together and develop a vector semantics for language based on the simply typed lambda calculus models of natural language. We provide two types of vector semantics: a static one that uses techniques familiar from the truth conditional tradition and a dynamic one based on a form of dynamic interpretation inspired by Heim’s context change potentials. We show how the dynamic model can be applied to entailment between a corpus and a sentence and provide examples. (shrink)

A dynamic semantics for epistemically modalized sentences is an attractive alternative to the orthodox view that our best theory of meaning ascribes to such sentences truth-conditions relative to what is known. This essay demonstrates that a dynamic theory about might and must offers elegant explanations of a range of puzzling observations about epistemic modals. The first part of the story offers a unifying treatment of disputes about epistemic modality and disputes about matters of fact while at the same (...) time avoiding the complexities of alternative theories. The second part of the story extends the basic framework to cover some complicated data about retraction and the interaction between epistemic modality and tense. A comparison between the suggestion made in this essay and current versions of the orthodoxy is provided. (shrink)

It appears that indexicals must have fine-grained senses for us to explain things involving human action and emotions, and we typically identify these different senses with different modes of expression. On the other hand, we also express the very same thought in very different ways. The first problem is the problem of cognitive significance. The second problem is what Branquinho (1999) has called the problem of cognitive dynamics. The question is how we can solve both of those problems at the (...) same time. Vojislav Božičković (2021) offers one solution in which the cognitive dynamics runs through the objects of the attitudes. I discuss this solution and offer an alternative in which the theory of cognitive dynamics has no use for the objects of the attitudes to unify expressions of attitudes. When we say or believe “the same thing” using different modes of expressions, it is by virtue of our deploying a dynamic theory of attitude expression. Like Lewis Carrol’s Red Queen, we must run to stay in place. (shrink)

This paper defends the view that common nouns have a dual semantic structure that includes extension-determining and non-extension-determining components. I argue that the non-extension-determining components are part of linguistic meaning because they play a key compositional role in certain constructions, especially in privative noun phrases such as "fake gun" and "counterfeit document". Furthermore, I show that if we modify the compositional interpretation rules in certain simple ways, this dual content account of noun phrase modification can be implemented in a type-driven (...) formal semantic framework. In addition, I also argue against traditional accounts of privative noun phrases which can be paired with the assumption that nouns do not have a dual semantic structure. At the most general level, this paper presents a proposal for how we can begin to integrate a psychologically realistic account of lexical semantics with a linguistically plausible compositional semantic framework. (shrink)

A dynamic semantics for iffy oughts offers an attractive alternative to the folklore that Chisholm's paradox enforces an unhappy choice between the intuitive inference rules of factual and deontic detachment. The first part of the story told here shows how a dynamic theory about ifs and oughts gives rise to a nonmonotonic perspective on deontic discourse and reasoning that elegantly removes the air of paradox from Chisholm's puzzle without sacrificing any of the two detachment principles. The second part (...) of the story showcases two bonus applications of the framework suggested here: it offers a response to Forrester's gentle murder paradox and avoids Kolodny and MacFarlane's miners paradox about deontic reasoning under epistemic uncertainty. A comparison between the dynamic semantic proposal made in this paper and a more conservative approach combining a static semantics with a dynamic pragmatics is provided. (shrink)

Many philosophers think that being in an intentional state is a matter of being related to a sentence in a mental language-a 'Language of Thought' (see especially Fodor 1975, 1987 Appendix; Field 1978). According to this view-which I shall call 'the LT hypothesis'-when anyone has a belief or a desire or a hope with a certain content, they have a sentence of this language, with that content, 'written' in their heads. The claim is meant quite literally: the mental representations that (...) make up the items of this language have semantic and syntactic properties. This is why, according to this view, cognitive psychology does, and should, treat that part of the mind which deals with intentional states as a semantic and a syntactic 'engine'. (shrink)

Veltman’s test semantics and developments thereof reject the canon about semantic contents and attitude ascriptions in favor of dynamic alternatives. According to these theories the semantic content of a sentence is not a proposition, but a context change potential (CCP). Similarly, beliefs are not taken to be relations between agents and propositions, but agents and CCPs. These deviations from the canon come at the cost of an elegant explanation about the correctness of belief. Standardly, it is taken that the (...) content of a belief is correct just in case the content of that belief is true. The proponent of the test semantics cannot appeal to this explanation since they hold that certain contents, namely epistemically modalized contents, do not express propositions, and are neither true nor false. After motivating the need for an account of the correctness of belief within the dynamic framework, I argue that the few extant accounts in the literature are unsatisfactory. A novel account is proposed that avoids the problems of competing views. (shrink)

The first aim of the paper is to show that under certain conditions generative syntax can be made suitable for Montague semantics, based on his type logic. One of the conditions is to make branching in the so-called X-bar syntax strictly binary, This makes it possible to provide an adequate semantics for Noun Phrases by taking them as referring to sets of collections of sets of entities ( type <ett,t>) rather than to sets of sets of entities (ett).

The question “what is an interpretation?” is often intertwined with the perhaps even harder question “what is a scientific theory?”. Given this proximity, we try to clarify the first question to acquire some ground for the latter. The quarrel between the syntactic and semantic conceptions of scientific theories occupied a large part of the scenario of the philosophy of science in the 20th century. For many authors, one of the two currents needed to be victorious. We endorse that such debate, (...) at least in the terms commonly expressed, can be misleading. We argue that the traditional notion of “interpretation” within the syntax/semantic debate is not the same as that of the debate concerning the interpretation of quantum mechanics. As much as the term is the same, the term “interpretation” as employed in quantum mechanics has its meaning beyond (pure) logic. Our main focus here lies on the formal aspects of the solutions to the measurement problem. There are many versions of quantum theory, many of them incompatible with each other. In order to encompass a wider variety of approaches to quantum theory, we propose a different one with an emphasis on pure formalism. This perspective has the intent of elucidating the role of each so-called “interpretation” of quantum mechanics, as well as the precise origin of the need to interpret it. (shrink)

I show that standard dynamic approaches to the semantics of epistemic modals invalidate the classical laws of excluded middle and non-contradiction, as well as the law of epistemic non-contradiction. I argue that these facts pose a serious challenge.

This paper highlights a small selection of cases where crosslinguistic insights have been important to big questions in the theory of semantics and the syntax/semantics interface. The selection includes (i) the role and representation of Speaker and Addressee in the grammar; (ii) mismatches between form and interpretation motivating high-placed silent operators for functional elements; and (iii) the explanation of semantic universals, including universals pertaining to inventories, in terms of learnability and the trade-off between informativeness and simplicity.

The standing tradition in theorizing about meaning, since at least Frege, identifies meaning with propositions, which are, or determine, the truth-conditions of a sentence in a context. But a recent trend has advocated a departure from this tradition: in particular, it has been argued that modal claims do not express standard propositional contents. This non-propositionalism has received different implementations in expressivist semantics and certain kinds of dynamic semantics. They maintain that the key aspect of interpretation of modal claims is (...) the characteristic dynamic effect they have on the context. I argue that pessimism about truth-conditions arises from an overly simplistic picture of content, context and their interaction. While I agree with the critics that an important aspect of modal meaning is the dynamic effect modals have on the context, I argue that they have mischaracterized the nature and the complexity of this effect. A more nuanced account of the interaction between modals and context shows that far from being incompatible with propositional meaning, the dynamic aspect of meaning is precisely what allows us to predict the correct propositional content of an utterance. (shrink)

I critically examine some provocative arguments that John Searle presents in his book The Rediscovery of Mind to support the claim that the syntactic states of a classical computational system are "observer relative" or "mind dependent" or otherwise less than fully and objectively real. I begin by explaining how this claim differs from Searle's earlier and more well-known claim that the physical states of a machine, including the syntactic states, are insufficient to determine its semantics. In contrast, his more recent (...) claim concerns the syntax, in particular, whether a machine actually has symbols to underlie its semantics. I then present and respond to a number of arguments that Searle offers to support this claim, including whether machine symbols are observer relative because the assignment of syntax is arbitrary, or linked to universal realizability, or linked to the sub-personal interpretive acts of a homunculus, or linked to a person's consciousness. I conclude that a realist about the computational model need not be troubled by such arguments. Their key premises need further support. (shrink)

Intertheoretic relations are an important topic in the philosophy of science. However, since their classical discussion by Ernest Nagel, such relations have mostly been restricted to relations between pairs of theories in the natural sciences. In this paper, we present a model of a new type of intertheoretic relation, called 'Montague Reduction', which is assumed in Montague's framework for the analysis and interpretation of natural language syntax. To motivate the adoption of our new model, we show that this model extends (...) the scope of application of the Nagelian (or related) models, and that it shares the epistemological advantages of the Nagelian model. The latter is achieved in a Bayesian framework. (shrink)

The ‘syntax’ and ‘combinatorics’ of my title are what Curry (1961) referred to as phenogrammatics and tectogrammatics respectively. Tectogrammatics is concerned with the abstract combinatorial structure of the grammar and directly informs semantics, while phenogrammatics deals with concrete operations on syntactic data structures such as trees or strings. In a series of previous papers (Muskens, 2001a; Muskens, 2001b; Muskens, 2003) I have argued for an architecture of the grammar in which finite sequences of lambda terms are the basic data structures, (...) pairs of terms syntax, semantics for example. These sequences then combine with the help of simple generalizations of the usual abstraction and application operations. This theory, which I call Lambda Grammars and which is closely related to the independently formulated theory of Abstract Categorial Grammars (de Groote, 2001; de Groote, 2002), in fact is an implementation of Curry’s ideas: the level of tectogrammar is encoded by the sequences of lambda-terms and their ways of combination, while the syntactic terms in those sequences constitute the phenogrammatical level. In de Groote’s formulation of the theory, tectogrammar is the level of abstract terms, while phenogrammar is the level of object terms. (shrink)

Expressivists about epistemic modals deny that ‘Jane might be late’ canonically serves to express the speaker’s acceptance of a certain propositional content. Instead, they hold that it expresses a lack of acceptance. Prominent expressivists embrace pragmatic expressivism: the doxastic property expressed by a declarative is not helpfully identified with that sentence’s compositional semantic value. Against this, we defend semantic expressivism about epistemic modals: the semantic value of a declarative from this domain is the property of doxastic attitudes it canonically serves (...) to express. In support, we synthesize data from the critical literature on expressivism—largely reflecting interactions between modals and disjunctions—and present a semantic expressivism that readily predicts the data. This contrasts with salient competitors, including: pragmatic expressivism based on domain semantics or dynamic semantics; semantic expressivism à la Moss [2015]; and the bounded relational semantics of Mandelkern [2019]. (shrink)

It is commonly assumed that images, whether in the world or in the head, do not have a privileged analysis into constituent parts. They are thought to lack the sort of syntactic structure necessary for representing complex contents and entering into sophisticated patterns of inference. I reject this assumption. “Image grammars” are models in computer vision that articulate systematic principles governing the form and content of images. These models are empirically credible and can be construed as literal grammars for images. (...) Images can have rich syntactic structure, though of a markedly different form than sentences in language. (shrink)

In Groenendijk & Stokhof [1989] a system of dynamic predicate logic (DPL) was developed, as a compositional alternative for classical discourse representation theory (DRT ). DPL shares with DRT the restriction of being a first-order system. In the present paper, we are mainly concerned with overcoming this limitation. We shall define a dynamic semantics for a typed language with λ-abstraction which is compatible with the semantics DPL specifies for the language of first-order predicate logic. We shall propose to (...) use this new logical system as the semantic component of a Montague-style grammar (referred to as dynamic Montague grammar, DMG), which will enable us to extend the compositionality of DPL to the subsentential level. Furthermore, we shall extend this analysis also in this sense that we shall add new, dynamic interpretations for logical constants which in DPL were treated in a static fashion. This will substantially increase the descriptive coverage of DMG. (shrink)

Like '&', '=' is no term; it represents no extrasentential property. It marks an atomic, nonpredicative, declarative structure, sentences true solely by codesignation. Identity (its necessity and total reflexivity, its substitution rule, its metaphysical vacuity) is the objectual face of codesignation. The syntax demands pure reference, without predicative import for the asserted fact. 'Twain is Clemens' is about Twain, but nothing is predicated of him. Its informational value is in its 'metailed' semantic content: the fact of codesignation (that 'Twain' names (...) Clemens) that explains what fact it asserts and why it is necessary. Critiques of concepts of rigidity and elimination of singular terms result. (shrink)

Famous results by David Lewis show that plausible-sounding constraints on the probabilities of conditionals or evaluative claims lead to unacceptable results, by standard probabilistic reasoning. Existing presentations of these results rely on stronger assumptions than they really need. When we strip these arguments down to a minimal core, we can see both how certain replies miss the mark, and also how to devise parallel arguments for other domains, including epistemic “might,” probability claims, claims about comparative value, and so on. A (...) popular reply to Lewis's results is to claim that conditional claims, or claims about subjective value, lack truth conditions. For this strategy to have a chance of success, it needs to give up basic structural principles about how epistemic states can be updated—in a way that is strikingly parallel to the commitments of the project of dynamic semantics. (shrink)

Along with offering an historically-oriented interpretive reconstruction of the syntax of PM ( rst ed.), I argue for a certain understanding of its use of propositional function abstracts formed by placing a circum ex on a variable. I argue that this notation is used in PM only when de nitions are stated schematically in the metalanguage, and in argument-position when higher-type variables are involved. My aim throughout is to explain how the usage of function abstracts as “terms” (loosely speaking) is (...) not inconsistent with a philosophy of types that does not think of propositional functions as mind- and language-independent objects, and adopts a nominalist/substitutional semantics instead. I contrast PM’s approach here both to function abstraction found in the typed λ-calculus, and also to Frege’s notation for functions of various levels that forgoes abstracts altogether, between which it is a kind of intermediary. (shrink)

Imperatives are linguistic devices used by an authority (speaker) to express wishes, requests, commands, orders, instructions, and suggestions to a subject (addressee). This essay's goal is to tentatively address some of the following questions about the imperative. -/- METASEMANTIC. What is the menu of options for understanding fundamental semantic notions like satisfaction, truth-conditions, validity, and entailment in the context of imperatives? Are there good imperative arguments, and, if so, how are they to be characterized? What are the options for understanding (...) the property that an account of good imperative arguments is supposed to track? What constraints on a semantic analysis of the imperative do different positions on the metasemantic issues impose? -/- SEMANTIC. How might we implement metasemantic postures in a rigorous formal system? How much can we do using familiar tools from deontic modal logic? How much leverage over semantic questions can we gain by introducing tools from natural language semantics—ordering sources, dyadic modal operators, salient alternatives, and the like—into a formal semantics for an imperative object language? How much leverage can we gain by introducing tools from rather less-utilized areas of modal logic—devices for representing actions and planning in time, modal operators constructed from action-terms, and the like—into the analysis? -/- DYNAMIC. How do imperatives succeed in performing the speech acts they are used to perform? How do imperatives update discourses? How can we leverage an account of imperative discourse update in giving a dynamic semantics for the imperative? Is there anything about the imperative that demands a dynamic semantic treatment? (shrink)

Our aim here is to lay the groundwork for formal tree-ring analysis combining data from dendrochronology with formal techniques from semantics. We will present the basic syntax of, and basic compositional semantics of tree-ring structures.

In non‐literal uses of language, the content an utterance communicates differs from its literal truth conditions. Loose talk is one example of non‐literal language use (amongst many others). For example, what a loose utterance of (1) communicates differs from what it literally expresses: (1) Lena arrived at 9 o'clock. Loose talk is interesting (or so I will argue). It has certain distinctive features which raise important questions about the connection between literal and non‐literal language use. This paper aims to (i.) (...) introduce a range of novel data demonstrating certain overlooked features of loose talk, and (ii.) develop a new theory of the phenomenon which accounts for these data. In particular, this theory is motivated by the need to explain minimal pairs such as (2)-(3): (2) Lena arrived at 9 o'clock, but she did not arrive at 9 o'clock exactly. (3) ?? Lena did not arrive at 9 o'clock exactly, but she arrived at 9 o'clock. (2) and (3) agree in their truth conditions. Yet they differ in felicity. As such, they constitute a problem for any account which hopes to predict the acceptability of the loose use of a sentence from its truth conditions and the context of utterance alone. Instead, it will be argued, to explain loose talk phenomena we must posit an additional layer of meaning outstripping truth conditions. This layer of meaning is shown to exhibit a range of properties, all of which point to its being semantically encoded. Thus, if correct, the theory provides a new example of how semantic meaning must extend beyond literal, truth‐conditional content. (shrink)

This study is intended to provide in-depth insights into how design thinking and creativity issues are understood and possibly evolve in the course of design discussions in a company context. For that purpose, we use the seminar transcripts of the Design Thinking Research Symposium 12 (DTRS12) dataset “Tech-centred Design Thinking: Perspectives from a Rising Asia,” which are primarily concerned with how Korean companies implement design thinking and what role designers currently play. We employed a novel method of information processing based (...) on constructed dynamic semantic networks to investigate the seminar discussions according to company representatives and company size. We compared the quantitative dynamics in two seminars: the first involved managerial representatives of four companies, and the second involved specialized designers and management of a design center of single company. On the basis of dynamic semantic networks, we quantified the changes in four semantic measures—abstraction, polysemy, information content, and pairwise word similarity—in chronologically reconstructed individual design-thinking processes. Statistical analyses show that design thinking in the seminar with four companies, exhibits significant differences in the dynamics of abstraction, polysemy, and information content, compared to the seminar with the design center of single company. Both the decrease in polysemy and abstraction and the increase in information content in the individual design-thinking processes in the seminar with four companies indicate that design managers are focused on more concrete design issues, with more information and less ambiguous content to the final design product. By contrast, specialized designers manifest more abstract thinking and appear to exhibit a slightly higher level of divergence in their design processes. The results suggest that design thinking and creativity issues are articulated differently depending on designer roles and the company size. (shrink)

I focus on and criticize John Searle's argument against a classical computational view of the mind according to which the attribution of syntax is observer relative (in Searle, Rediscovery of Mind, MIT Press, 1992). Searle's argument is interesting inasmuch as it differs from his previous and more well-known argument that syntax is not sufficient for semantics. This argument aims to undercut even the syntax as something that exists only in the eye of the beholder. I show that Searle's argument rests (...) on premises that go unsupported. (shrink)

This paper argues that the idea of a computer is unique. Calculators and analog computers are not different ideas about computers, and nature does not compute by itself. Computers, once clearly defined in all their terms and mechanisms, rather than enumerated by behavioral examples, can be more than instrumental tools in science, and more than source of analogies and taxonomies in philosophy. They can help us understand semantic content and its relation to form. This can be achieved because they have (...) the potential to do more than calculators, which are computers that are designed not to learn. Today’s computers are not designed to learn; rather, they are designed to support learning; therefore, any theory of content tested by computers that currently exist must be of an empirical, rather than a formal nature. If they are designed someday to learn, we will see a change in roles, requiring an empirical theory about the Turing architecture’s content, using the primitives of learning machines. This way of thinking, which I call the intensional view of computers, avoids the problems of analogies between minds and computers. It focuses on the constitutive properties of computers, such as showing clearly how they can help us avoid the infinite regress in interpretation, and how we can clarify the terms of the suggested mechanisms to facilitate a useful debate. Within the intensional view, syntax and content in the context of computers become two ends of physically realizing correspondence problems in various domains. (shrink)

Natural recursion in syntax is recursion by linguistic value, which is not syntactic in nature but semantic. Syntax-specific recursion is not recursion by name as the term is understood in theoretical computer science. Recursion by name is probably not natural because of its infinite typeability. Natural recursion, or recursion by value, is not species-specific. Human recursion is not syntax-specific. The values on which it operates are most likely domain-specific, including those for syntax. Syntax seems to require no more (and no (...) less) than the resource management mechanisms of an embedded push-down automaton (EPDA). We can conceive EPDA as a common automata-theoretic substrate for syntax, collaborative planning, i-intentions, and we-intentions. They manifest the same kind of dependencies. Therefore, syntactic uniqueness arguments for human behavior can be better explained if we conceive automata-constrained recursion as the most unique human capacity for cognitive processes. (shrink)

Over the last fifteen years, linguists and philosophers of language have reexamined the canonical, Kratzerian semantics for modal expressions, with special attention paid to their epistemic and deontic uses. This article is an overview of the literature on deontic modal expressions. Section 1 provides an overview of the canonical semantics, noting some of its main advantages. Section 2 introduces a set of desiderata that have achieved the status of fixed points in the debates about whether the canonical semantics is correct. (...) These include the observations that deontic modal sentences have both deliberative and evaluative readings and both information-sensitive and -insensitive readings. Adequate resolutions of certain puzzles in deontic logic and resolving the Frege-Geach problem for Expressivism have also achieved this status. The third section provides an opinionated overview of some of the main extant rivals to the canonical semantics, including Cariani, Kaufmann, and Kaufmann’s (2013) complex contextualism , Yalcin’s (2012) Expressivism, Willer’s (2014) dynamic semantics, and Starr’s (2016) dynamic Expressivism. Section 4 provides an assessment of each of the views discussed in terms of the desiderata introduced in section 2. Section 5 is an overview of remaining issues that require more attention in the literature. (shrink)

Epistemic logics based on the possible worlds semantics suffer from the problem of logical omniscience, whereby agents are described as knowing all logical consequences of what they know, including all tautologies. This problem is doubly challenging: on the one hand, agents should be treated as logically non-omniscient, and on the other hand, as moderately logically competent. Many responses to logical omniscience fail to meet this double challenge because the concepts of knowledge and reasoning are not properly separated. In this paper, (...) I present a dynamic logic of knowledge that models an agent’s epistemic state as it evolves over the course of reasoning. I show that the logic does not sacrifice logical competence on the altar of logical non- omniscience. (shrink)

This paper has three main goals. First, to motivate a puzzle about how ignorance-expressing terms like maybe and if interact: they iterate, and when they do they exhibit scopelessness. Second, to argue that there is an ambiguity in our theoretical toolbox, and that exposing that opens the door to a solution to the puzzle. And third, to explore the reach of that solution. Along the way, the paper highlights a number of pleasing properties of two elegant semantic theories, explores some (...) meta-theoretic properties of dynamic notions of meaning, dips its toe into some hazardous waters, and offers characterization theorems for the space of meanings an indicative conditional can have. (shrink)

We discuss a well-known puzzle about the lexicalization of logical operators in natural language, in particular connectives and quantifiers. Of the many logically possible operators, only few appear in the lexicon of natural languages: the connectives in English, for example, are conjunction _and_, disjunction _or_, and negated disjunction _nor_; the lexical quantifiers are _all, some_ and _no_. The logically possible nand (negated conjunction) and Nall (negated universal) are not expressed by lexical entries in English, nor in any natural language. Moreover, (...) the lexicalized operators are all upward or downward monotone, an observation known as the Monotonicity Universal. We propose a logical explanation of lexical gaps and of the Monotonicity Universal, based on the dynamic behaviour of connectives and quantifiers. We define update potentials for logical operators as procedures to modify the context, under the assumption that an update by \( \phi \) depends on the logical form of \( \phi \) and on the speech act performed: assertion or rejection. We conjecture that the adequacy of update potentials determines the limits of lexicalizability for logical operators in natural language. Finally, we show that on this framework the Monotonicity Universal follows from the logical properties of the updates that correspond to each operator. (shrink)

This paper presents an analysis of wh-complements in Montague Grammar. We will be concerned primarily with semantics, though some remarks on syntax are made in Section 4. Questions and wh-comple ments in Montague Grammar have been studied in Hamblin (1976), Bennett (1979), Karttunen (1977) and Hauser (1978) among others. These proposals will not be discussed explicitly, but some differences with Karttunen's analysis will be pointed out along the way.

A response to a recent critique by Cem Bozşahin of the theory of syntactic semantics as it applies to Helen Keller, and some applications of the theory to the philosophy of computer science.