Several extensions of the basic modal language are characterized in terms of interpolation. Our main results are of the following form: Language ℒ' is the least expressive extension of ℒ with interpolation. For instance, let ℳ be the extension of the basic modal language with a difference operator [7]. First-order logic is the least expressive extension of ℳ with interpolation. These characterizations are subsequently used to derive new results about hybrid logic, relation algebra and the guarded fragment.

This paper deals with two main topics: One is a semantical investigation for a bimodal language with a modal operator \blacksquare associated with the intersection of the accessibility relation R and the inequality ≠. The other is a generalization of some of the former results to general extended languages with modal operators. First, for our language L\sb{\square\blacksquare}, we prove that Segerberg's theorem (equivalence between finite frame property and finite model property) fails and establish both van Benthem-style (...) and Goldblatt-Thomason-style characterizations. We extract the notion of \blacksquare-realizer (a generalization of bulldozing) as an essence from the proofs of our results. Second, we generalize the notion of \blacksquare-realizer and prove quite general versions of these semantical characterization results. The known and previously unknown characterization results for almost all of the languages extended with modal operators already proposed will be immediate corollaries. (shrink)

The paper deals with polymodal languages combined with standard semantics defined by means of some conditions on the frames. So, a notion of "polymodal base" arises which provides various enrichments of the classical modal language. One of these enrichments, viz. the base £(R,-R), with modalities over a relation and over its complement, is the paper's main paradigm. The modal definability (in the spirit of van Benthem's correspondence theory) of arbitrary and ~-elementary classes of frames in this base (...) and in some of its extensions, e.g., £(R,-R,R-1 ,_R-1), £(R,-R,=I=) etc., is described, and numerous examples of conditions definable there, as well as undefinable ones, are adduced. (shrink)

It has been argued within some philosophy of quantum gravity circles that endorsing Lewisian modal metaphysics is incompatible with endorsing the fundamental physical ontology of any quantum gravity theory. Speaking concisely, the unsolvable tension would be between Lewis' metaphysical commitment to the fundamentality of space and time, and the physical lesson of quantum gravity about the disappearance of space and time from the fundamental structure of the world. In this essay I argue against the idea that the tension is (...) unsolvable. The analysis does not apply to quantum gravity in general, but only to the specific perspective delivered by quantum string theory. In the first two sections I describe what I think is the general formal payoff of Lewisian possible worlds semantics, and more importantly the general metaphysical payoff generated by some Lewisian metaphysical applications of that formal framework. Lewisian possible worlds semantics is not among the topics of this essay, still a concise presentation of its basic features is required for a more accurate description of the type of modal metaphysics Lewis delivers by applying that formal machinery. The moral of the story in the first two sections is that an attempt of preserving crucial features of Lewisian modal metaphysics, although endorsing the quantum string theory lesson on spacetime non fundamentality, would be not only possible, but also philosophically worthy in a general sense. Then, section three is divided in three parts. In the first part I summarize some formal tools of the methodology used elsewhere - (Vistarini, Routledge, 2019, chapter 6)- to argue for string theory background independence. More precisely, I briefly re-describe some crucial features of a topological-vector bundle structure there defined on a "space" associated to the theory. Such structure is there shown to carry physical and dynamical information about quantum strings systems supporting the thesis of background independence of quantum strings laws (string theory background independence is not a topic of this essay, and the construction of the full formal structure as well as the full argumentative line can be found in the work cited above). The rationale behind the choice of including these formal tools is explained in the second and third parts of section three: that very same topological-fiber bundle structure associated to string theory, if read differently, is shown to also carry structural properties of the Lewisian metaphysical scheme. More precisely, in the second part of section three I attempt to show that such topological-fiber bundle structure owns a topology which qualifies as a plausible accessibility structure extending the Lewisian similarity accessibility. To avoid confusion, I will denote the extended similarity order with S*, or S*-similarity. The latter has some interesting properties. It is quantitatively describable, and even more interestingly its spectrum of variation is a countable one. Then, insofar Lewisian similarity order can be regained from the S*-similarity, one might say that the latter is a metaphysical accessibility relation underlying the former because "more fundamental". As we will see, the explanation of what "more fundamental" means in this metaphysical context mainly involves the idea that the formal nature of S*-similarity, in particular its property of having a countable spectrum of variation, calibrates a metaphysical similarity that reflects the discreteness of the fundamental quantum nature of reality. The extended modal metaphysics with accessibility structure S*-similarity is informed by quantum string physics. Within the extended scheme, the Lewisian claim "things could have been different in countless ways" (Lewis 1973) is an approximate one because only permitted by ordinary language. As soon as one refines the accessibility structure by using the formal language of quantum string theory, it appears things could have been different in countable ways. But the Lewisian variety of alternative states of affairs can be regained from the underlying countable variety via a specific interpretation of the Humean supervenience thesis, one that changes the metaphysical status of the thesis' content and restricts the thesis' domain of application. Finally, in the third part of section three I attempt to show that the same topological-fiber bundle structure used to extend Lewisian similarity has a bundle component producing the formal scheme for a tentative extension of Lewisian nomological accessibility through the lens of string dualities. This will prove to be a non trivial task, and the Lewisian accessibility structure will be regained from the extended one only partially. Finally, the essay contains two short appendices summarizing two argumentative lines outside the main topic of the essay. They briefly describe different ways in which the non fundamentality of spatiotemporal structures can be found in quantum string theory. These sections can be skipped. Nevertheless, they might contribute to understand more robustly the general view endorsed by this essay, i.e. that there isn't any unsolvable tension between Lewis' commitment to the fundamentality of spatiotemporal relations and quantum gravity's lesson about their non fundamentality. -/- . (shrink)

In this study, we introduce Gentzen-type sequent calculi BDm and BDi for a modal extension and an intuitionistic modification, respectively, of De and Omori’s extended Belnap–Dunn logic BD+ with classical negation. We prove theorems for syntactically and semantically embedding BDm and BDi into Gentzen-type sequent calculi S4 and LJ for normal modal logic and intuitionistic logic, respectively. The cut-elimination, decidability, and completeness theorems for BDm and BDi are obtained using these embedding theorems. Moreover, we prove the Glivenko (...) theorem for embedding BD+ into BDi and the McKinsey–Tarski theorem for embedding BDi into BDm. (shrink)

This paper is devoted to present Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) method for multi-attribute group decision making under rough neutrosophic environment. The concept of rough neutrosophic set is a powerful mathematical tool to deal with uncertainty, indeterminacy and inconsistency. In this paper, a new approach for multi-attribute group decision making problems is proposed by extending the TOPSIS method under rough neutrosophic environment. Rough neutrosophic set is characterized by the upper and lower approximation operators and the (...) pair of neutrosophic sets that are characterized by truth-membership degree, indeterminacy membership degree, and falsity membership degree. In the decision situation, ratings of alternatives with respect to each attribute are characterized by rough neutrosophic sets that reflect the decision makers’ opinion. Rough neutrosophic weighted averaging operator has been used to aggregate the individual decision maker’s opinion into group opinion for rating the importance of attributes and alternatives. Finally, a numerical example has been provided to demonstrate the applicability and effectiveness of the proposed approach. (shrink)

Pregroups and pregroup grammars were introduced by Lambek in 1999 [14] as an algebraic tool for the syntactic analysis of natural lan-guages. The main focus in that paper was on certain extended pregroup grammars such as pregroups with modalities, product pregroup grammars and tupled pregroup grammars. Their applications to different syntactic structures of natural languages, mainly Polish, are explored/shown here.

We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we prove (...) that all inductive formulae are elementary canonical and thus extend Sahlqvist’s theorem over them. In particular, we give a simple example of an inductive formula which is not frame-equivalent to any Sahlqvist formula. Then, after a deeper analysis of the inductive formulae as set-theoretic operators in descriptive and Kripke frames, we establish a somewhat stronger model-theoretic characterization of these formulae in terms of a suitable equivalence to syntactically simpler formulae in the extension of the language with reversive modalities. Lastly, we study and characterize the elementary canonical formulae in reversive languages with nominals, where the relevant notion of persistence is with respect to discrete frames. (shrink)

We consider some modal languages with a modal operator $D$ whose semantics is based on the relation of inequality. Basic logical properties such as definability, expressive power and completeness are studied. Also, some connections with a number of other recent proposals to extend the standard modal language are pointed at.

. We prove new Lindström theorems for the basic modal propositional language, and for some related fragments of first-order logic. We find difficulties with such results for modal languages without a finite-depth property, high-lighting the difference between abstract model theory for fragments and for extensions of first-order logic. In addition we discuss new connections with interpolation properties, and the modal invariance theorem.

Viewing the language of modal logic as a language for describing directed graphs, a natural type of directed graph to study modally is one where the nodes are sets and the edge relation is the subset or superset relation. A well-known example from the literature on intuitionistic logic is the class of Medvedev frames $\langle W,R\rangle$ where $W$ is the set of nonempty subsets of some nonempty finite set $S$, and $xRy$ iff $x\supseteq y$, or more liberally, where $\langle (...) W,R\rangle$ is isomorphic as a directed graph to $\langle \wp(S)\setminus\{\emptyset\},\supseteq\rangle$. Prucnal [32] proved that the modal logic of Medvedev frames is not finitely axiomatizable. Here we continue the study of Medvedev frames with extended modal languages. Our results concern definability. We show that the class of Medvedev frames is definable by a formula in the language of tense logic, i.e., with a converse modality for quantifying over supersets in Medvedev frames, extended with any one of the following standard devices: nominals (for naming nodes), a difference modality (for quantifying over those $y$ such that $x\not= y$), or a complement modality (for quantifying over those $y$ such that $x\not\supseteq y$). It follows that either the logic of Medvedev frames in one of these tense languages is finitely axiomatizable---which would answer the open question of whether Medvedev's [31] "logic of finite problems'' is decidable---or else the minimal logics in these languages extended with our defining formulas are the beginnings of infinite sequences of frame-incomplete logics. (shrink)

One of the challenges confronted by language learners is to master the interpretation of sentences with multiple logical operators, where different interpretations depend on different scope assignments. Five-year-old children have been found to access some readings of potentially ambiguous sentences much less than adults do :73–102, 2006; Musolino, Universal Grammar and the acquisition of semantic knowledge, 1998; Musolino and Lidz, Lang Acquis 11:277–291, 2003, among many others). Recently, Gualmini et al. have shown that, by careful contextual manipulation, it is possible (...) to evoke some of the putatively unavailable interpretations from young children. Their proposal is quite general, but the focus of their work was on sentences involving nominal quantifiers and negation. The present paper extends this investigation to sentences with modal expressions. The results of our two experimental studies reveal that, in potentially ambiguous sentences with modal expressions, the kinds of contextual manipulations introduced by Gualmini and colleagues do not suffice to explain children’s initial scope interpretations. In response to the recalcitrant data, we propose a new three-stage model of the acquisition of scope relations. Most importantly, at the initial stage, child grammars make available only one interpretation of negative sentences with modal expressions. We call this the Unique Scope Assignment stage. (shrink)

The present paper studies formal properties of so-called modal information logics (MILs)—modal logics first proposed in (van Benthem 1996 ) as a way of using possible-worlds semantics to model a theory of information. They do so by extending the language of propositional logic with a binary modality defined in terms of being the supremum of two states. First proposed in 1996, MILs have been around for some time, yet not much is known: (van Benthem 2017, 2019 ) pose (...) two central open problems, namely (1) axiomatizing the two basic MILs of suprema on preorders and posets, respectively, and (2) proving (un)decidability. The main results of the first part of this paper are solving these two problems: (1) by providing an axiomatization [with a completeness proof entailing the two logics to be the same], and (2) by proving decidability. In the proof of the latter, an emphasis is put on the method applied as a heuristic for proving decidability ‘via completeness’ for semantically introduced logics; the logics lack the FMP w.r.t. their classes of definition, but not w.r.t. a generalized class. These results are build upon to axiomatize and prove decidable the MILs attained by endowing the language with an ‘informational implication’—in doing so a link is also made to the work of (Buszkowski 2021 ) on the Lambek Calculus. (shrink)

Taking Löb's Axiom in modal provability logic as a running thread, we discuss some general methods for extending modal frame correspondences, mainly by adding fixed-point operators to modal languages as well as their correspondence languages. Our suggestions are backed up by some new results – while we also refer to relevant work by earlier authors. But our main aim is advertizing the perspective, showing how modal languages with fixed-point operators are a natural medium (...) to work with. (shrink)

The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to partial recursive function type constructor under the above interpretation. The cases of deterministic and non-deterministic functions are considered and for both of them semantically complete modal logics are described and decidability of these logics is established.

Modal dependence logic was introduced recently by Väänänen. It enhances the basic modal language by an operator = (). For propositional variables p 1, . . . , p n , = (p 1, . . . , p n-1, p n ) intuitively states that the value of p n is determined by those of p 1, . . . , p n-1. Sevenster (J. Logic and Computation, 2009) showed that satisfiability for modal dependence logic is (...) complete for nondeterministic exponential time.In this paper we consider fragments of modal dependence logic obtained by restricting the set of allowed propositional connectives. We show that satisfiability for poor man’s dependence logic, the language consisting of formulas built from literals and dependence atoms using ${\wedge, \square, \lozenge}$ (i. e., disallowing disjunction), remains NEXPTIME-complete. If we only allow monotone formulas (without negation, but with disjunction), the complexity drops to PSPACE-completeness.We also extend Väänänen’s language by allowing classical disjunction besides dependence disjunction and show that the satisfiability problem remains NEXPTIME-complete. If we then disallow both negation and dependence disjunction, satisfiability is complete for the second level of the polynomial hierarchy. Additionally we consider the restriction of modal dependence logic where the length of each single dependence atom is bounded by a number that is fixed for the whole logic. We show that the satisfiability problem for this bounded arity dependence logic is PSPACE-complete and that the complexity drops to the third level of the polynomial hierarchy if we then disallow disjunction.In this way we completely classify the computational complexity of the satisfiability problem for all restrictions of propositional and dependence operators considered by Väänänen and Sevenster. (shrink)

This paper and its sequel “look under the hood” of the usual sorts of proof-theoretic systems for certain well-known intuitionistic and classical propositional modal logics. Section 1 is preliminary. Of most importance: a marked formula will be the result of prefixing a formula in a propositional modal language with a step-marker, for this paper either 0 or 1. Think of 1 as indicating the taking of “one step away from 0.” Deductions will be constructed using marked formulas. Section (...) 2 presents the model-theoretic concepts, based on those in [7], that guide the rest of this paper. Section 3 presents Natural Deduction systems IK and CK, formalizations of intuitionistic and classical one-step versions of K. In these systems, occurrences of step-markers allow deductions to display deductive structure that is covered over in familiar “no step” proof-theoretic systems for such logics. Box and Diamond are governed by Introduction and Elimination rules; the familiar K rule and Necessitation are derived (i.e. admissible) rules. CK will be the result of adding the 0-version of the Rule of Excluded Middle to the rules which generate IK. Note: IK is the result of merely dropping that rule from those generating CK, without addition of further rules or axioms (as was needed in [7]). These proof-theoretic systems yield intuitionistic and classical consequence relations by the obvious definition. Section 4 provides some examples of what can be deduced in IK. Section 5 defines some proof-theoretic concepts that are used in Section 6 to prove the soundness of the consequence relation for IK (relative to the class of models defined in Section 2.) Section 7 proves its completeness (relative to that class). Section 8 extends these results to the consequence relation for CK. (Looking ahead: Part 2 will investigate one-step proof-theoretic systems formalizing intuitionistic and classical one-step versions of some familiar logics stronger than K.). (shrink)

Modal Platonism utilizes "weak" logical possibility, such that it is logically possible there are abstract entities, and logically possible there are none. Modal Platonism also utilizes a non-indexical actuality operator. Modal Platonism is the EASY WAY, neither reductionist nor eliminativist, but embracing the Platonistic language of abstract entities while eliminating ontological commitment to them. Statement of Modal Platonism. Any consistent statement B ontologically committed to abstract entities may be replaced by an empirically equivalent modalization, MOD(B), not (...) so ontologically committed. This equivalence is provable using Modal/Actuality Logic S5@. Let MAX be a strong set theory with individuals. Then the following Schematic Bombshell Result (SBR) can be shown: MAX logically yields [T is true if and only if MOD(T) is true], for scientific theories T. The proof utilizes Stephen Neale's clever model-theoretic interpretation of Quantified Lewis S5, which I extend to S5@. (shrink)

Modal logic is the study of modalities - expressions that qualify assertions about the truth of statements - like the ordinary language phrases necessarily, possibly, it is known/believed/ought to be, etc., and computationally or mathematically motivated expressions like provably, at the next state, or after the computation terminates. The study of modalities dates from antiquity, but has been most actively pursued in the last three decades, since the introduction of the methods of Kripke semantics, and now impacts on a (...) wide range of disciplines, including the philosophy of language and linguistics ('possible words' semantics for natural language), constructive mathematics (intuitionistic logic), theoretical computer science (dynamic logic, temporal and other logics for concurrency), and category theory (sheaf semantics). This volume collects together a number of the author's papers on modal logic, beginning with his work on the duality between algebraic and set-theoretic modals, and including two new articles, one on infinitary rules of inference, and the other about recent results on the relationship between modal logic and first-order logic. Another paper on the 'Henkin method' in completeness proofs has been substantially extended to give new applications. Additional articles are concerned with quantum logic, provability logic, the temporal logic of relativistic spacetime, modalities in topos theory, and the logic of programs. (shrink)

We define a multi-modal version of Computation Tree Logic ( ctl ) by extending the language with path quantifiers E δ and A δ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a ctl axiomatisation for each dimension. Completeness is proved by employing the completeness result for ctl to obtain a model along each dimension in turn. We (...) also show that the logic is decidable and that its satisfiability problem is no harder than the corresponding problem for ctl. We then demonstrate how Normative Systems can be conceived as a natural interpretation of such a multi-dimensional ctl logic. (shrink)

Graphs are among the most frequently used structures in Computer Science. Some of the properties that must be checked in many applications are connectivity, acyclicity and the Eulerian and Hamiltonian properties. In this work, we analyze how we can express these four properties with modal logics. This involves two issues: whether each of the modal languages under consideration has enough expressive power to describe these properties and how complex it is to use these logics to actually test (...) whether a given graph has some desired property. First, we show that these properties are not definable in a basic modal logic or in any bisimulation-invariant extension of it, like the modal μ-calculus. We then show that it is possible to express some of the above properties in a basic hybrid logic. Unfortunately, the Hamiltonian and Eulerian properties still cannot be efficiently checked. In a second attempt, we propose an extension of CTL* with nominals and show that the Hamiltonian property can be more efficiently checked in this logic than in the previous one. In a third attempt, we extend the basic hybrid logic with the ↓ operator and show that we can check the Hamiltonian property with optimal complexity in this logic. Finally, we tackle the Eulerian property in two different ways. First, we develop a generic method to express edge-related properties in hybrid logics and use it to express the Eulerian property. Second, we express a necessary and sufficient condition for the Eulerian property to hold using a graded modal logic. (shrink)

We define a multi-modal version of Computation Tree Logic (CTL) by extending the language with path quantifiers $E^\delta $ and $E^\delta $ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a CTL axiomatisation for each dimension. Completeness is proved by employing the completeness result for CTL to obtain a model along each dimension in turn. We also show (...) that the logic is decidable and that its satisfiability problem is no harder than the corresponding problem for CTL. We then demonstrate how Normative Systems can be conceived as a natural interpretation of such a multi-dimensional CTL logic. (shrink)

We define a multi-modal version of Computation Tree Logic (ctl) by extending the language with path quantifiers E δ and A δ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a ctl axiomatisation for each dimension. Completeness is proved by employing the completeness result for ctl to obtain a model along each dimension in turn. We also show (...) that the logic is decidable and that its satisfiability problem is no harder than the corresponding problem for ctl. We then demonstrate how Normative Systems can be conceived as a natural interpretation of such a multi-dimensional ctl logic. (shrink)

This is an extended version of the lectures given during the 12-thConference on Applications of Logic in Philosophy and in the Foundationsof Mathematics in Szklarska Poręba. It contains a surveyof modal hybrid logic, one of the branches of contemporary modal logic. Inthe first part a variety of hybrid languages and logics is presented with adiscussion of expressivity matters. The second part is devoted to thoroughexposition of proof methods for hybrid logics. The main point is to showthat (...) application of hybrid logics may remarkably improve the situation inmodal proof theory. (shrink)

We study a modal system ¯T, that extends the classical (prepositional) modal system T and whose language is provided with modal operators M inn (nN) to be interpreted, in the usual kripkean semantics, as there are more than n accessible worlds such that.... We find reasonable axioms for ¯T and we prove for it completeness, compactness and decidability theorems.

A notable early result of David Makinson establishes that every monotone modal logic can be extended to LI, LV, or LF, and every antitone logic can be extended to LN, LV, or LF, where LI, LN, LV, and LF are logics axiomatized, respectively, by the schemas □α↔α, □α↔¬α, □α↔⊤, and □α↔⊥. We investigate logics that are both monotone and antitone (hereafter amphitone). There are exactly three: LV, LF, and the minimum amphitone logic AM axiomatized by the schema (...) □α→□β. These logics, along with LI, LN, and a wider class of “extensional” logics, bear close affinities to classical propositional logic. Characterizing those affinities reveals differences among several accounts of equivalence between logics. Some results about amphitone logics do not carry over when logics are construed as consequence or generalized (“multiple-conclusion”) consequence relations on languages that may lack some or all of the nonmodal connectives. We close by discussing these divergences and conditions under which our results do carry over. (shrink)

The language of propositional modal logic is extended by the introduction of sequents. Validity of a modal sequent on a frame is defined, and modal sequent-axiomatic classes of frames are introduced. Through the use of modal algebras and general frames, a study of the properties of such classes is begun.

We extend the languages of both basic and graded modal logic with the infinity diamond, a modality that expresses the existence of infinitely many successors having a certain property. In both cases we define a natural notion of bisimilarity for the resulting formalisms, that we dub $\mathtt {ML}^{\infty }$ and $\mathtt {GML}^{\infty }$, respectively. We then characterise these logics as the bisimulation-invariant fragments of the naturally corresponding predicate logic, viz., the extension of first-order logic with the infinity quantifier. (...) Furthermore, for both $\mathtt {ML}^{\infty }$ and $\mathtt {GML}^{\infty }$ we provide a sound and complete axiomatisation for the set of formulas that are valid in every Kripke frame, we prove a small model property with respect to a widened class of weighted models, and we establish decidability of the satisfiability problem. (shrink)

We prove strong completeness of the □-version and the ◊-version of a Gödel modal logic based on Kripke models where propositions at each world and the accessibility relation are both infinitely valued in the standard Gödel algebra [0,1]. Some asymmetries are revealed: validity in the first logic is reducible to the class of frames having two-valued accessibility relation and this logic does not enjoy the finite model property, while validity in the second logic requires truly fuzzy accessibility relations and (...) this logic has the finite model property. Analogues of the classical modal systems D, T, S4 and S5 are considered also, and the completeness results are extended to languages enriched with a discrete well ordered set of truth constants. (shrink)

We show that given a finite, transitive and reflexive Kripke model 〈 W , ≼, ⟦ ⋅ ⟧ 〉 and $${w \in W}$$ , the property of being simulated by w (i.e., lying on the image of a literalpreserving relation satisfying the ‘forth’ condition of bisimulation) is modally undefinable within the class of S4 Kripke models. Note the contrast to the fact that lying in the image of w under a bi simulation is definable in the standard modal language (...) even over the class of K4 models, a fairly standard result for which we also provide a proof. We then propose a minor extension of the language adding a sequent operator $${\natural}$$ (‘tangle’) which can be interpreted over Kripke models as well as over topological spaces. Over finite Kripke models it indicates the existence of clusters satisfying a specified set of formulas, very similar to an operator introduced by Dawar and Otto. In the extended language $${{\sf L}^+ = {\sf L}^{\square\natural}}$$ , being simulated by a point on a finite transitive Kripke model becomes definable, both over the class of (arbitrary) Kripke models and over the class of topological S4 models. As a consequence of this we obtain the result that any class of finite, transitive models over finitely many propositional variables which is closed under simulability is also definable in L + , as well as Boolean combinations of these classes. From this it follows that the μ -calculus interpreted over any such class of models is decidable. (shrink)

We investigate the dynamics of sensory integration for perceiving musical performance, a complex natural behavior. Thirty musically trained participants saw, heard, or both saw and heard, performances by two clarinetists. All participants used a sliding potentiometer to make continuous judgments of tension (a measure correlated with emotional response) and continuous judgments of phrasing (a measure correlated with perceived musical structure) as performances were presented. The data analysis sought to reveal relations between the sensory modalities (vision and audition) and to quantify (...) the effect of seeing the performances on participants' overall subjective experience of the music. In addition to traditional statistics, functional data analysis techniques were employed to analyze time-varying aspects of the data. The auditory and visual channels were found to convey similar experiences of phrasing but different experiences of tension through much of the performances. We found that visual information served both to augment and to reduce the experience of tension at different points in the musical piece (as revealed by functional linear modeling and functional significance testing). In addition, the musicians' movements served to extend the sense of phrasing, to cue the beginning of new phrases, to indicate musical interpretation, and to anticipate changes in emotional content. Evidence for an interaction effect suggests that there may exist an emergent quality when musical performances are both seen and heard. The investigation augments knowledge of human communicative processes spanning language and music, and involving multiple modalities of emotion and information transfer. (shrink)

How do modal expressions determine which possibilities they range over? According to the Modal Anchor Hypothesis (Kratzer in _The language-cognition interface: Actes du 19_ _e_ _congrès international des linguistes_, Libraire Droz, Genève, 179–199, 2013 ), modal expressions determine their domain of quantification from particulars (events, situations, or individuals). This paper presents novel evidence for this hypothesis, focusing on a class of Spanish relative clauses that host verbs inflected in the subjunctive. Subjunctive in Romance is standardly taken to (...) be licensed only in a subset of intensional contexts. However, in our relative clauses, subjunctive is exceptionally licensed in extensional contexts. At the same time, the interpretation of these relative clauses still involves modality, a type of modality that targets the goals of the agent of the main event. We argue that the pattern displayed by these relative clauses follows straightforwardly if subjunctive is associated with a modal operator that, like modal indefinites (Alonso-Ovalle and Menéndez-Benito in _Journal of Semantics_ 35(1):1–41, 2017 ), can project its domain from a volitional event. Overall, our proposal supports the event-based analysis of mood (Kratzer in Evidential mood in attitude and speech reports. Talk delivered at the 1st Syncart Workshop, Siena, July 13, 2016 ; Portner and Rubinstein in _Natural Language Semantics_ 28:343–393, 2020 ) and extends its application beyond attitudinal and modal complements. (shrink)

John Horty has proposed an approach to reasoning with ought-propositions which stands in contrast to the standard modal approach to deontic logic. Horty’s approach is based on default theories as known from the framework of Default Logic. It is argued that the approach cannot be extended beyond the most simple kinds of default theories and that it fails in particular to account for conditional obligations. The most plausible ways of straightening out the defects of the approach conform to (...) a simple theory of default reasoning in standard deontic language. (shrink)

For a Euclidean space , let L n denote the modal logic of chequered subsets of . For every n 1, we characterize L n using the more familiar Kripke semantics, thus implying that each L n is a tabular logic over the well-known modal system Grz of Grzegorczyk. We show that the logics L n form a decreasing chain converging to the logic L of chequered subsets of . As a result, we obtain that L is also (...) a logic over Grz, and that L has the finite model property. We conclude the paper by extending our results to the modal language enriched with the universal modality. (shrink)

Hybridization is a method invented by Arthur Prior for extending the expressive power of modal languages. Although developed in interesting ways by Robert Bull, and by the Sofia school , the method remains little known. In our view this has deprived temporal logic of a valuable tool.The aim of the paper is to explain why hybridization is useful in temporal logic. We make two major points, the first technical, the second conceptual. First, we show that hybridization gives rise (...) to well-behaved logics that exhibit an interesting synergy between modal and classical ideas. This synergy, obvious for hybrid languages with full first-order expressive strength, is demonstrated for a weaker local language capable of defining the Until operator; we provide a minimal axiomatization, and show that in a wide range of temporally interesting cases extended completeness results can be obtained automatically. Second, we argue that the idea of sorted atomic symbols which underpins the hybrid enterprise can be developed further. To illustrate this, we discuss the advantages and disadvantages of a simple hybrid language which can quantify over paths. (shrink)

Let ${{\mathcal L}^{\square\circ}}$ be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality □ and a temporal modality ◦, understood as ‘next’. We extend the topological semantic for S4 to a semantics for the language ${{\mathcal L}^{\square\circ}}$ by interpreting ${{\mathcal L}^{\square\circ}}$ in dynamic topological systems, i.e., ordered pairs 〈X, f〉, where X is a topological space and f is a continuous function on X. Artemov, Davoren and Nerode have axiomatized a logic S4C, and have shown (...) that S4C is sound and complete for this semantics. S4C is also complete for continuous functions on Cantor space (Mints and Zhang, Kremer), and on the real plane (Fernández Duque); but incomplete for continuous functions on the real line (Kremer and Mints, Slavnov). Here we show that S4C is complete for continuous functions on the rational numbers. (shrink)

For a Euclidean space \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathbb{R}^n $$ \end{document}, let Ln denote the modal logic of chequered subsets of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathbb{R}^n $$ \end{document}. For every n ≥ 1, we characterize Ln using the more familiar Kripke semantics, thus implying that each Ln is a tabular logic over the well-known modal system Grz of Grzegorczyk. We show that the logics Ln form a (...) decreasing chain converging to the logic L∞ of chequered subsets of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathbb{R}^\infty $$ \end{document}. As a result, we obtain that L∞ is also a logic over Grz, and that L∞ has the finite model property. We conclude the paper by extending our results to the modal language enriched with the universal modality. (shrink)

In this paper the language of first-order modal logic is enriched with an operator @ ('actually') such that, in any model, the evaluation of a formula @A at a possible world depends on the evaluation of A at the actual world. The models have world-variable domains. All the logics that are discussed extend the classical predicate calculus, with or without identity, and conform to the philosophical principle known as serious actualism. The basic logic relies on the system K, whereas (...) others correspond to various properties that the actual world may have. All the logics are axiomatized. (shrink)

We introduce and study hierarchies of extensions of the propositional modal and temporal languages with pairs of new syntactic devices: point of reference-reference pointer which enable semantic references to be made within a formula. We propose three different but equivalent semantics for the extended languages, discuss and compare their expressiveness. The languages with reference pointers are shown to have great expressive power (especially when their frugal syntax is taken into account), perspicuous semantics, and simple deductive (...) systems. For instance, Kamp's and Stavi's temporal operators, as well as nominals (names, clock variables), are definable in them. Universal validity in these languages is proved undecidable. The basic modal and temporal logics with reference pointers are uniformly axiomatized and a strong completeness theorem is proved for them and extended to some classes of their extensions. (shrink)

This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of linear logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have shown that the results scale up to logics with multiple non-minimal modalities. Here, we start with the language of propositional intuitionistic linear logic without the additive disjunction, to which we add a modality. We provide an interpretation of this language on a class of Kripke resource (...) models extended with a neighbourhood function: modal Kripke resource models. We propose a Hilbert-style axiomatisation and a Gentzen-style sequent calculus. We show that the proof theories are sound and complete with respect to the class of modal Kripke resource models. We show that the sequent calculus admits cut elimination and that proof-search is in PSPACE. We then show how to extend the results when non-commutative connectives are added to the language. Finally, we put the l.. (shrink)

Lewis (1968) claims that his language of Counterpart Theory (CT) interprets modal discourse and he adverts to a translation scheme from the language of Quantifed Modal Logic (QML) to CT. However, everybody now agrees that his original translation scheme does not always work, since it does not always preserve the ‘intuitive’ meaning of the translated QML-formulas. Lewis discusses this problem with regard to the Necessitist Thesis, and I will extend his discourse to the analysis of the Converse Barcan (...) Formula. Everyone also agrees that there are CT-formulas that can express the QMLcontent that gets lost through the translation. The problem is how we arrive to them. In this paper, I propose new translation rules from QML to CT, based on a suggestion by Kaplan. However, I will claim that we cannot have ‘the’ translation scheme from QML to CT. The reason being that de re modal language is ambiguous. Accordingly, there are diferent sorts of QML, depending on how we resolve such ambiguity. Therefore, depending on what sort of QML we intend to translate into CT, we need to use the corresponding translation scheme. This suggests that all the translation problems might just disappear if we do what Lewis did not: begin with a fully worked out QML that tells us how to understand de re modal discourse. (shrink)

The well known AGM framework for belief revision has recently been extended to include a model of the research agenda of the agent, i.e. a set of questions to which the agent wishes to find answers (Olsson & Westlund in Erkenntnis , 65 , 165–183, 2006 ). The resulting model has later come to be called interrogative belief revision . While belief revision has been studied extensively from the point of view of modal logic, so far interrogative belief (...) revision has only been dealt with in the metalanguage approach in which AGM was originally presented. In this paper, I show how to model interrogative belief revision in a modal object language using a class of operators for questions. In particular, the solution I propose will be shown to capture the notion of K-truncation , a method for agenda update in the case of expansion constructed by Olsson & Westlund. Two case studies are conducted: first, an interrogative extension of Krister Segerberg’s system DDL, and then a similar extension of Giacomo Bonanno’s modal logic for belief revision. Sound and complete axioms will be provided for both of the resulting logics. (shrink)

Prof. Ruth Barcan Marcus created quantified modal logic in 1946. She extended the Lewis calculus S2 to cover quantification. Quantified modal logic became an essential tool for the rigorous study of natural language in the hands of R. Montague in the late sixties. Some complex phenomena cannot be properly handled at the level of sentences. Recent researches in formal semantics have concentrated on discourse and led to a rich amount of results. Logical theories introduced for the logical (...) study of programs play an important role in these developments. We shall present a detailed account of the connection between dynamic logic and “static” logic. The core of the paper will be the translation of dynamic logic into S5. Developping an insight due to Prof. J. van Eijck, We shall offer a simplified version of the latter translation. The paper also relates to P. Gärdenfors' Knowledge in Flux. (shrink)

On Kratzer’s canonical account, modal expressions (like “might” and “must”) are represented semantically as quantifiers over possibilities. Such expressions are themselves neutral; they make a single contribution to determining the propositions expressed across a wide range of uses. What modulates the modality of the proposition expressed—as bouletic, epistemic, deontic, etc.—is context.2 This ain’t the canon for nothing. Its power lies in its ability to figure in a simple and highly unified explanation of a fairly wide range of language use. (...) Recently, though, the canon’s neat story has come under attack. The challenge cases involve the epistemic use of a modal sentence for which no single resolution of the contextual parameter appears capable of accommodating all our intuitions.3 According to these revisionaries, such cases show that the canonical story needs to be amended in some way that makes multiple bodies of information relevant to the assessment of such statements. Here I show that how the right canonical, flexibly contextualist account of modals can accommodate the full range of challenge cases. The key will be to extend Kratzer’s formal semantic account with an account of how context selects values for a modal’s.. (shrink)

In the first chapter I have introduced Carnapian intensional logic against the background of Frege's and Quine's puzzles. The main body of the dissertation consists of two parts. In the first part I discussed Carnapian modal logic and arithmetic with descriptions. In the second chapter, I have described three Carnapian theories, CCL, CFL, and CNL. All three theories have three things in common. First, they are formulated in languages containing description terms. Second, they contain a system of (...) class='Hi'>modal logic. Third, they do not contain the unrestricted classical substitution principle, but they do contain the classical substitution principle restricted to non-modal formulas and the Carnapian substitution principle, which says that two terms can be substituted salva veritate if they are necessarily coreferential. There are two major differences between the three theories. First, CCL and CFL allow universal instantiation with description terms, whereas CNL does not. Moreover, the quantificational theory of the CCL is classical, whereas the quantificational theory of CFL is a free logic. Another difference is that CCL and CFL contain different description principles. Most importantly, the description principle of CCL ensures that even improper descriptions have a denotation, whereas the description principle of CFL does not guarantee this. CNL does not have a description principle. In the third chapter, I have studied collapse arguments for CCL, CFL, and CNL. A collapse argument is an argument for the following statement: if p is true, then it is necessarily true. A crucial role in the proofs of these collapse results was played by so-called self-predication principles, which say that under certain conditions the predicate that expresses the descriptive condition can be combined by the description term formed out of that predicate with the result being a true sentence. In this chapter I have discussed a collapse argument for the extension of CCL with a self-predication principle, I have given a collapse argument for a similarly extended CFL, and most importantly, I have given a collapse argument for the extension of CNL with a self- predication principle. Finally, I have argued that the relevant self-predication principles are unsound under a Carnapian interpretation. In the fourth chapter, I have studied the extension of Peano Arithmetic with a Carnapian modal logic C, which is a dummy letter standing for either CCL or CFL. One can prove that the principle of the necessity of identity is a theorem of CPA. This implies that one gets a collapse result for CPA. The standard principle of weak induction was crucial for the proof. One can also prove that, if one assumes a particular self-predication principle, and if one assumes the principle of strong induction or, equivalently, the least-number principle, then one gets a partial collapse of de re modal truths in de dicto modal truths. I have argued that, if the box operator is interpreted as a metaphysical necessity operator, then Platonists would not be inimical to the collapse result. But if CPA is extended with a physical theory, then there is a threat that physical truths become physical necessiti es. It was shown that, under a Carnapian interpretation, the standard principle of weak induction is unsound, and that it can be replaced by a Carnapian principle of weak induction that is sound. The problem of logical and mathematical omniscience prevents ordinary Carnapian intensional logic from being taken seriously as a logic adequate for describing the principles of demonstrability. Yet many of the proof-theoretic results of the first part carry over to the part on Carnapian epistemic arithmetic with descriptions, since proof-theoretic results are independent of the informal reading of the operators. In the fifth chapter, I looked at extensions of arithmetic with a modal logic in which the box operator is interpreted as a demonstrability operator. A first extension in that sense is Shapiro s Epistemic Arithmetic. Shapiro himself offered the problem of mathematical omniscience as a reason why it is difficult to find a model theory for EA. Horsten attempted to provide a model theory via the detour of Modal-Epistemic Arithmetic. The attention of the reader was drawn to an incoherence in the model theory of. Two alternative solutions were presented and, after a short discussion of the problem of de re demonstrability one of those alternatives was chosen. The discussion of the problem of de re demonstrability made it clear that it would be interesting to study the epistemic properties of notation systems. Horsten himself provided a framework for this, viz. Carnapian Epistemic Arithmetic, and he started a systematic study of the epistemic properties of notation systems within that framework. However, he did not provide non-trivial but adequate models. To make a start with solving the problem of finding good models for CEA, I introduced Carnapian Modal-Epistemic Arithmetic In constructing CMEA I incorporated the lesson about the principle of weak induction learnt in the fourth chapter. In the sixth chapter, I gave a critical assessment of an argument concerning the limits of de re demonstrability about the natural numbers. The conclusion of the Description Argument is that it is undemonstrable that there is a natural number that has a certain property but of which it is undemonstrable that it has that property. A crucial step in the Description Argument involved a self-predication principle. Making good use of one of the results obtained in the third chapter, I proved a collapse result for the background theory against which the Description Argument was formulated. I concluded that either the either the Description Argument is sound but its conclusion is trivial, o r the Description Argument is unsound, or it is a cheapshot. As an appendix I included an article co-authored by prof. dr. Leon Horsten and me. The topic of the article is indirectly related to some other topics investigated in my dissertation. Also, it backs up one of the addition al theses I might be asked to publicly defend during my doctoral exam. T he topic of the appendix is the set of the so-called paradoxes of strict implication. Jonathan Lowe has argued that a particular variation on C.I. Lewis notion of strict implication avoids the paradoxes of strict implication. Pace Lowe, it is argued that Lowe s notion of implication does not achieve this aim. Moreover, a general argument is offered to the effect that no other variation on Lewis notion of constantly strict implication describes the logical behaviour of natural language conditional s in a satisfactory way. (shrink)

Let $\mathcal{L}$ be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality $\square$ and a temporal modality $\bigcirc$ , understood as ‘next’. We extend the topological semantic for S4 to a semantics for the language $\mathcal{L}$ by interpreting $\mathcal{L}$ in dynamic topological systems, i.e. ordered pairs $\langle X, f\rangle$ , where X is a topological space and f is a continuous function on X. Artemov, Davoren and Nerode have axiomatized a logic S4C, and have shown (...) that S4C is sound and complete for this semantics. Zhang and Mints have shown that S4C is complete relative to a particular topological space, Cantor space. The current paper produces an alternate proof of the Zhang-Mints result. (shrink)

We define a multi-modal version of Computation Tree Logic (ctl) by extending the language with path quantifiers E δ and A δ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a ctl axiomatisation for each dimension. Completeness is proved by employing the completeness result for ctl to obtain a model along each dimension in turn. We also show (...) that the logic is decidable and that its satisfiability problem is no harder than the corresponding problem for ctl. We then demonstrate how Normative Systems can be conceived as a natural interpretation of such a multi-dimensional ctl logic. (shrink)

In this paper, we study three representations of lattices by means of a set with a binary relation of compatibility in the tradition of Ploščica. The standard representations of complete ortholattices and complete perfect Heyting algebras drop out as special cases of the first representation, while the second covers arbitrary complete lattices, as well as complete lattices equipped with a negation we call a protocomplementation. The third topological representation is a variant of that of Craig, Haviar, and Priestley. We then (...) extend each of the three representations to lattices with a multiplicative unary modality; the representing structures, like so-called graph-based frames, add a second relation of accessibility interacting with compatibility. The three representations generalize possibility semantics for classical modal logics to non-classical modal logics, motivated by a recent application of modal orthologic to natural language semantics. (shrink)

For branching-time temporal logic based on an Ockhamist semantics, we explore a temporal language extended with two additional syntactic tools. For reference to the set of all possible futures at a moment of time we use syntactically designated restricted variables called fan-names. For reference to all possible futures alternative to the actual one we use a modification of a difference modality, localized to the set of all possible futures at the actual moment of time.We construct an axiomatic system for (...) this extended branching-time logic and prove its soundness and completeness with respect to bundle tree semantics. Finally, we show how our axiomatic system can be extended with a variety of important additional operators, such as Since and Until, a global difference operator, operators for undivided and divided histories, reference pointers, etc. (shrink)

The papers collected in this volume exemplify some of the trends in current approaches to logic, language and computation. Written by authors with varied academic backgrounds, the contributions are intended for an interdisciplinary audience. The first part of this volume addresses issues relevant for multi-agent systems: reasoning with incomplete information, reasoning about knowledge and beliefs, and reasoning about games. Proofs as formal objects form the subject of Part II. Topics covered include: contributions on logical frameworks, linear logic, and different approaches (...) to formalized reasoning. Part III focuses on representations and formal methods in linguistic theory, addressing the areas of comparative and temporal expressions, modal subordination, and compositionality. (shrink)