Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. Technically, InqML fits within the family of logics based on team semantics. From a model-theoretic perspective, it takes us a step in the direction of monadic second-order logic, as inquisitive modal operators involve quantification over sets of worlds. We introduce and investigate (...) the natural notion of bisimulation equivalence in the setting of InqML. We compare the expressiveness of InqML and first-order logic in the context of relational structures with two sorts, one for worlds and one for information states, and characterise inquisitive modal logic as the bisimulation invariant fragment of first-order logic over various natural classes of two-sorted structures. (shrink)

Natural language provides motivation for studying modal backwards-looking operators such as “now”, “then” and “actually” that evaluate their argument formula at some previously considered point instead of the current one. This paper investigates the expressive power over models of both propositional and first-order basic modal language enriched with such operators. Having defined an appropriate notion of bisimulation for first-order modal logic, I show that backwards-looking operators increase its expressive power quite mildly, contrary to beliefs widespread among philosophers of language (...) and formal semanticists. That in turn presents a strong argument for the use of operator-based systems in the semantics of natural language, instead of systems with explicit quantification over worlds and times that have become a de-facto standard for such applications. The popularity of such explicit-quantification systems is shown to be based on the misinterpretation of a claim by Cresswell, which led many philosophers and linguists to assume that introducing “now” and “then” is expressively equivalent to explicitly quantifying over worlds and times. (shrink)

Given the frequency of human error, it seems rational to believe that some of our own rational beliefs are false. This is the axiom of epistemic modesty. Unfortunately, using standard propositional quantification, and the usual relational semantics, this axiom is semantically inconsistent with a common logic for rational belief, namely KD45. Here we explore two alternative semantics for KD45 and the axiom of epistemic modesty. The first uses the usual relational semantics and bisimulation quantifiers. The second uses a topological (...) semantics and standard propositional quantification. We show the two different semantics validate many of the same formulas, though we do not know whether they validate exactly the same formulas. Along the way we address various philosophical concerns. (shrink)

We discuss the interpolation property on some important families of non classical logics, such as intuitionistic, modal, fuzzy, and linear logics. A special paragraph is devoted to a generalization of the interpolation property, uniform interpolation.

We investigate the modal logic of stepwise removal of objects, both for its intrinsic interest as a logic of quantification without replacement, and as a pilot study to better understand the complexity jumps between dynamic epistemic logics of model transformations and logics of freely chosen graph changes that get registered in a growing memory. After introducing this logic (MLSR) and its corresponding removal modality, we analyze its expressive power and prove a bisimulation characterization theorem. We then provide a complete (...) Hillbert-style axiomatization for the logic of stepwise removal in a hybrid language enriched with nominals and public announcement operators. Next, we show that model-checking for MLSR is PSPACE-complete, while its satisfiability problem is undecidable. Lastly, we consider an issue of fine-structure: the expressive power gained by adding the stepwise removal modality to fragments of first-order logic. (shrink)

We propose a new perspective on logics of computation by combining instantial neighborhood logic \ with bisimulation safe operations adapted from \. \ is a recent modal logic, based on an extended neighborhood semantics which permits quantification over individual neighborhoods plus their contents. This system has a natural interpretation as a logic of computation in open systems. Motivated by this interpretation, we show that a number of familiar program constructors can be adapted to instantial neighborhood semantics to preserve invariance (...) for instantial neighborhood bisimulations, the appropriate bisimulation concept for \. We also prove that our extended logic \ is a conservative extension of dual-free game logic, and its semantics generalizes the monotone neighborhood semantics of game logic. Finally, we provide a sound and complete system of axioms for \, and establish its finite model property and decidability. (shrink)

Analogues of Scott's isomorphism theorem, Karp's theorem as well as results on lack of compactness and strong completeness are established for infinitary propositional relevant logics. An "interpolation theorem" for the infinitary quantificational boolean logic L-infinity omega. holds. This yields a preservation result characterizing the expressive power of infinitary relevant languages with absurdity using the model-theoretic relation of relevant directed bisimulation as well as a Beth definability property.

We propose a new perspective on logics of computation by combining instantial neighborhood logic INL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {INL}$$\end{document} with bisimulation safe operations adapted from PDL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {PDL}$$\end{document}. INL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {INL}$$\end{document} is a recent modal logic, based on an extended neighborhood semantics which permits quantification over individual neighborhoods plus their contents. This system has a natural interpretation as (...) a logic of computation in open systems. Motivated by this interpretation, we show that a number of familiar program constructors can be adapted to instantial neighborhood semantics to preserve invariance for instantial neighborhood bisimulations, the appropriate bisimulation concept for INL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {INL}$$\end{document}. We also prove that our extended logic IPDL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {IPDL}$$\end{document} is a conservative extension of dual-free game logic, and its semantics generalizes the monotone neighborhood semantics of game logic. Finally, we provide a sound and complete system of axioms for IPDL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {IPDL}$$\end{document}, and establish its finite model property and decidability. (shrink)

In large anonymous games, payoffs are determined by strategy distributions rather than strategy profiles. If half the players choose a strategy a, all of them get a certain payoff, whereas if only one-third of the players choose that strategy, the players choosing may get a different payoff. Strategizing in such a game by a player involves reasoning about not who does what but what fraction of the population makes the same choice as that player.We present a simple modal logic to (...) reason about such strategization in large games. Since actual numbers are irrelevant, a player need not even know how many others are in the game, thus leading to the consideration of games with unboundedly many players. The logic we consider is the propositional modal fragment of a first order modal logic. We show that it has a bounded agent property, giving us a decision procedure for satisfiability. We also present a complete axiomatization of the valid formulas. The logic admits a natural model checking algorithm and bisimulation characterization. The logic with quantification over players is more appropriate, but is undecidable. (shrink)

This essay aims to provide a modal logic for rational intuition. Similarly to treatments of the property of knowledge in epistemic logic, I argue that rational intuition can be codified by a modal operator governed by the modal $\mu$-calculus. Via correspondence results between fixed point modal propositional logic and the bisimulation-invariant fragment of monadic second-order logic, a precise translation can then be provided between the notion of 'intuition-of', i.e., the cognitive phenomenal properties of thoughts, and the modal operators regimenting (...) the notion of 'intuition-that'. I argue that intuition-that can further be shown to entrain conceptual elucidation, by way of figuring as a dynamic-interpretational modality which induces the reinterpretation of both domains of quantification and the intensions and hyperintensions of mathematical concepts that are formalizable in monadic first- and second-order formal languages. Hyperintensionality is countenanced via a topic-sensitive epistemic two-dimensional truthmaker semantics. (shrink)

A traditional aspect of model theory has been the interplay between formal languages and mathematical structures. This dissertation is concerned, in particular, with the relationship between the languages of relevant logic and Routley-Meyer models. One fundamental question is treated: what is the expressive power of relevant languages in the Routley-Meyer framework? In the case of finitary relevant propositional languages, two answers are provided. The first is that finitary propositional relevant languages are the fragments of first order logic preserved under relevant (...) directed bisimulations. The second is that, when we restrict our attention to what can be labelled as De Morgan models, we can obtain an analogue of Lindström's theorem for finitary propositional relevant languages. Furthermore, it is shown that a preservation theorem characterizing the expressive power of infinitary relevant languages in classical infinitary languages follows as a consequence of an interpolation theorem for classical infinitary logic. In addition, algebraic characterizations of the classes of Routley-Meyer models axiomatizable in relevant propositional languages, incompactness of infinitary relevant propositional languages and the expressive power of quantificational relevant languages are discussed. A final chapter is devoted to the study of relevant languages as second order frame languages. In particular we devote our attention to the problem of which properties expressible by relevant languages are elementary and which are not. An algebraic characterization of such elementary properties together with some examples of non first order properties axiomatizable in relevant logic are given. Finally, a Sahlqvist-van Benthem algorithm showing that relevant formulas with a certain syntactic form express calculable first order properties at the level of frames is established. (shrink)

As a new type of epistemic logics, the logics of knowing how capture the high-level epistemic reasoning about the knowledge of various plans to achieve certain goals. Existing work on these logics focuses on axiomatizations; this paper makes the first study of their model theoretical properties. It does so by introducing suitable notions of bisimulation for a family of five knowing how logics based on different notions of plans. As an application, we study and compare the expressive power of (...) these logics. (shrink)

We define bisimulations for temporal logic with Since and Until. This new notion is compared to existing notions of bisimulations, and then used to develop the basic model theory of temporal logic with Since and Until. Our results concern both invariance and definability. We conclude with a brief discussion of the wider applicability of our ideas.

Ordinary English contains different forms of quantification over objects. In addition to the usual singular quantification, as in 'There is an apple on the table', there is plural quantification, as in 'There are some apples on the table'. Ever since Frege, formal logic has favored the two singular quantifiers ∀x and ∃x over their plural counterparts ∀xx and ∃xx (to be read as for any things xx and there are some things xx). But in recent decades it has been argued (...) that we have good reason to admit among our primitive logical notions also the plural quantifiers ∀xx and ∃xx. More controversially, it has been argued that the resulting formal system with plural as well as singular quantification qualifies as ‘pure logic’; in particular, that it is universally applicable, ontologically innocent, and perfectly well understood. In addition to being interesting in its own right, this thesis will, if correct, make plural quantification available as an innocent but extremely powerful tool in metaphysics, philosophy of mathematics, and philosophical logic. For instance, George Boolos has used plural quantification to interpret monadic second-order logic and has argued on this basis that monadic second-order logic qualifies as “pure logic.” Plural quantification has also been used in attempts to defend logicist ideas, to account for set theory, and to eliminate ontological commitments to mathematical objects and complex objects. (shrink)

Interpretability logic is a modal formalization of relative interpretability between first‐order arithmetical theories. Verbrugge semantics is a generalization of Veltman semantics, the basic semantics for interpretability logic. Bisimulation is the basic equivalence between models for modal logic. We study various notions of bisimulation between Verbrugge models and develop a new one, which we call w‐bisimulation. We show that the new notion, while keeping the basic property that bisimilarity implies modal equivalence, is weak enough to allow the converse (...) to hold in the finitary case. To do this, we develop and use an appropriate notion of bisimulation games between Verbrugge models. (shrink)

We give a definition of bisimulation for conditional modalities interpreted on selection functions and prove the correspondence between bisimilarity and modal equivalence, generalizing the Hennessy–Milner Theorem to a wide class of conditional operators. We further investigate the operators and semantics to which these results apply. First, we show how to derive a solid notion of bisimulation for conditional belief, behaving as desired both on plausibility models and on evidence models. These novel definitions of bisimulations are exploited in a (...) series of undefinability results. Second, we treat relativized common knowledge, underlining how the same results still hold for a different modality in a different semantics. Third, we show the flexibility of the approach by generalizing it to multi-agent systems, encompassing the case of multi-agent plausibility models. (shrink)

We prove that every first-order formula that is invariant under quasi-injective bisimulations is equivalent to a formula of the hybrid logic . Our proof uses a variation of the usual unravelling technique. We also briefly survey related results, and show in a standard way that it is undecidable whether a first-order formula is invariant under quasi-injective bisimulations.

Semantic interpretations of both natural and formal languages are usually taken to involve the specification of a domain of entities with respect to which the sentences of the language are to be evaluated. A question that has received much attention of late is whether there is unrestricted quantification, quantification over a domain comprising absolutely everything there is. Is there a discourse or inquiry that has absolute generality? After framing the debate, this article provides an overview of the main arguments for (...) and against the possibility of unrestricted quantification, highlighting some of the broader implications of the debate. (shrink)

Plausibility models are Kripke models that agents use to reason about knowledge and belief, both of themselves and of each other. Such models are used to interpret the notions of conditional belief, degrees of belief, and safe belief. The logic of conditional belief contains that modality and also the knowledge modality, and similarly for the logic of degrees of belief and the logic of safe belief. With respect to these logics, plausibility models may contain too much information. A proper notion (...) of bisimulation is required that characterises them. We define that notion of bisimulation and prove the required characterisations: on the class of image-finite and preimage-finite models, two pointed Kripke models are modally equivalent in either of the three logics, if and only if they are bisimilar. As a result, the information content of such a model can be similarly expressed in the logic of conditional belief, or the logic of degrees of belief, or that of safe belief. This, we found a surprising result. Still, that does not mean that the logics are equally expressive: the logics of conditional and degrees of belief are incomparable, the logics of degrees of belief and safe belief are incomparable, while the logic of safe belief is more expressive than the logic of conditional belief. In view of the result on bisimulation characterisation, this is an equally surprising result. We hope our insights may contribute to the growing community of formal epistemology and on the relation between qualitative and quantitative modelling. (shrink)

We investigate whether ordinary quantification over objects is an extensional phenomenon, or rather creates non-extensional contexts; each claim having been propounded by prominent philosophers. It turns out that the question only makes sense relative to a background theory of syntax and semantics (here called a grammar) that goes well beyond the inductive definition of formulas and the recursive definition of satisfaction. Two schemas for building quantificational grammars are developed, one that invariably constructs extensional grammars (in which quantification, in particular, thus (...) behaves extensionally) and another that only generates non-extensional grammars (and in which quantification is responsible for the failure of extensionality). We then ask whether there are reasons to favor one of these grammar schemas over the other, and examine an argument according to which the proper formalization of deictic utterances requires adoption of non-extensional grammars. (shrink)

This article addresses nominal quantification in English in relation to discrete and continuous quantity, the two semantic categories of discrete and continuous / mass being analysed as interpretations of syntax. It re-examines the hypothesis of non-quantifiable continuous nouns as well as some theoretical questions such as overloaded definitions, unexploited oppositions or notions found without an explicit definition, as is sometimes the case with the concept of collective. The study then proceeds to examine semantic multiplicity in connection with grammatical number. Plural (...) is examined in association with numerals and fuzzy quantifiers. The singular category also also yields interpretations of multiplicity, whether with mass-nouns or with discrete collective nouns. This, together with the possible conversion of the latter into mass-nouns, draws one’s attention to a mode of reference shared by mass nouns and collective discrete nouns. (shrink)

Plausibility models are Kripke models that agents use to reason about knowledge and belief, both of themselves and of each other. Such models are used to interpret the notions of conditional belief, degrees of belief, and safe belief. The logic of conditional belief contains that modality and also the knowledge modality, and similarly for the logic of degrees of belief and the logic of safe belief. With respect to these logics, plausibility models may contain too much information. A proper notion (...) of bisimulation is required that characterises them. We define that notion of bisimulation and prove the required characterisations: on the class of image-finite and preimage-finite models, two pointed Kripke models are modally equivalent in either of the three logics, if and only if they are bisimilar. As a result, the information content of such a model can be similarly expressed in the logic of conditional belief, or the logic of degrees of belief, or that of safe belief. This, we found a surprising result. Still, that does not mean that the logics are equally expressive: the logics of conditional and degrees of belief are incomparable, the logics of degrees of belief and safe belief are incomparable, while the logic of safe belief is more expressive than the logic of conditional belief. In view of the result on bisimulation characterisation, this is an equally surprising result. We hope our insights may contribute to the growing community of formal epistemology and on the relation between qualitative and quantitative modelling. (shrink)

A modal accessibility relation is just a transition relation, and so can be represented by a {0, 1} valued transition matrix. Starting from this observation, I first show that the machinery of matrices, over Boolean algebras more general than the two-valued one, is appropriate for investigating multi-modal semantics. Then I show that bisimulations have a rather elegant theory, when expressed in terms of transformations on Boolean vector spaces. The resulting theory is a curious hybrid, fitting between conventional modal semantics and (...) conventional linear algebra. I don’t know where the investigations begun here will ultimately wind up, but in the meantime the approach has a kind of curious charm that others may find appealing. (shrink)

are considered with a view toward analyzing operational semantics from the perspective of predicate logic. The notion of a bisimulation is employed in two distinct ways: (i) as an extensional notion of equivalence on programs (or processes) generalizing input/output equivalence (at a cost exceeding II' ,over certain transition predicates computable in log space). and (ii) as a tool for analyzing the dependence of transitions on data (which can be shown to be elementary or nonelementary. depending on the formulation of (...) the transitions). (shrink)

Providing a compositional interpretation procedure for discourses in which descriptions of complex dependencies between interrelated objects are incrementally built is a key challenge for formal theories of natural language interpretation. This paper examines several quantificational phenomena and argues that to account for these phenomena, we need richly structured contexts of interpretation that are passed on between different parts of the same sentence and also across sentential boundaries. The main contribution of the paper is showing how we can add structure to (...) contexts in an incremental way, starting with the basic notion of context in classical first-order logic, i.e., interpretation contexts formalized as single total variable assignments. (shrink)

This extended collection of papers is the result of putting recent ideas on quantification to work on a wide variety of languages.

Connectionist attention to variables has been too restricted in two ways. First, it has not exploited certain ways of doing without variables in the symbolic arena. One variable-avoidance method, that of logical combinators, is particularly well established there. Secondly, the attention has been largely restricted to variables in long-term rules embodied in connection weight patterns. However, short-lived bodies of information, such as sentence interpretations or inference products, may involve quantification. Therefore short-lived activation patterns may need to achieve the effect of (...) variables. The paper is mainly a theoretical analysis of some benefits and drawbacks of using logical combinators to avoid variables in short-lived connectionist encodings without loss of expressive power. The paper also includes a brief survey of some possible methods for avoiding variables other than by using combinators. (shrink)

Semantic theories based on a hierarchy of types have prominently been used to defend the possibility of unrestricted quantification. However, they also pose a prima facie problem for it: each quantifier ranges over at most one level of the hierarchy and is therefore not unrestricted. It is difficult to evaluate this problem without a principled account of what it is for a quantifier to be unrestricted. Drawing on an insight of Russell’s about the relationship between quantification and the structure of (...) predication, we offer such an account. We use this account to examine the problem in three different type-theoretic settings, which are increasingly permissive with respect to predication. We conclude that unrestricted quantification is available in all but the most permissive kind of type theory. (shrink)

Model evaluation for long-term climate predictions must be done on quantities other than the actual prediction, and a comprehensive uncertainty quantificationUncertainty quantification is impossible. An ad hoc alternative is provided by coordinated model intercomparisonsModel intercomparisons which typically use a “one model one vote” approach. The problem with such an approach is that it treats all models as independent and equally plausible. Reweighting all models of the ensemble for performance and dependence seems like an obvious way to improve on model democracy, (...) yet there are open questions on what constitutes a “good” model, how to define dependency, how to interpret robustnessRobustness, and how to incorporate background knowledgeBackground knowledge. UnderstandingUnderstanding those issues have the potential to increase confidence in model predictions in modeling efforts outside of climate scienceClimate science where similar challenges exist. (shrink)

The Philosophical Review, Vol. XCVI, No. 4 (October 1987). Categorically proves that Leibniz's Law (the principle that any instance of _for any x and y, if x=y, then if ...x..., then ..y..._ is true) is not a principle of which is true of natural language objectual quantification.

The literature contains a popular argument in favor of the position that conditional attitudes are not simple attitudes with conditional contents but, rather, have a more complex structure. In this paper I show that an analogous argument applies to what we might call quantificational attitudes—like an intention to follow every bit of good advice I receive or a desire to get rabies shots for each bite I incur from an infected bat. The conditions under which these attitudes are satisfied and (...) thwarted are not captured by claiming that they are simple attitudes with quantificational contents. So, the argument supports a novel position—that quantificational attitudes have a more complex structure. After sketching the form of this extra structure, I show how similar considerations count in favor of the existence of genuinely quantificational speech acts. (shrink)

This edited volume explores the intersection of medicine and philosophy throughout history, calling attention to the role of quantification in understanding the medical body. Retracing current trends and debates to examine the quantification of the body throughout the early modern, modern and early contemporary age, the authors contextualise important issues of both medical and philosophical significance, with chapters focusing on the quantification of temperaments and fluids, complexions, functions of the living body, embryology, and the impact of quantified reasoning on the (...) concepts of health and illness. With insights spanning from the sixteenth century to the nineteenth century, this book provides a wide-ranging overview of attempts to ‘quantify’ the human body at various points. Arguing that medicine and philosophy have been constantly in dialogue with each other, the authors discuss how this provided a strategic opportunity both for medical thought and philosophy to refine and further develop. Given today’s fascination with the quantification of the body, represented by the growing profusion of self-tracking devices logging one’s sleep, diet or mood, this collection offers an important and timely contribution to an emerging and interdisciplinary field of study. -/- . (shrink)

We develop a variant of Least Fixed Point logic based on First Orderlogic with a relaxed version of guarded quantification. We develop aGame Theoretic Semantics of this logic, and find that under reasonableconditions, guarding quantification does not reduce the expressibilityof Least Fixed Point logic. But we also find that the guarded version ofa least fixed point algorithm may have a greater time complexity thanthe unguarded version, by a linear factor.

The question whether natural language permits quantification over intentional objects as the ‘nonexistent’ objects of thought is the topic of a major philosophical controversy, as is the status of intentional objects as such. This paper will argue that natural language does reflect a particular notion of intentional object and in particular that certain types of natural language constructions (generally disregarded in the philosophical literature) cannot be analysed without positing intentional objects. At the same time, those intentional objects do not come (...) for free; rather they are strictly dependent on intentional acts that generally need to have a presence, in one way or another, in the semantic structure of the sentence. (shrink)

Standard first-order logic plus quantifiers of all finite orders ("SFOLω") faces four well-known difficulties when used to characterize the behavior of certain English quantifier phrases. All four difficulties seem to stem from the typed structure of SFOLω models. The typed structure of SFOLω models is in turn a product of an asymmetry between the meaning of names and the meaning of predicates, the element-set asymmetry. In this paper we examine a class of models in which this asymmetry of meaning is (...) removed. The models of this class permit definitions of the quantifiers which allow a desirable flexibility in fixing the domain of quantification. Certain SFOLω type restrictions are thereby avoided. The resulting models of English validate all of the standard first-order logical truths and are free of the four deficiencies of SFOLω models. (shrink)

Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational logic, the categoricity (...) problem is generated by the finite nature of the standard calculi and one direction in which it can be solved is to strengthen the deductive systems by adding infinitary rules (such as the ω-rule), i.e., to construct a full formalization. Another main direction is to provide a natural semantics for the standard rules of inference, i.e., a semantics for which these rules are categorical. My aim in this paper is to analyze some recent approaches for solving the categoricity problem and to argue that a logical inferentialist should accept the infinitary rules of inference for the first order quantifiers, since our use of the expressions “all” and “there is” leads us beyond the concrete and finite reasoning, and human beings do sometimes employ infinitary rules of inference in their reasoning. (shrink)

Illustrates the prevalence of implicit quantification in deontic assertions in ordinary language.

When multiple individuals interact in a conversation or as part of a large crowd, emergent structures and dynamics arise that are behavioral properties of the interacting group rather than of any individual member of that group. Recent work using traditional signal processing techniques and machine learning has demonstrated that global acoustic data recorded from a crowd at a basketball game can be used to classify emergent crowd behavior in terms of the crowd's purported emotional state. We propose that the description (...) of crowd behavior from such global acoustic data could benefit from nonlinear analysis methods derived from dynamical systems theory. Such methods have been used in recent research applying nonlinear methods to audio data extracted from music and group musical interactions. In this work, we used nonlinear analyses to extract features that are relevant to the behavioral interactions that underlie acoustic signals produced by a crowd attending a sporting event. We propose that recurrence dynamics measured from these audio signals via recurrence quantification analysis (RQA) reflect information about the behavioral dynamics of the crowd itself. We analyze these dynamics from acoustic signals recorded from crowds attending basketball games, and that were manually labeled according to the crowds' emotional state across six categories: angry noise, applause, cheer, distraction noise, positive chant, and negative chant. We show that RQA measures are useful to differentiate the emergent acoustic behavioral dynamics between these categories, and can provide insight into the recurrence patterns that underlie crowd interactions. (shrink)

Interpretability logic is an extension of provability logic. Veltman models and generalized Veltman models are two semantics for interpretability logic. We consider a connection between Veltman semantics and generalized Veltman semantics. We prove that for a complete image-finite generalized Veltman modelW there is a Veltman model W ′ that is bisimular to W.

The existential and universal quantifiers in Japanese both consist of two morphemes: an indeterminate pronoun and a quantificational suffix. This paper examines the distributional characteristics of these suffixes (ka for the existential quantifier and mo for the universal quantifier). It is shown that ka can appear in a wider range of structural positions than mo can. This difference receives explanation on semantic grounds. I propose that mo is a generalized quantifier. More specifically, I assume that the phrase headed by mo (...) is of type ${\langle\langle\alpha, t\rangle, t}$ . Because of its type, mo cannot appear in certain structural positions without causing type mismatch. Ka, on the other hand, is a choice function variable of type ${\langle\alpha/t, \alpha\rangle}$ , and due to its type, its distribution is not as restricted. One of the consequences of this analysis is that there are no quantifier raising or type shifting operations in Japanese that would adequately obviate type mismatch. (shrink)

Special quantifiers are quantifiers like 'something', 'everything', and 'several things'. They are special both semantically and syntactically and play quite an important role in philosophy, in discussions of ontological commitment to abstract objects, of higher-order metaphysics, and of the apparent need for propositions. This paper will review and discuss in detail the syntactic and semantic peculiarities of special quantifiers and show that they are incompatible with substitutional and higher-order analyses that have recently been proposed. It instead defends and develops in (...) formal detail a semantic analysis of special quantifiers as nominalizing quantifiers. On this analysis, special quantifiers involve both singular objectual quantification and implicit on non-singular (higher-order, plural, or mass) quantification. The analysis rests on a range of recent insights and proposals in generative syntactic theory, in particular the recognition of '–thing' as a light noun and a potential classifier as well as recent views of the decomposition of attitudinal and locutionary verbs in syntax. (shrink)

In addition to full beliefs, agents have attitudes of varying confidence, or credences. For instance, I do not believe that the Boston Red Sox will win the American League East this year, but I am at least a little bit confident that they will – i.e. I have a positive credence that they will. It is also common to think that agents have conditional credences. For instance, I am very confident – i.e. have a conditional credence of very-likely strength – (...) that the Red Sox will win the AL East this year given that their pitching staff stays healthy. There are good reasons to think that conditional credences are neither credences nor some combination of credences. In this paper, I show that similar reasons support thinking that agents have what we can call quantificational credences – attitudes like, thinking that each AL East team with a healthy pitching staff is at least a little bit likely to win the division – which are neither credences, conditional credences, nor some combination thereof. I provide a framework for assessing the rationality of credal states which involve quantificational credences. And I give a general picture of credal states that explains the similarities and differences between ordinary, conditional, and quantificational credences. (shrink)