Semantics for Modal Logic

ABSTRACT: Paper currently being revised.

This paper targets a series of potential issues for the discussion of, and modal resolution to, the alethic paradoxes advanced by Scharp (2013). I proffer four novel extensions of the theory, and detail six issues that the theory faces. I provide a counter-example to epistemic closure for reductio proofs.

The dogma that the propositional logic of metaphysical modality is S5 is rebutted in related installments (previously published and unpublished essays).

The paper explores applications of Kripke's theory of truth to semantics for anti-luck epistemology, that is, to subjunctive theories of knowledge. Subjunctive theories put forward modal or subjunctive conditions to rule out knowledge by mere luck as to be found in Gettier-style counterexamples to the analysis of knowledge as justified true belief. Because of the subjunctive nature of these conditions the resulting semantics turns out to be non-monotone, even if it is based on non-classical evaluation schemes such as strong Kleene (...) or FDE. This blocks the usual road to fixed-point results for Kripke's theory of truth within these semantics and consequently the paper is predominantly an exploration of fixed point results for Kripke's theory of truth within non-monotone semantics. Using the theory of quasi-inductive definitions we show that in case of the subjunctive theories of knowledge the so-called Kripke jump will have fixed points despite the non-monotonicity of the semantics: Kripke's theory of truth can be successfully applied in the framework of subjunctive theories of knowledge. (shrink)

We give a theory of epistemic modals in the framework of possibility semantics and axiomatize the corresponding logic, arguing that it aptly characterizes the ways in which reasoning with epistemic modals does, and does not, diverge from classical modal logic.

In this work, we illustrate applications of a semantic framework for non-congruential modal logic based on hyperintensional models. We start by discussing some philosophical ideas behind the approach; in particular, the difference between the set of possible worlds in which a formula is true (its intension) and the semantic content of a formula (its hyperintension), which is captured in a rigorous way in hyperintensional models. Next, we rigorously specify the approach and provide a fundamental completeness theorem. Moreover, we analyse examples (...) of non-congruential systems that can be semantically characterized within this framework in an elegant and modular way. Finally, we compare the proposed framework with some alternatives available in the literature. In the light of the results obtained, we argue that hyperintensional models constitute a basic, general and unifying semantic framework for (non-congruential) modal logic. (shrink)

The principle motivation of this work is to display the sense in which the epistemic reading of a Kripke model tacitly requires common knowledge of the model, CKM. This requirement significantly restricts the amount of epistemic situations we are able to consider. We explore possible worlds epistemic models in a general setting without CKM assumptions and show that such models can be identified with observable substructures of Kripke models. We argue that such observable models offer a new level of generality (...) and conceptual clarity in epistemic modeling. Similar analysis applies to intuitionistic models. (shrink)

Prior to Kripke’s seminal work on the semantics of modal logic, McKinsey offered an alternative interpretation of the necessity operator, inspired by the Bolzano–Tarski notion of logical truth. According to this interpretation, ‘it is necessary that A’ is true just in case every sentence with the same logical form as A is true. In our paper, we investigate this interpretation of the modal operator, resolving some technical questions, and relating it to the logical interpretation of modality and some views in (...) modal metaphysics. In particular, we present an hitherto unpublished solution to problems 41 and 42 from Friedman’s 102 problems, which uses a different method of proof from the solution presented in the paper of Tadeusz Prucnal. (shrink)

Saul Kripke’s work on the semantics of modal logics is well known, unlike his work on Anderson and Belnap’s system E of Entailment (a modal relevance logic), which included his proof of the decidability of its implicational fragment E_>, and also a counterexample to the conjecture of Belnap that E_> is the intersection of the implicational fragments of the relevance logic R and the modal logic S4. This led to Storrs McCall’s suggesting that the “mingle” axiom might be added to (...) E_>, and that this system might be used instead of S4_>. We give a counterexample to this conjecture. We also disprove the conjecture Anderson and Belnap attribute to McCall, in which “restricted mingle” is added to E_>. We use a modal extension of the lattice M_0 and follow ideas of Meyer. In the 1970s, Dunn showed that RM (R with the mingle axiom) can be modeled using a binary accessibility relation, like the accessibility relation in Kripke’s semantics for normal modal logics and his semantics for intuitionistic logic. Dunn also gave a variant interpretation for EM (E with the mingle axiom). We explore some other variations of these binary relational semantics. (shrink)

Kripke is famous for holding that when the identity sign is flanked by proper names or natural kind terms, then the result is necessary if true. His conclusion is supported by the idea that proper names and natural kinds terms are rigid designators. To explore the cogency of Kripke’s position, this paper takes on two interlocking projects in the formulation of the semantics for quantified modal logic (QML). Project 1. Define ‘rigidity’ in a way that is faithful to Kripke’s intentions, (...) and for which evidence for the rigidity of proper names and natural kind terms is forthcoming. Project 2. Given a candidate definition of rigidity produced in Project 1, find a well-motivated semantics for QML that validates the claim that ‘t is identical to s’ is necessary if true when terms t and s are rigid in that sense. It is surprisingly difficult to succeed at both projects. Three different definitions for ‘rigidity’ are explored here along with a variety of corresponding QMLs. The few QMLs that survive Project 2 are very different from ones Kripke developed in his seminal paper “Semantic Considerations in Modal Logic”. Furthermore, there are serious costs whichever solution we attempt. (shrink)

Divers argued that there are modal truths that are inconvenient for the canonical Lewisian theory of modality. Noonan and Jago proposed an answer to the challenge, by invoking a duplicate interpretation of the modal truths. Here, I present a slightly different kind of modal truth that would prove inconvenient even for a Lewisian who accepts Noonan and Jago's proposal.

The following is a typeset copy of a letter sent by Saul Kripke to David Lewis on August 11, 1969 regarding the article “Counterpart Theory and Quantified Modal Logic” (Lewis, 1968). The original letter was typeset by Mimi Foster (indicated by the initials “mf” at the end of the letter) at Rockefeller University. In consultation with Saul Kripke, we corrected some typos, filled in blank formulas, and added three footnotes. Keywords have been added before the letter, references have been added (...) after the letter, and the original pagination of the letter is reflected in bracketed parentheticals. (The Editors.). (shrink)

This paper is an amended version of a talk Saul Kripke gave at the Eastern Division meeting of the APA in 1992 (an extended abstract was previously published as Kripke, 1992). It contains philosophical reflections and technical results concerning “Carnapian” quantified modal logic, that is, modal logic with quantification over individual concepts. The paper contains the fullest statement by the author available of (un)axiomatizability results he obtained in the 1970s. (The Editors.).

Charles Peirce developed Existential Graphs as a diagrammatic syntax for representing and reasoning about propositions, with three parts: Alpha for propositional logic, Beta for first-order predicate logic, and Gamma for aspects of modal logic, second-order logic, and metalanguage. He made several adjustments between 1909 and 1911 that merit further consideration: using heavy lines to denote possible states of things in which attached propositions would be true, drawing a red line just inside the edge of a page and writing postulates in (...) the resulting margin, shading oddly enclosed areas instead of drawing thin lines as their boundaries, and using multiple sheets of paper to represent different subjects within the overall universe of discourse. These modifications can be combined to constitute a plausible candidate for Delta, a fourth part that Peirce intended to add but never spelled out. It implements modern formal systems of modal propositional logic in accordance with a version of possible worlds semantics in which the laws for the actual state of things are facts in every possible state of things. (shrink)

In this short intellectual biography, we chronicle Saul Kripke’s involvement in the development of modal logic, focusing on the decade beginning in 1953 and ending in 1963, during which time he ranged in age from 12 to 23. We also describe the state of modal logic before Kripke, Kripke’s correspondence with other modal logicians, and Kripke’s early influential publications on the semantics of modal logic as well as several later and lesser known contributions.

This edited volume brings together papers by both eminent and rising scholars to celebrate Saul Kripke’s singular contributions to modal logic. Kripke’s work on modal logic helped usher in a new semantic epoch for the field and made facility with modal logic indispensable not only to technically oriented philosophers but to theoretical computer scientists and others as well. This volume features previously unpublished work of Kripke’s as well as a brief intellectual biography recounting the story of how Kripke became interested (...) in, and made his first contributions to, modal logic. However, the majority of the volume’s contributions are forward-looking, and produce new philosophical and technical insights by engaging with ideas tracing back to Kripke. (shrink)

A solid foundation of modal logic requires a clear conception of the notion of modality. Modern modal logic treats modality as a propositional operator. I shall present an alternative according to which modality applies primarily to illocutionary force, that is, to the force, or mood, of a speech act. By a first step of internalization, modality applied at this level is pushed to the level of speech-act content. By a second step of internalization, we reach a propositional operator validating the (...) modal logic S4. After a brief discussion of problematic modality and possibility, the article concludes with an extension of the account that identifies modality with illocutionary force. Throughout, close attention is paid to the intended interpretation of the formalism. All of the rules stipulated will be justified on the basis of this interpretation. (shrink)

In common treatments of deontic logic, the obligatory is what is true in all deontically ideal possible worlds. In this article, I offer a new semantics for Standard Deontic Logic with Leibnizian intensions rather than possible worlds. Even though the new semantics furnishes models that resemble Venn diagrams, the semantics captures the strong soundness and completeness of Standard Deontic Logic. Since, unlike possible worlds, many Leibnizian intensions are not maximally consistent entities, we can amend the semantics to invalidate the inference (...) rule which ensures that all tautologies are obligatory. I sketch this amended semantics to show how it invalidates the rule in a new way. (shrink)

One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...) for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (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)

Jaakko Hintikka proposed treating objectual perception sentences, such as “Alice sees Bob,” as de re propositional perception sentences. Esa Saarinen extended Hintikka’s idea to eventive perception sentences, such as “Alice sees Bob smile.” These approaches, elegant as they may be, are not philosophically neutral, for they presuppose, controversially, that the content of all perceptual experiences is propositional in nature. The aim of this paper is to propose a formal treatment of objectual and eventive perception sentences that builds on Hintikka’s modal (...) approach to propositional attitude ascriptions while avoiding controversial assumptions on the nature of perceptual experiences. Despite being simple and theoretically frugal, our approach is powerful enough to express a variety of interesting philosophical views about propositional, objectual, and eventive perception sentences, thus enabling the study of their inferential relationships. (shrink)

This paper investigates and develops generalizations of two-dimensional modal logics to any finite dimension. These logics are natural extensions of multidimensional systems known from the literature on logics for a priori knowledge. We prove a completeness theorem for propositional n-dimensional modal logics and show them to be decidable by means of a systematic tableau construction.

The research observed, in parallel and comparatively, a surveillance state’s use of communication & cyber networks with satellite applications for power political & realpolitik purposes, in contrast to the outer space security & legit scientific purpose driven cybernetics. The research adopted a psychoanalytic & psychosocial method of observation in the organizational behaviors of the surveillance state, and a theoretical physics, astrochemical, & cosmological feedback method in the contrast group of cybernetics. Military sociology and multilateral movements were adopted in the diagnostic (...) studies & research on cybersecurity, and cross-channeling in communications were detected during the research. The paper addresses several key points of technicalities in security & privacy breach, from personal devices to ontological networks and satellite applications - notably telecommunication service providers & carriers with differentiated spectrum. The paper discusses key moral ethical risks posed in the mal-adaptations in commercial devices that can corrupt democracy in subtle ways but in a mass scale. The research adopted an analytical linguistics approach with linguistic history in unjailing from the artificial intelligence empowered pancomputationalism approach of the heterogenous dictatorial semantic network, and the astronomical & cosmological research in information theory implies that noncomputable processes are the only defense strategy for the new technology-driven pancomputationalism developments. (shrink)

Rosenkranz (2021) devised two bimodal epistemic logics: an idealized one and a realistic one. The former is shown to be sound with respect to a class of neighborhood frames called i-frames. Rosenkranz designed a specific i-frame able to invalidate a series of undesired formulas, proving that these are not theorems of the idealized logic. Nonetheless, an unwanted formula and an unwanted rule of inference are not invalidated. Invalidating the former guarantees the distinction between the two modal operators characteristic of the (...) logic, while invalidating the latter is crucial in order to deal with the problem of logical omniscience. In this paper, I present an i-frame able to invalidate all the undesired formulas already invalidated by Rosenkranz, together with the missing formula and rule of inference. (shrink)

Book Review of Impossible Worlds, by Francesco Berto and Mark Jago. Oxford: Oxford University Press, 2019.

This paper presents a recent formalization of a Henkin-style completeness proof for the propositional modal logic S5 using the Lean theorem prover. The proof formalized is close to that of Hughes and Cresswell, but the system, based on a different choice of axioms, is better described as a Mendelson system augmented with axiom schemes for K, T, S4, and B, and the necessitation rule as a rule of inference. The language has the false and implication as the only primitive logical (...) connectives and necessity as the only primitive modal operator. The full source code is available online and has been typechecked with Lean 3.4.2. (shrink)

En este artículo presentamos una posible vía para interpretar las nociones de posibilidad y necesidad desarrolladas en el seno de la lógica megárico-estoica como operadores modales aléticos. Se introducirá la semántica megárico-estoica como trasfondo metafísico de las definiciones de necesidad y posibilidad y se ofrecerán argumentos para abandonar las interpretaciones predominantes que incluyen variables temporales ad hoc. Tras proponer la lectura de las definiciones diodóricas desde una semántica modal relacional se señalará una serie de temas que merecen ser revisitados desde (...) esta óptica. (shrink)

We provide a fine-grained analysis of notions of regret and responsibility (such as agent-regret and individual responsibility) in terms of a language of multimodal logic. This language undergoes a detailed semantic analysis via two sorts of models: (i) relating models, which are equipped with a relation of propositional pertinence, and (ii) synonymy models, which are equipped with a relation of propositional synonymy. We specify a class of strictly relating models and show that each synonymy model can be transformed into an (...) equivalent strictly relating model. Moreover, we define an axiomatic system that captures the notion of validity in the class of all strictly relating models. (shrink)

In traditional semantics for classical logic and its extensions, such as modal logic, propositions are interpreted as subsets of a set, as in discrete duality, or as clopen sets of a Stone space, as in topological duality. A point in such a set can be viewed as a "possible world," with the key property of a world being primeness—a world makes a disjunction true only if it makes one of the disjuncts true—which classically implies totality—for each proposition, a world either (...) makes the proposition true or makes its negation true. This chapter surveys a more general approach to logical semantics, known as possibility semantics, which replaces possible worlds with possibly partial "possibilities." In classical possibility semantics, propositions are interpreted as regular open sets of a poset, as in set-theoretic forcing, or as compact regular open sets of an upper Vietoris space, as in the recent theory of "choice-free Stone duality." The elements of these sets, viewed as possibilities, may be partial in the sense of making a disjunction true without settling which disjunct is true. We explain how possibilities may be used in semantics for classical logic and modal logics and generalized to semantics for intuitionistic logics. The goals are to overcome or deepen incompleteness results for traditional semantics, to avoid the nonconstructivity of traditional semantics, and to provide richer structures for the interpretation of new languages. (shrink)

In this paper, an incompleteness theorem for modal extensions of relevant logics is proved. The proof uses elementary methods and builds upon the work of Fuhrmann.

This work aims to make tense logic a more robust tool for ontologists, philosophers, knowledge engineers and programmers by outlining a fusion of tense logic and ontology of time. In order to make tense logic better understandable, the central formal primitives of standard tense logic are derived as theorems from an informal and intuitive ontology of time. In order to make formulation of temporal propositions easier, temporal operators that were introduced by Georg Henrik von Wright are developed, and mapped to (...) the ontology of time. (shrink)

The Modal Predicate Calculus gives rise to issues surrounding the Barcan formulas, their converses, and necessary existence. I examine these issues by means of the Quantified Argument Calculus, a recently developed, powerful formal logic system. Quarc is closer in syntax and logical properties to Natural Language than is the Predicate Calculus, a fact that lends additional interest to this examination, as Quarc might offer a better representation of our modal concepts. The validity of the Barcan formulas and their converses is (...) shown by Quarc to be a result of the specific incorporation of quantification in the Predicate Calculus, and not as reflecting a feature of the interaction of quantification and modality more generally. Necessary existence is shown to follow from the identification, in the Predicate Calculus on its canonical interpretation, of particular quantification, ascription of existence and the ‘there is’ construction, three constructions which are distinguished in both Quarc and Natural Language. The issues surrounding the Barcan formulas, their converses and necessary existence are thus shown to be an artefact of a specific logic system, not an essential feature of our relevant modal concepts or of formal logic. (shrink)

In "A Problem in Possible-World Semantics," David Kaplan presented a consistent and intelligible modal principle that cannot be validated by any possible world frame (in the terminology of modal logic, any neighborhood frame). However, Kaplan's problem is tempered by the fact that his principle is stated in a language with propositional quantification, so possible world semantics for the basic modal language without propositional quantifiers is not directly affected, and the fact that on careful inspection his principle does not target the (...) world part of possible world semantics—the atomicity of the algebra of propositions—but rather the idea of propositional quantification over a complete Boolean algebra of propositions. By contrast, in this paper we present a simple and intelligible modal principle, without propositional quantifiers, that cannot be validated by any possible world frame precisely because of their assumption of atomicity (i.e., the principle also cannot be validated by any atomic Boolean algebra expansion). It follows from a theorem of David Lewis that our logic is as simple as possible in terms of modal nesting depth (two). We prove the consistency of the logic using a generalization of possible world semantics known as possibility semantics. We also prove the completeness of the logic (and two other relevant logics) with respect to possibility semantics. Finally, we observe that the logic we identify naturally arises in the study of Peano Arithmetic. (shrink)

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

Inquisitive logic is a research program seeking to expand the purview of logic beyond declarative sentences to include the logic of questions. To this end, inquisitive propositional logic extends classical propositional logic for declarative sentences with principles governing a new binary connective of inquisitive disjunction, which allows the formation of questions. Recently inquisitive logicians have considered what happens if the logic of declarative sentences is assumed to be intuitionistic rather than classical. In short, what should inquisitive logic be on an (...) intuitionistic base? In this paper, we provide an answer to this question from the perspective of nuclear semantics, an approach to classical and intuitionistic semantics pursued in our previous work. In particular, we show how Beth semantics for intuitionistic logic naturally extends to a semantics for inquisitive intuitionistic logic. In addition, we show how an explicit view of inquisitive intuitionistic logic comes via a translation into propositional lax logic, whose completeness we prove with respect to Beth semantics. (shrink)

In their presentation of canonical models for normal systems of modal logic, Hughes and Cresswell observe that some of these models are based on a frame which can be also thought of as a collection of two or more isolated frames; they call such frames ‘non-cohesive’. The problem of checking whether the canonical model of a given system is cohesive is still rather unexplored and no general decision procedure is available. The main contribution of this article consists in introducing a (...) method which is sufficient to show that canonical models of some relevant classes of normal monomodal and bimodal systems are always non-cohesive. (shrink)

Imagination has received a great deal of attention in different fields such as psychology, philosophy and the cognitive sciences, in which some works provide a detailed account of the mechanisms involved in the creation and elaboration of imaginary worlds. Although imagination has also been formalized using different logical systems, none of them captures those dynamic mechanisms. In this work, we take inspiration from the Common Frame for Imagination Acts, that identifies the different processes involved in the creation of imaginary worlds, (...) and we use it to define a dynamic formal system called the Logic of Imagination Acts. We build our logic by using a possible-worlds semantics, together with a new set of static and dynamic modal operators. The role of the new dynamic operators is to call different algorithms that encode how the formal model is expanded in order to capture the different mechanisms involved in the creation and development of imaginary worlds. We provide the definitions of the language, the semantics and the algorithms, together with an example that shows how the model is expanded. By the end, we discuss some interesting features of our system, and we point out to possible lines of future work. (shrink)

In 1988, J. Ivlev proposed some (non-normal) modal systems which are semantically characterized by four-valued non-deterministic matrices in the sense of A. Avron and I. Lev. Swap structures are multialgebras (a.k.a. hyperalgebras) of a special kind, which were introduced in 2016 by W. Carnielli and M. Coniglio in order to give a non-deterministic semantical account for several paraconsistent logics known as logics of formal inconsistency, which are not algebraizable by means of the standard techniques. Each swap structure induces naturally a (...) non-deterministic matrix. The aim of this paper is to obtain a swap structures semantics for some Ivlev-like modal systems proposed in 2015 by M. Coniglio, L. Fariñas del Cerro and N. Peron. Completeness results will be stated by means of the notion of Lindenbaum–Tarski swap structures, which constitute a natural generalization to multialgebras of the concept of Lindenbaum–Tarski algebras. (shrink)

In two of the earliest papers on extending modal logic with propositional quantifiers, R. A. Bull and K. Fine studied a modal logic S5Π extending S5 with axioms and rules for propositional quantification. Surprisingly, there seems to have been no proof in the literature of the completeness of S5Π with respect to its most natural algebraic semantics, with propositional quantifiers interpreted by meets and joins over all elements in a complete Boolean algebra. In this note, we give such a proof. (...) This result raises the question: For which normal modal logics L can one axiomatize the quantified propositional modal logic determined by the complete modal algebras for L? (shrink)

In this article, we tell a story about incompleteness in modal logic. The story weaves together an article of van Benthem, “Syntactic aspects of modal incompleteness theorems,” and a longstanding open question: whether every normal modal logic can be characterized by a class of completely additive modal algebras, or as we call them, ${\cal V}$-baos. Using a first-order reformulation of the property of complete additivity, we prove that the modal logic that starred in van Benthem’s article resolves the open question (...) in the negative. In addition, for the case of bimodal logic, we show that there is a naturally occurring logic that is incomplete with respect to ${\cal V}$-baos, namely the provability logic $GLB$. We also show that even logics that are unsound with respect to such algebras do not have to be more complex than the classical propositional calculus. On the other hand, we observe that it is undecidable whether a syntactically defined logic is ${\cal V}$-complete. After these results, we generalize the Blok Dichotomy to degrees of ${\cal V}$-incompleteness. In the end, we return to van Benthem’s theme of syntactic aspects of modal incompleteness. (shrink)

All standard epistemic logics legitimate something akin to the principle of closure, according to which knowledge is closed under competent deductive inference. And yet the principle of closure, particularly in its multiple premise guise, has a somewhat ambivalent status within epistemology. One might think that serious concerns about closure point us away from epistemic logic altogether—away from the very idea that the knowledge relation could be fruitfully treated as a kind of modal operator. This, however, need not be so. The (...) abandonment of closure may yet leave in place plenty of formal structure amenable to systematic logical treatment. In this paper we describe a family of weak epistemic logics in which closure fails, and describe two alternative semantic frameworks in which these logics can be modelled. One of these—which we term plurality semantics—is relatively unfamiliar. We explore under what conditions plurality frames validate certain much-discussed principles of epistemic logic. It turns out that plurality frames can be interpreted in a very natural way in light of one motivation for rejecting closure, adding to the significance of our technical work. The second framework that we employ—neighbourhood semantics—is much better known. But we show that it too can be interpreted in a way that comports with a certain motivation for rejecting closure. (shrink)

We present cut-free labelled sequent calculi for a central formalism in logics of agency: STIT logics with temporal operators. These include sequent systems for Ldm , Tstit and Xstit. All calculi presented possess essential structural properties such as contraction- and cut-admissibility. The labelled calculi G3Ldm and G3Tstit are shown sound and complete relative to irreflexive temporal frames. Additionally, we extend current results by showing that also Xstit can be characterized through relational frames, omitting the use of BT+AC frames.

This work provides proof-search algorithms and automated counter-model extraction for a class of STIT logics. With this, we answer an open problem concerning syntactic decision procedures and cut-free calculi for STIT logics. A new class of cut-free complete labelled sequent calculi G3LdmL^m_n, for multi-agent STIT with at most n-many choices, is introduced. We refine the calculi G3LdmL^m_n through the use of propagation rules and demonstrate the admissibility of their structural rules, resulting in auxiliary calculi Ldm^m_nL. In the single-agent case, we (...) show that the refined calculi Ldm^m_nL derive theorems within a restricted class of (forestlike) sequents, allowing us to provide proof-search algorithms that decide single-agent STIT logics. We prove that the proof-search algorithms are correct and terminate. (shrink)

In this work we answer a long standing request for temporal embeddings of deontic STIT logics by introducing the multi-agent STIT logic TDS . The logic is based upon atemporal utilitarian STIT logic. Yet, the logic presented here will be neutral: instead of committing ourselves to utilitarian theories, we prove the logic TDS sound and complete with respect to relational frames not employing any utilitarian function. We demonstrate how these neutral frames can be transformed into utilitarian temporal frames, while preserving (...) validity. Last, we discuss problems that arise from employing binary utility functions in a temporal setting. (shrink)

We investigate and compare two major approaches to enhancing the expressive capacities of modal languages, namely the addition of subjunctive markers on the one hand, and the addition of scope-bearing actuality operators, on the other. It turns out that the subjunctive marker approach is not only every bit as versatile as the actuality operator approach, but that it in fact outperforms its rival in the context of cross-world predication.

A textbook for modal and other intensional logics based on the Open Logic Project. It covers normal modal logics, relational semantics, axiomatic and tableaux proof systems, intuitionistic logic, and counterfactual conditionals.

In this paper, we introduce an extension of the modal language with what we call the global quantificational modality [∀p]. In essence, this modality combines the propositional quantifier ∀p with the global modality A: [∀p] plays the same role as the compound modality ∀pA. Unlike the propositional quantifier by itself, the global quantificational modality can be straightforwardly interpreted in any Boolean Algebra Expansion (BAE). We present a logic GQM for this language and prove that it is complete with respect to (...) the intended algebraic semantics. This logic enables a conceptual shift, as what have traditionally been called different “modal logics” now become [∀p]-universal theories over the base logic GQM: instead of defining a new logic with an axiom schema such as □φ→□□φ, one reasons in GQM about what follows from the globally quantified formula [∀p](□p→□□p). (shrink)