This paper explores the relationship between dynamic and truth conditional semantics for epistemic modals. It provides a generalization of a standard dynamic update semantics for modals. This new semantics derives a Kripke semantics for modals and a standard dynamic semantics for modals as special cases. The semantics allows for new characterizations of a variety of principles in modal logic, including the inconsistency of ‘p and might not p’. Finally, the semantics provides a (...) construction procedure for transforming any truth conditional semantics for modals into a dynamic semantics for modals with similar properties. (shrink)

The aim of this paper is twofold: (i) to introduce the framework of update semantics and to explain what kind of semantic phenomena may successfully be analysed in it: (ii) to give a detailed analysis of one such phenomenon: default reasoning.

We present a model-theoretic approach for reasoning about security protocols, applying recent insights from dynamic epistemic logics. This enables us to describe exactly the subsequent epistemic states of the agents participating in the protocol, using Kripke models and transitions between these based on updates of the agent's beliefs associated with steps in the protocol. As a case study we will consider the SRA Three Pass protocol and discuss the Wide-Mouthed Frog protocol.

We outline a novel solution to Moore’s paradox within the framework of update semantics, which explains Moorean absurdity in terms of non-cohesiveness. It is argued that, unlike the outlined solution, Gillies’ treatment of the paradox within this framework is not satisfactory.

This paper presents a general-purpose update semantics for expressions of subjective uncertainty in natural language. First, a set of desiderata are established for how expressions of subjective uncertainty should behave in dynamic, update-based semantic systems; then extant implementations of expressions of subjective uncertainty in such models are evaluated and found wanting; finally, a new update semantics is proposed. The desiderata at the heart of this paper center around the contention that expressions of subjective uncertainty express (...) beliefs which are not persistent, whereas propositions express beliefs that are persistent. I argue that if we make the move of treating updates in a dynamic semantics as Bayesian updates, i.e. as conditionalization, then expressions of subjective uncertainty will behave the way we want them to without altering the way propositions behave. (shrink)

ABSTRACT To more efficiently cover a wide spectrum of conceptual modeling applications such as computer-aided design, computer-aided manufacturing, and medical information systems, we envision multi-paradigm design environments which have reasoning capability to support analyzing specifcations for correctness. For such applications, information system designers employ conceptual models characterized by semantically-rich specification languages. The problem of providing a comprehensive formal framework for such languages has not been adequately addressed. This paper investigates a formal system for this purpose called Event-Formula Logic (EFL). The (...) analysis focuses in particular on characterizing correctness of database updates. Its applicability is demonstrated from two perspectives: deriving preconditions that guarantee a given update will not violate an integrity constraint, and determining alternative integrity maintenance rules for performing corrective actions when the application semantics requires this update interpretation. The work described in this paper represents an important step in the analysis of database update semantics through the use of algorithmic logic. As a result, it contributes towards providing a formal basis for semantically-rich information system design environments. (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 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)

This paper discusses three potential varieties of update: updates to the common ground, structuring updates, and updates that introduce discourse referents. These different types of update are used to model different aspects of natural language phenomena. Not-at-issue information directly updates the common ground. The illocutionary mood of a sentence structures the context. Other updates introduce discourse referents of various types, including propositional discourse referents for at-issue information. Distinguishing these types of update allows a unified treatment of a (...) broad range of phenomena, including the grammatical evidentials found in Cheyenne (Algonquian) as well as English evidential parentheticals, appositives, and mood marking. An update semantics that can formalize all of these varieties of update is given, integrating the different kinds of semantic contributions into a single representation of meaning. (shrink)

Epistemic modals are a prominent topic in the literature on natural language semantics, with wide-ranging implications for issues in philosophy of language and philosophical logic. Considerations about the role that epistemic "might" and "must" play in discourse and reasoning have led to the development of several important alternatives to classical possible worlds semantics for natural language modal expressions. This is an opinionated overview of what I take to be some of the most exciting issues and developments in the (...) field. (shrink)

This book provides a compositional, truth-conditional, crosslinguistic semantics for evidentiality, the linguistic encoding of the source of information on which a statement is based. Central to the proposed theory is the distinction between what propositional content is at-issue and what content is not-at-issue. Evidentials contribute not-at-issue content, and can affect the level of commitment a sentence makes to the main proposition, contributed by sentential mood. In this volume, Sarah Murray builds on recent work in the formal semantics of (...) evidentials and related phenomena, and proposes a semantics that does not appeal to separate dimensions of illocutionary meaning. Instead, she argues that all sentences make three contributions: at-issue content, not-at-issue content, and an illocutionary relation. At-issue content is presented and made available for subsequent anaphora, but is not directly added to the common ground; not-at-issue content directly updates the common ground; and the illocutionary relation uses the at-issue content to impose structure on the common ground, which, depending on the clause type, can trigger further updates. 0The analysis is supported by extensive empirical data from Cheyenne, drawn from the author's own fieldwork, as well as from English and a variety of other languages. (shrink)

This paper is on the update semantics for might of Veltman. Threeconsequence relations are introduced and studied in an abstract setting.Next we present sequent-style systems for each of the consequence relations.We show the logics to be complete and decidable. The paper ends with asyntactic cut elimination result.

This paper is on the update semantics for might of Veltman. Threeconsequence relations are introduced and studied in an abstract setting.Next we present sequent-style systems for each of the consequence relations.We show the logics to be complete and decidable. The paper ends with asyntactic cut elimination result.

Vector models of language are based on the contextual aspects of words and how they co-occur in text. Truth conditional models focus on the logical aspects of language, the denotations of phrases, and their compositional properties. In the latter approach the denotation of a sentence determines its truth conditions and can be taken to be a truth value, a set of possible worlds, a context change potential, or similar. In this short paper, we develop a vector semantics for language (...) based on the simply typed lambda calculus. Our semantics uses techniques familiar from the truth conditional tradition and is based on a form of dynamic interpretation inspired by Heim's context updates. (shrink)

David Lewis asked in “A problem about permission” about the effects on context, specifically on the “sphere of permissibility,” of allowing behavior that had previously been forbidden. The framework of truthmaker semantics sheds useful light on this problem. Update procedures are definable in the truthmaker framework that capture more than Lewis was able to just with worlds. Connections are drawn with epistemic modals, belief revision and the semantics of exceptives. We consider how a truthmaker account of permissive (...) update might be integrated into a larger semantic/pragmatic account of deontic language. Bridge principles are articulated associating types of deontic act with distinct update rules. Distinct forms of permission trigger distinct procedures because they aim at spheres more or less strongly verifying ◊φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Diamond \varphi $$\end{document}, the claim that φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varphi $$\end{document} is permissible. (shrink)

This paper concerns the formal semantic analysis of imperative sentences. It is argued that such an analysis cannot be deferred to the semantics of propositions, under any of the three commonly adopted strategies: the performative analysis, the sentence radical approach to propositions, and the (nondeclarative) mood-as-operator approach. Whereas the first two are conceptually problematic, the third faces empirical problems: various complex imperatives should be analysed in terms of semantic operators over simple imperatives. One particularly striking case is the Dutch (...) pluperfect imperative. It is argued that this construction should be analysed as a genuine counterfactual imperative. On the constructive side, in the last part of the paper a formal semantic analysis of imperatives is presented, in the framework of Update Semantics. On this analysis, imperatives are sui generis semantic entities, on a par with propositions. The analysis also includes an account of the counterfactual imperatives. (shrink)

Larry Moss and Rohit Parikh used subset semantics to characterize a family of logics for reasoning about knowledge. An important feature of their framework is that subsets always decrease based on the assumption that knowledge always increases. We drop this assumption and modify the semantics to account for logics of knowledge that handle arbitrary changes, that is, changes that do not necessarily result in knowledge increase, such as the update of our knowledge due to an action. We (...) present a system which is complete for subset spaces and prove its decidability. (shrink)

The Frame Problem is the problem of how one can design a machine to use information so as to behave competently, with respect to the kinds of tasks a genuinely intelligent agent can reliably, effectively perform. I will argue that the way the Frame Problem is standardly interpreted, and so the strategies considered for attempting to solve it, must be updated. We must replace overly simplistic and reductionist assumptions with more sophisticated and plausible ones. In particular, the standard interpretation assumes (...) that mental processes are identical to certain kinds of computational processes, and so solving the Frame Problem is a matter of finding a computational architecture that can effectively represent relations of semantic relevance. Instead, we must take seriously the possibility that the way in which intelligent agents use information is inherently different. Whereas intelligent agents are plausibly genuinely causally sensitive to semantic properties as such (to what they perceive, desire, believe intend, etc.), computational systems can only be causally sensitive to the formal features that represent these properties. Indeed, it is this very substitution of formal generalizations for genuinely semantic ones that is responsible for the way current AI systems are brittle, inflexible, and highly specialized. What we need is a more sophisticated way of investigating the relationship between computational information processing and genuinely semantic information use, so that these two senses of using information are not conflated, but instead the question of how they are related to one another can be studied directly. I apply the generative methodology I have developed elsewhere for cognitive science and AI research (Miracchi, 2017, 2019a) to show how the Frame Problem can be appropriately updated. (shrink)

This paper develops a way to model performative speech acts within a framework of dynamic semantics. It introduces a distinction between performative and informative updates, where informative updates filter out indices of context sets (cf. Stalnaker, Cole (ed), Pragmatics, Academic Press, 1978), whereas performative updates change their indices (cf. Szabolcsi, Kiefer (ed), Hungarian linguistics, John Benjamins, 1982). The notion of index change is investigated in detail, identifying implementations by a function or by a relation. Declarations like _the meeting is (...) (hereby) adjourned_ are purely performative updates that just enforce an index change on a context set. Assertions like _the meeting is (already) adjourned_ are analyzed as combinations of a performative update that introduces a guarantee of the speaker for the truth of the proposition, and an informative update that restricts the context set so that this proposition is true. The first update is the illocutionary act characteristic for assertions; the second is the primary perlocutionary act, and is up for negotiations with the addressee. Several other speech acts will be discussed, in particular commissives, directives, exclamatives, optatives, and definitions, which are all performative, and differ from related assertions. The paper concludes a discussion of locutionary acts, which are modelled as index changers as well, and proposes a novel analysis for the performative marker _hereby._. (shrink)

We point out a simple but hitherto ignored link between the theoryof updates, the theory of counterfactuals, and classical modal logic: update is a classicalexistential modality, counterfactual is a classical universalmodality, and the accessibility relations corresponding to these modalities are inverses. The Ramsey Rule (often thought esoteric) is simply an axiomatisation of this inverse relationship. We use this fact to translate between rules for updates andrules for counterfactuals. Thus, Katsuno and Mendelzons postulatesU1--U8 are translated into counterfactual rules C1--C8(Table VII), (...) and many of the familiar counterfactual rulesare translated into rules for updates (Table VIII). Ourconclusions are summarised in Table V. (shrink)

While much earlier work has indicated that prior verb bias from lifelong language experience influences language processing, recent findings highlight the fact that verb biases induced during lab-based exposure sessions also influence processing. We investigated the nature of updating, i.e., how prior and current experience might interact in guiding subsequent sentence production. Participants underwent a short training session where we manipulated the bias of known English dative verbs. The prior bias of each verb for the double-object (DO) versus the prepositional-object (...) (PO) dative was estimated using a corpus. Current verb bias was counterbalanced and controlled experimentally. Bayesian mixed-effects logistic models of participants’ responses (DO or PO) during subsequent free-choice production showed that both the prior and current verb biases affected speakers’ construction choice. These effects were additive and not interactive, contrary to the prediction from error-based learning models. Semantic similarity to other verbs and their experimentally manipulated biases influenced sentence production, consistent with item-based analogy and exemplar theory. These results shed light on the potential mechanisms underlying language updating and the adaptation of sentence production to ongoing experience. (shrink)

This paper is based on Tarski’s theory of truth. The purpose of this paper is to solve the liar paradox (and its cousins) and keep both of the deductive power of classical logic and the expressive power of the word “true” in natural language. The key of this paper lies in the distinction between the predicate usage and the operator usage of the word “true”. The truth operator is primarily used for characterizing the semantics of the language. Then, we (...) do not need the hierarchy of languages. The truth predicate is mainly used for grammatical function. Tarski’s schema of the truth predicate is not necessary in this proposal. The schema of the word "true" is the schema of the truth operator. The liar paradox (and its cousins) can be solved in this way. In the appendix, I show a consistent model for both of the truth predicate and the truth operator. (shrink)

The problem of probabilities of conditionals is one of the long-standing puzzles in philosophy of language. We defend and update Adams' solution to the puzzle: the probability of an epistemic conditional is not the probability of a proposition, but a probability under a supposition. -/- Close inspection of how a triviality result unfolds in a concrete scenario does not provide counterexamples to the view that probabilities of conditionals are conditional probabilities: instead, it supports the conclusion that probabilities of conditionals (...) violate standard probability theory. -/- This does not call into question probability theory per se; rather, it calls for a more careful understanding of its role: probability theory is a theory of probabilities of propositions; but as conditionals do not express propositions, their probabilities are not subject to the standard laws. -/- We argue that both conditional probabilities and probabilities of conditionals are best understood in terms of the dynamics of supposing, modeled as a restriction operation on a probability space. This version of the suppositionalist view allows us to connect Adams' Thesis to the widely held restrictor view of the semantics of conditionals. -/- We address two common objections to Adams' view: that the relevant probabilities are ‘probabilities only in name’, and that giving up conditional propositions puts us at a disadvantage when it comes to interpreting compounds. -/- Finally, we argue that some putative counterexamples to Adams' Thesis can be diagnosed as fallacies of probabilistic reasoning: they arise from applying to conditionals laws of standard probability theory which are invalid for them. (shrink)

We present an approach to database update as a form of non monotonic temporal reasoning, the main idea of which is the (circumscriptive) minimization of changes with respect to a set of facts declared “persistent by default”. The focus of the paper is on the relation between this approach and the update semantics recently proposed by Katsuno and Mendelzon. Our contribution in this regard is twofold:We prove a representation theorem for KM semantics in terms of a (...) restricted subfamily of the operators defined by our construction.We show how the KM semantics can be generalized by relaxing our construction in a number of ways, each justified in certain intuitive circumstances and each corresponding to one specific postulate. It follows that there are reasonable update operators outside the KM family.Our approach is not dependent for its plausibility on this connection with KM semantics. Rather, it provides a relatively rich and flexible framework in which the frame and ramification problems can be solved in a systematic way by reasoning about default persistence of facts. (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)

Traditional approaches in deontic logic have focused on the so-called reportative reading of obligation sentences, by providing truth-functional semantics based on a primitive ideality order between possible worlds. Those approaches, however, do not take into account that, in natural language, obligation sentences primarily carry a prescriptive effect. The paper focuses precisely on that prescriptive character, and shows that the reportative reading can be derived from the prescriptive one. A dynamic, non truth-functional semantics for necessity deontic modals is developed, (...) in which the ideality relations among possible worlds can be updated. Finally, it is proven that the semantics solves several of the classic deontic paradoxes. (shrink)

Weak ontic necessity is the ontic necessity expressed by “should/ought to” in English. An example of it is “I should be dead by now”. A feature of this necessity is that whether it holds at the present world is irrelevant to whether its prejacent holds at the present world. In this paper, by combining premise semantics and update semantics for conditionals, we present a logical theory for conditional weak ontic necessity based on context update. A context (...) is a set of ordered defaults, determining expected possible states of the present world. Sentences are evaluated with respect to contexts. When evaluating the conditional weak ontic necessity with respect to a context, we first update the context with the antecedent, then check whether the consequent holds with respect to the updated context. We compare this theory to some related works. The logic’s expressivity is studied. (shrink)

We look at two fundamental logical processes, often intertwined in planning and problem solving: inference and update. Inference is an internal process with which we uncover what is implicit in the information we already have. Update, on the other hand, is produced by external communication, usually in the form of announcements and in general in the form of observations, giving us information that might not have been available (even implicitly) before. Both processes have received attention from the logic (...) community, usually separately. In this work, we develop a logical language that allows us to describe them together. We present syntax, semantics and a complete axiom system; we discuss similarities and differences with other approaches and mention how the work can be extended. (shrink)

We present an approach to database update as a form of non monotonic temporal reasoning, the main idea of which is the (circumscriptive) minimization of changes with respect to a set of facts declared persistent by default. The focus of the paper is on the relation between this approach and the update semantics recently proposed by Katsuno and Mendelzon. Our contribution in this regard is twofold: • We prove a representation theorem for KM semantics in terms (...) of a restricted subfamily of the operators defined by our construction. • We show how the KM semantics can be generalized by relaxing our construction in a number of ways, each justified in certain intuitive circumstances and each corresponding to one specific postulate. It follows that there are reasonable update operators outside the KM family. • Our approach is not dependent for its plausibility on this connection with KM semantics. Rather, it provides a relatively rich and flexible framework in which the frame and ramification problems can be solved in a systematic way by reasoning about default persistence of facts. (shrink)

In this paper, we offer a novel analysis of presuppositions, paying particular attention to the interaction between the knowledge resources that are required to The analysis has two main features. First, we capture an analogy between presuppositions, anaphora and scope ambiguity (cf. van der Sandt 1992), by utilizing semantic under-specification (c£ Reyle 1993). Second, resolving this underspecification requires reasoning about how the presupposition is rhetorically connected to the discourse context. This has several consequences. First, since pragmatic information plays a role (...) in computing the rhetorical relation, it also constrains the interpretation of presuppositions. Our account therefore provides a formal framework for analysing problematic data, which require pragmatic reasoning. Second, binding presuppositions to the context via rhetorical links replaces accommodating them, in the sense of adding them to the context (cf. Lewis 1979). The treatment of presupposition is thus generalized and integrated into the discourse update procedure. We formalize this approach in SDRT (Asher 1993; Lascarides & Asher 1993), and demonstrate that it provides a rich framework for interpreting presuppositions, where semantic and pragmatic constraints are integrated. (shrink)

We investigate dynamic operations acting over a knowing how logic. Our approach makes use of a recently introduced semantics for the knowing how operator, based on an indistinguishability relation between plans. This semantics is arguably closer to the standard presentation of knowing that modalities in classic epistemic logic. Here, we discuss how the semantics enables us to define dynamic modalities representing different ways in which an agent can learn how to achieve a goal. In this regard, we (...) study two types of updates: ontic updates (for which we provide axiomatizations over a particular class of models), and epistemic updates (for which we investigate some semantic properties). (shrink)

In Constructing the World, Chalmers seeks to articulate and defend an important epistemic accessibility thesis, the Scrutability of Truth, which is crucial to Chalmers’ rationalist approach to meaning and modality. Chapters 3 and 4 of the book are devoted to persuading us that the move from weaker to stronger forms of Scrutability is intuitively plausible. In these comments, I want to question this move. The plausibility of strong forms of Scrutability hinges on controversial views about epistemic norms for answering ‘what (...) is x?’ questions that semantic externalists have good reason to reject. (shrink)

In this paper, I propose that the distinction between what is at-issue and what is not can be modeled as a distinction between two components of assertion. These two components affect the common ground in different ways. The at-issue component of an assertion, which is negotiable, is treated as a proposal to update the common ground. The not-at-issue component of an assertion, which is not negotiable, is added directly to the common ground. Evidence for this proposal comes from evidentials, (...) which I argue grammaticize this distinction. It has been observed that sentences with evidentials make both an ‘evidential’ and a ‘propositional’ contribution (Faller 2002, 2006, Matthewson et al. 2008). The evidential contribution is not directly challengeable or up for negotiation. In contrast, the propositional contribution, the ‘main point’ of the sentence, is directly challengeable and up for negotiation. I analyze these two contributions of evidentials as the not-at-issue component of assertion and the at-issue component of assertion, respectively. Supporting data comes from Cheyenne, a language with evidentials that are part of the illocutionary mood paradigm. (shrink)

In the present paper, we start studying epistemic updates using the standard toolkit of duality theory. We focus on public announcements, which are the simplest epistemic actions, and hence on Public Announcement Logic without the common knowledge operator. As is well known, the epistemic action of publicly announcing a given proposition is semantically represented as a transformation of the model encoding the current epistemic setup of the given agents; the given current model being replaced with its submodel relativized to the (...) announced proposition. We dually characterize the associated submodel-injection map as a certain pseudo-quotient map between the complex algebras respectively associated with the given model and with its relativized submodel. As is well known, these complex algebras are complete atomic BAOs . The dual characterization we provide naturally generalizes to much wider classes of algebras, which include, but are not limited to, arbitrary BAOs and arbitrary modal expansions of Heyting algebras . Thanks to this construction, the benefits and the wider scope of applications given by a point-free, intuitionistic theory of epistemic updates are made available. As an application of this dual characterization, we axiomatize the intuitionistic analogue of PAL, which we refer to as IPAL, prove soundness and completeness of IPAL w.r.t. both algebraic and relational models, and show that the well known Muddy Children Puzzle can be formalized in IPAL. (shrink)

The paper argues against a commitment to metaphysical necessity, semantic modalities are enough. The best approaches to elucidate the semantic modalities are (still) versions of lingustic ersatzism and fictionalism, even if only developed in parts. Within these necessary properties and the difference between natural and semantic laws can be accounted for. The proper background theory for this is an updated version of Logical Empiricism, which is congenial to recent trends in Structural Realism. The anti-metaphysical attitude of Logical Empiricism deserves revitalization. (...) Another target besides metaphysical necessity are substantial forms of iterated modalities, as used, for instance, in the philosophy of religion. (shrink)

The central claim of this paper is that surface-faithful word-by-word update is feasible and desirable, even in languages where word order is supposedly free. As a first step, in sections 1 and 2, I review an argument from Bittner 2001a that semantic composition is not a static process, as in PTQ, but rather a species of anaphoric bridging. But in that case the context-setting role of word order should extend from cross-sentential discourse anaphora to sentence-internal anaphoric composition. This can (...) be spelled out as a two-part hypothesis. First, in all languages anaphoric composition derives incremental updates based on the topological order rather than the syntactic hierarchy. And secondly, rigid vs. free word order is simply rigid vs. free mapping from syntax to topology. To formalize this hypothesis, I first present, in section 3, Sevensorted Logic of Change with Centering. This makes it possible, in section 4, to articulate a system of constraints on basic meanings in Kalaallisut — a polysynthetic language with free word order, ideally suited to test the hypothesis of incremental update. The key assumptions about topology as the input to anaphoric composition are spelled out in section 5, which concludes the development of a general formal framework. This formal framework then serves, in sections 6 through 8, t o explicate topologically based incremental updates for increasingly more complex samples of an actual Kalaallisut text. This reveals ubiquitous patterns of prominence-guided anaphora, in all semantic domains, t o increasingly more complex types of discourse referents. These anaphoric patterns show that the context-setting role of word order indeed does extend from discourse to word-to-word anaphora. And this, in turn, strongly supports the hypothesis of topologically based anaphoric composition. Finally, in section 9 I adduce evidence from English that this hypothesis also holds for languages with rigid word order, albeit the fixed mapping keeps the topology close to the syntax. I conclude that both free and rigid word orders receive a natural account if semantic composition is viewed as topologically based anaphoric bridging.. (shrink)

This practical coursebook introduces all the basics of semantics in a simple, step-by-step fashion. Each unit includes short sections of explanation with examples, followed by stimulating practice exercises to complete in the book. Feedback and comment sections follow each exercise to enable students to monitor their progress. No previous background in semantics is assumed, as students begin by discovering the value and fascination of the subject and then move through all key topics in the field, including sense and (...) reference, simple logic, word meaning and interpersonal meaning. New study guides and exercises have been added to the end of each unit to help reinforce and test learning. A completely new unit on non-literal language and metaphor, plus updates throughout the text significantly expand the scope of the original edition to bring it up-to-date with modern teaching of semantics for introductory courses in linguistics as well as intermediate students. (shrink)

At its most extreme, semantic holism is the doctrine that all the inferential properties of an expression constitute its meaning. Holism is supported by the consideration that there is no principled basis for localism's distinction among these properties. The paper rejects four arguments for this. The argument from confirmation holism is dismissed quickly because it rests on verificationism. The argument from the rejection of analyticity fails because it saddles the localist with unacceptable epistemic assumptions. Localism is not committed to a (...) priori knowledge or to knowledge that is in any interesting sense unrevisable. The argument from psychological explanation fails because it begs the question. The argument from functionalism needs to be accompanied by a further argument that functionalism is essentially holistic. In any case it could only establish a very mild holism. (shrink)

Fictional names pose a difficult puzzle for semantics. We can truthfully maintain that Frodo is a hobbit, while at the same time admitting that Frodo does not exist. To reconcile this paradox I propose a way to formalize the interpretation of fiction as ‘prescriptions to imagine’ (Walton 1990) within an asymmetric semantic framework in the style of Kamp (1990). In my proposal, fictional statements are analyzed as dynamic updates on an imagination component of the interpreter’s mental state, while plain (...) assertions are updates on a belief component. Proper names – regular, empty, or fictional – are uniformly analyzed as presupposition triggers. The possibility of different attitude components referentially depending on each other is what ultimately allows us to account for the central paradox mentioned above. (shrink)

Natural language contains simple lexical items for some but not all Boolean operators. English, for example, contains conjunction and, disjunction or, negated disjunction nor, but no word to express negated conjunction *nand nor any other Boolean connective. Natural language grammar can be described by a logic that expresses what the lexicon can express by its primitives, and the rest compositionally. Such logic for propositional connectives is described here as a bilateral extension of update semantics. The basic intuition is (...) that a context can be updated by assertion or by rejection, and by one or multiple propositions at once. These distinctions suffice to characterize the logic of the lexicon. (shrink)

Logical frameworks for analysing the dynamics ofinformation processing abound [4, 5, 8, 10, 12, 14, 20, 22]. Some of these frameworks focus on the dynamics of the interpretation process, some on the dynamics of the process of drawing inferences, and some do both of these. Formalisms galore, so it is felt that some conceptual streamlining would pay off. This paper is part of a larger scale enterprise to pursue the obvious parallel between information processing and imperative programming. We demonstrate that (...) logical tools from theoretical computer science are relevant for the logic of information flow. More specifically, we show that the perspective of bare logic [13, 18] can fruitfully be applied to the conceptual simplification of information flow logics. Part one of this program consisted of the analysis of 'dynamic interpretation' in this way, using the example of dynamic predicate logic [10]; the results were published in [7]. The present paper constitutes the second part of the program, the analysis of 'dynamic inference'. Here we focus on Veltman’s update logic [22]. Update logic is an example of a logical framework which takes the dynamics of drawing inferences into account by modelling information growth as discarding of possibilities. This paper shows how information logics like update logic can fruitfully be studied by linking their dynamic principles to static 'correctness descriptions'. Our theme is exemplified by providing a sound and complete HoarelPratt style deduction system for update logic. The Hoare/Pratt correctness statements use modal propositional dynamic logic as assertion language and connect update logic to the modal propositional logic S5. The connection with S5 provides a clear link between the dynamic and the static semantics of update logic. The fact that update logic is decidable was noted already in [2]; the connection with S5 provides an alternative proof. The S5 connection can also be used for rephrasing the validity notions of update logic and for performing consistency checks. In conclusion, it is argued that interpreting the dynamic statements of information logics as dynamic modal operators has much wider applicability. In fact, the method can be used to axiomatize quite a wide range of information logics. (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)

When communicating, people adapt their linguistic representations to those of their interlocutors. Previous studies have shown that this also occurs at the semantic level for vague and context-dependent terms such as quantifiers and uncertainty expressions. However, work to date has mostly focused on passive exposure to a given speaker's interpretation, without considering the possible role of active linguistic interaction. In this study, we focus on gradable adjectives big and small and develop a novel experimental paradigm that allows participants to ask (...) clarification questions to figure out their interlocutor's interpretation. We find that, when in doubt, speakers do resort to this strategy, despite its inherent cognitive cost, and that doing so results in higher semantic alignment measured in terms of communicative success. While not all question–answer pairs are equally informative, we show that speakers become better questioners as the interaction progresses. Yet, the higher semantic alignment observed when speakers are able to ask questions does not increase over time. This suggests that conversational interaction's key advantage may be to boost coordination without committing to long-term semantic updates. Our findings shed new light on the mechanisms used by speakers to achieve semantic alignment and on how language is shaped by communication. (shrink)

In their target article, Wang and Busemeyer (2013) discuss question order effects in terms of incompatible projectors on a Hilbert space. In a similar vein, Blutner recently presented an orthoalgebraic query language essentially relying on dynamic update semantics. Here, I shall comment on some interesting analogies between the different variants of dynamic semantics and generalized quantum theory to illustrate other kinds of order effects in human cognition, such as belief revision, the resolution of anaphors, and default reasoning (...) that result from the crucial non-commutativity of mental operations upon the belief state of a cognitive agent. (shrink)

In this paper we explore a class of belief update operators, in which the definition of the operator is compositional with respect to the sentence to be added. The goal is to provide an update operator that is intuitive, in that its definition is based on a recursive decomposition of the update sentence’s structure, and that may be reasonably implemented. In addressing update, we first provide a definition phrased in terms of the models of a knowledge (...) base. While this operator satisfies a core group of the benchmark Katsuno Mendelzon update postulates, not all of the postulates are satisfied. Other Katsuno Mendelzon postulates can be obtained by suitably restricting the syntactic form of the sentence for update, as we show. In restricting the syntactic form of the sentence for update, we also obtain a hierarchy of update operators with Winslett’s standard semantics as the most basic interesting approach captured. We subsequently give an algorithm which captures this approach; in the general case the algorithm is exponential, but with some not unreasonable assumptions we obtain an algorithm that is linear in the size of the knowledge base. Hence the resulting approach has much better complexity characteristics than other operators in some situations. We also explore other compositional belief change operators: erasure is developed as a dual operator to update; we show that a forget operator is definable in terms of update; and we give a definition of the compositional revision operator. We obtain that compositional revision, under the most natural definition, yields the Satoh revision operator. (shrink)

The current COVID-19 pandemic and the previous SARS/MERS outbreaks of 2003 and 2012 have resulted in a series of major global public health crises. We argue that in the interest of developing effective and safe vaccines and drugs and to better understand coronaviruses and associated disease mechenisms it is necessary to integrate the large and exponentially growing body of heterogeneous coronavirus data. Ontologies play an important role in standard-based knowledge and data representation, integration, sharing, and analysis. Accordingly, we initiated the (...) development of the community-based Coronavirus Infectious Disease Ontology in early 2020. -/- As an Open Biomedical Ontology (OBO) library ontology, CIDO is open source and interoperable with other existing OBO ontologies. CIDO is aligned with the Basic Formal Ontology and Viral Infectious Disease Ontology. CIDO has imported terms from over 30 OBO ontologies. For example, CIDO imports all SARS-CoV-2 protein terms from the Protein Ontology, COVID-19-related phenotype terms from the Human Phenotype Ontology, and over 100 COVID-19 terms for vaccines (both authorized and in clinical trial) from the Vaccine Ontology. CIDO systematically represents variants of SARS-CoV-2 viruses and over 300 amino acid substitutions therein, along with over 300 diagnostic kits and methods. CIDO also describes hundreds of host-coronavirus protein-protein interactions (PPIs) and the drugs that target proteins in these PPIs. CIDO has been used to model COVID-19 related phenomena in areas such as epidemiology. The scope of CIDO was evaluated by visual analysis supported by a summarization network method. CIDO has been used in various applications such as term standardization, inference, natural language processing (NLP) and clinical data integration. We have applied the amino acid variant knowledge present in CIDO to analyze differences between SARS-CoV-2 Delta and Omicron variants. CIDO's integrative host-coronavirus PPIs and drug-target knowledge has also been used to support drug repurposing for COVID-19 treatment. -/- CIDO represents entities and relations in the domain of coronavirus diseases with a special focus on COVID-19. It supports shared knowledge representation, data and metadata standardization and integration, and has been used in a range of applications. (shrink)

Deictic (or pointing) gestures are traditionally known to have a simple function: to supply something as the referent of a demonstrative linguistic expression. I argue that deixis can have a more complex function. A deictic gesture can be used to _say something_ in conversation and can thereby become a full discourse move in its own right. To capture this phenomenon, which I call _rich demonstration_, I present an update semantics on which deictic gestures can indicate situations from a (...) conversation’s context and those situations coherently connect to prior discourse to generate information. (shrink)