Weakly Aggregative Modal Logic (WAML) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. WAML has some interesting applications on epistemic logic and logic of games, so we study some basic model theoretical aspects of WAML in this paper. Specifically, we give a van Benthem-Rosen characterization theorem of WAML based on an intuitive notion of bisimulation and show that each basic WAML system Kn lacks Craig (...) Interpolation. (shrink)

A consequence relation is strongly classical if it has all the theorems and entailments of classical logic as well as the usual meta-rules (such as Conditional Proof). A consequence relation is weakly classical if it has all the theorems and entailments of classical logic but lacks the usual meta-rules. The most familiar example of a weakly classical consequence relation comes from a simple supervaluational approach to modelling vague language. This approach is formally equivalent to an account (...) of logical consequence according to which α1, ..., αn entails β just in case □α1, ..., □αn entails □β in the modal logic S5. This raises a natural question: If we start with a different underlying modal logic, can we generate a strongly classical logic? This paper explores this question. In particular, it discusses four related technical issues: (1) Which base modal logics generate strongly classical logics and which generate weakly classical logics? (2) Which base logics generate themselves? (3) How can we directly characterize the logic generated from a given base logic? (4) Given a logic that can be generated, which base logics generate it? The answers to these questions have philosophical interest. They can help us to determine whether there is a plausible supervaluational approach to modelling vague language that yields the usual meta-rules. They can also help us to determine the feasibility of other philosophical projects that rely on an analogous formalism, such as the project of defining logical consequence in terms of the preservation of an epistemic status. (shrink)

We present a number of modal logics to reason about group norms. As a preliminary step, we discuss the ontological status of the group to which the norms are applied, by adapting the classification made by Christian List of collective attitudes into aggregated, common, and corporate attitudes. Accordingly, we shall introduce modality to capture aggregated, common, and corporate group norms. We investigate then the principles for reasoning about those types of modalities. Finally, we discuss the relationship between group norms (...) and types of collective responsibility. (shrink)

Dugundji proved in 1940 that most parts of standard modal systems cannot be characterized by a single finite deterministic matrix. In the eighties, Ivlev proposed a semantics of four-valued non-deterministic matrices (which he called quasi-matrices), in order to characterize a hierarchy of weak modal logics without the necessitation rule. In a previous paper, we extended some systems of Ivlev’s hierarchy, also proposing weaker six-valued systems in which the (T) axiom was replaced by the deontic (D) axiom. In this (...) paper, we propose even weaker systems, by eliminating both axioms, which are characterized by eight-valued non-deterministic matrices. In addition, we prove completeness for those new systems. It is natural to ask if a characterization by finite ordinary (deterministic) logical matrices would be possible for all those Ivlev-like systems. We will show that finite deterministic matrices do not characterize any of them. (shrink)

This paper develops an update semantics for weak necessity modals like ‘ought’ and ‘should’. I start with the basic approach to the weak/strong necessity modal distinction developed in Silk 2018: Strong necessity modals are given their familiar semantics of necessity, predicating the necessity of the prejacent of the actual world (evaluation world). The apparent “weakness” of weak necessity modals derives from their bracketing the assumption that the relevant worlds in which the prejacent is necessary (deontically, epistemically, etc.) need be (...) candidates for actuality. ‘Should φ’ can be accepted without needing to settle that the relevant considerations (norms, preferences, expectations, etc.) that actually apply, given the facts, verify the necessity of φ. I formalize these ideas within an Update with Centering framework. The meaning of ‘Should φ’ is explained, fundamentally, in terms of how its use updates attention toward possibilities in which φ is necessary. The semantics is also extended to deontic conditionals. The proposed analyses capture various contrasting logical properties and discourse properties of ‘should’ and ‘must’ — e.g., in sensitivities to standing contextual assumptions, entailingness, and force — and provide an improved treatment of largely neglected data concerning information-sensitivity. (shrink)

Part 1 [Hodes, 2021] “looked under the hood” of the familiar versions of the classical propositional modal logic K and its intuitionistic counterpart. This paper continues that project, addressing some familiar classical strengthenings of K and GL), and their intuitionistic counterparts. Section 9 associates two intuitionistic one-step proof-theoretic systems to each of the just mentioned intuitionistic logics, this by adding for each a new rule to those which generated IK in Part 1. For the systems associated with the (...) intuitionistic counterparts of D and T, these rules are “pure one-step”: their schematic formulations does not use □ or ♢. For the systems associated with the intuitionistic counterparts of K4, etc., these rules meet these conditions: neither □ nor ♢ is iterated; none use both □ and ♢. The join of the two systems associated with each of these familiar logics is the full one-step system for that intuitionistic logic. And further “blended” intuitionistic systems arise from joining these systems in various ways. Adding the 0-version of Excluded Middle to their intuitionistic counterparts yields the one-step systems corresponding to the familiar classical logics. Each proof-theoretic system defines a consequence relation in the obvious way. Section 10 examines inclusions between these consequence relations. Section 11 associates each of the above consequence relations with an appropriate class of models, and proves them sound with respect to their appropriate class. This allows proofs of some failures of inclusion between consequence relations. Section 12 proves that the each consequence relation is complete or weakly complete, that relative to its appropriate class of models. The Appendix presents three further results about some of the intuitionistic consequence relations discussed in the body of the paper. For Keywords, see Part 1. (shrink)

This paper develops an account of the meaning of `ought', and the distinction between weak necessity modals (`ought', `should') and strong necessity modals (`must', `have to'). I argue that there is nothing specially ``strong'' about strong necessity modals per se: uses of `Must p' predicate the (deontic/epistemic/etc.) necessity of the prejacent p of the actual world (evaluation world). The apparent ``weakness'' of weak necessity modals derives from their bracketing whether the necessity of the prejacent is verified in the actual world. (...) `Ought p' can be accepted without needing to settle that the relevant considerations (norms, expectations, etc.) that actually apply verify the necessity of p. I call the basic account a modal-past approach to the weak/strong necessity modal distinction (for reasons that become evident). Several ways of implementing the approach in the formal semantics/pragmatics are critically examined. The account systematizes a wide range of linguistic phenomena: it generalizes across flavors of modality; it elucidates a special role that weak necessity modals play in discourse and planning; it captures contrasting logical, expressive, and illocutionary properties of weak and strong necessity modals; and it sheds light on how a notion of `ought' is often expressed in other languages. These phenomena have resisted systematic explanation. In closing I briefly consider how linguistic inquiry into differences among necessity modals may improve theorizing on broader philosophical issues. (shrink)

This work contributes to the theory of judgement aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgement aggregation to cope with non-classical logics, we discuss in particular results for the case of Intuitionistic Logic, the Lambek calculus, Linear Logic and Relevant Logics. The motivation for studying judgement aggregation in non-classical logics is that they offer a number of modelling choices to represent agents’ reasoning in aggregation problems. By studying judgement aggregation in (...) logics that are weaker than classical logic, we investigate whether some well-known impossibility results, that were tailored for classical logic, still apply to those weak systems. (shrink)

Actualists of a certain stripe—dispositionalists—hold that metaphysical modality is grounded in the powers of actual things. Roughly: p is possible iff something has, or some things have, the power to bring it about that p. Extant critiques of dispositionalism focus on its material adequacy, and question whether there are enough powers to account for all the possibilities we intuitively want to countenance. For instance, it seems possible that none of the actual contingent particulars ever existed, but it is impossible to (...) explain this by appealing to the powers of some actual thing or things to bring it about. I argue instead that dispositionalism, in the simple form championed by its proponents, is formally inadequate. Dispositionalists interpret the modal operators as simple existential claims about powers, but if we interpret the operators that way, the resulting system of modal logic is too weak to capture metaphysical modality. I argue that we can modify the standard dispositionalist interpretations of the operators to secure formal adequacy, but at the cost of accepting that not all modality is grounded in powers. This, I shall suggest, is not a bad thing—the resulting theory still has powers at its core and has certain attractive features, in addition to formal adequacy, that the standard theory lacks. (shrink)

A prevailing thought is that generics have a covert modal operator at logical form. I claim that if this is right, the covert generic modality is a weak necessity modal. In this paper, I pr...

The subject of the first section is Carnapian modal logic. One of the things I will do there is to prove that certain description principles, viz. the ''self-predication principles'', i.e. the principles according to which a descriptive term satisfies its own descriptive condition, are theorems and that others are not. The second section will be devoted to Carnapian modal arithmetic. I will prove that, if the arithmetical theory contains the standard weak principle of induction, modal truth (...) collapses to truth. Then I will propose a different formulation of Carnapian modal arithmetic and establish that it is free of collapse. Noteworthy is that one can retain the standard strong principle of induction. I will occupy myself in the third section with Carnapian epistemic logic and arithmetic. Here too it is claimed that the standard weak principle of induction is invalid and that the alternative principle is valid. In the fourth and last section I will get back to the self-predication principles and I will point to some of the consequences if one adds them to Carnapian Epistemic arithmetic. The interaction of self-predication principles and the strong principle of induction results in a collapse of de re knowability. (shrink)

The dogma that the propositional logic of metaphysical modality is S5 is rebutted. The author exposes fallacies in standard arguments supporting S5, arguing that propositional metaphysical modal logic is weaker even than both S4 and B, and is instead the minimal and weak metaphysical-modal logic T.

We present epistemic multilateral logic, a general logical framework for reasoning involving epistemic modality. Standard bilateral systems use propositional formulae marked with signs for assertion and rejection. Epistemic multilateral logic extends standard bilateral systems with a sign for the speech act of weak assertion (Incurvati and Schlöder 2019) and an operator for epistemic modality. We prove that epistemic multilateral logic is sound and complete with respect to the modal logic S5 modulo an appropriate translation. The (...) logical framework developed provides the basis for a novel, proof-theoretic approach to the study of epistemic modality. To demonstrate the fruitfulness of the approach, we show how the framework allows us to reconcile classical logic with the contradictoriness of so-called Yalcin sentences and to distinguish between various inference patterns on the basis of the epistemic properties they preserve. (shrink)

ABSTRACTLinguistic evidence supports the claim that certain, weak rejections are less specific than assertions. On the basis of this evidence, it has been argued that rejected sentences cannot be premisses and conclusions in inferences. We give examples of inferences with weakly rejected sentences as premisses and conclusions. We then propose a logic of weak rejection which accounts for the relevant phenomena and is motivated by principles of coherence in dialogue. We give a semantics for which this logic (...) is sound and complete, show that it axiomatizes the modal logic KD45 and prove that it still derives classical logic on its asserted fragment. Finally, we defend previous logics of strong rejection as being about the linguistically preferred interpretations of weak rejections. (shrink)

Some central epistemological notions are expressed by sentential operators O that entail the possibility of knowledge in the sense that 'Op' entails 'It is possible to know that p'. We call these modal-epistemological notions. Using apriority and being in a position to know as case studies, we argue that the logics of modal epistemological notions are extremely weak. In particular, their logics are not normal and do not include any closure principles.

We present an inferentialist account of the epistemic modal operator might. Our starting point is the bilateralist programme. A bilateralist explains the operator not in terms of the speech act of rejection ; we explain the operator might in terms of weak assertion, a speech act whose existence we argue for on the basis of linguistic evidence. We show that our account of might provides a solution to certain well-known puzzles about the semantics of modal vocabulary whilst retaining (...) classical logic. This demonstrates that an inferentialist approach to meaning can be successfully extended beyond the core logical constants. (shrink)

Though the study of grounding is still in the early stages, Kit Fine, in ”The Pure Logic of Ground”, has made a seminal attempt at formalization. Formalization of this sort is supposed to bring clarity and precision to our theorizing, as it has to the study of other metaphysically important phenomena, like modality and vagueness. Unfortunately, as I will argue, Fine ties the formal treatment of grounding to the obscure notion of a weak ground. The obscurity of weak ground, (...) together with its centrality in Fine’s system, threatens to undermine the extent to which this formalization offers clarity and precision. In this paper, I show how to overcome this problem. I describe a system, the logic of strict ground (LSG) and demonstrate its adequacy; I specify a translation scheme for interpreting Fine’s weak grounding claims; I show that the interpretation verifies all of the principles of Fine’s system; and I show that derivability in Fine’s system can be exactly characterized in terms of derivability in LSG. I conclude that Fine’s system is reducible to LSG. (shrink)

The new field of judgment aggregation aims to merge many individual sets of judgments on logically interconnected propositions into a single collective set of judgments on these propositions. Judgment aggregation has commonly been studied using classical propositional logic, with a limited expressive power and a problematic representation of conditional statements ("if P then Q") as material conditionals. In this methodological paper, I present a simple unified model of judgment aggregation in general logics. I show how many realistic decision problems (...) can be represented in it. This includes decision problems expressed in languages of classical propositional logic, predicate logic (e.g. preference aggregation problems), modal or conditional logics, and some multi-valued or fuzzy logics. I provide a list of simple tools for working with general logics, and I prove impossibility results that generalise earlier theorems. (shrink)

Recent research on algebraic models of _quasi-Nelson logic_ has brought new attention to a number of classes of algebras which result from enriching (subreducts of) Heyting algebras with a special modal operator, known in the literature as a _nucleus_. Among these various algebraic structures, for which we employ the umbrella term _intuitionistic modal algebras_, some have been studied since at least the 1970s, usually within the framework of topology and sheaf theory. Others may seem more exotic, for their (...) primitive operations arise from algebraic terms of the intuitionistic modal language which have not been previously considered. We shall for instance investigate the variety of _weak implicative semilattices_, whose members are (non-necessarily distributive) meet semilattices endowed with a nucleus and an implication operation which is not a relative pseudo-complement but satisfies the postulates of Celani and Jansana’s strict implication. For each of these new classes of algebras we establish a representation and a topological duality which generalize the known ones for Heyting algebras enriched with a nucleus. (shrink)

We introduce a number of logics to reason about collective propositional attitudes that are defined by means of the majority rule. It is well known that majoritarian aggregation is subject to irrationality, as the results in social choice theory and judgment aggregation show. The proposed logics for modelling collective attitudes are based on a substructural propositional logic that allows for circumventing inconsistent outcomes. Individual and collective propositional attitudes, such as beliefs, desires, obligations, are then modelled by means of minimal (...) modalities to ensure a number of basic principles. In this way, a viable consistent modelling of collective attitudes is obtained. (shrink)

Rosenkranz has recently proposed a logic for propositional, non-factive, all-things-considered justification, which is based on a logic for the notion of being in a position to know, 309–338 2018). Starting from three quite weak assumptions in addition to some of the core principles that are already accepted by Rosenkranz, I prove that, if one has positive introspective and modally robust knowledge of the axioms of minimal arithmetic, then one is in a position to know that a sentence is (...) not provable in minimal arithmetic or that the negation of that sentence is not provable in minimal arithmetic. This serves as the formal background for an example that calls into question the correctness of Rosenkranz’s logic of justification. (shrink)

At first glance, impossible world semantics appear to be useful adaptations of normal modal logic. Proponents of impossible worlds argue, e.g., that in the context of metaphysical disagreement, impossible worlds would provide a key to modelling the respective dispute situation. The same philosophers also argue that we need impossible worlds to model what they consider to be the conceivability of logical impossibilities. With the help of Wittgenstein’s early philosophy, or, better said, with what I believe to be a (...) visualisation of his ideas on nesting models for possibility, I develop some thoughts on the likely shared weaknesses of such arguments for nonnormal world approaches. Said goes hand in hand with the supplementary proposal of rethinking our conventional nesting models for possibility. (shrink)

We propose a logic to reason about data collected by a num- ber of measurement systems. The semantic of this logic is grounded on the epistemic theory of measurement that gives a central role to measure- ment devices and calibration. In this perspective, the lack of evidences (in the available data) for the truth or falsehood of a proposition requires the introduction of a third truth-value (the undetermined). Moreover, the data collected by a given source are here represented (...) by means of a possible world, which provide a contextual view on the objects in the domain. We approach (possibly) conflicting data coming from different sources in a social choice theoretic fashion: we investigate viable opera- tors to aggregate data and we represent them in our logic by means of suitable (minimal) modal operators. (shrink)

The present thesis focuses on counterfactuals. Specifically, we will address new questions and open problems that arise for the standard semantic accounts of counterfactual conditionals. The first four chapters deal with the Lewisian semantic account of counterfactuals. On a technical level, we contribute by providing an equivalent algebraic semantics for Lewis' variably strict conditional logics, which is notably absent in the literature. We introduce a new kind of algebra and differentiate between local and global versions of each of Lewis' variably (...) strict conditional logics. We study the algebraic properties of Lewis' logics and the structure theory of our newly introduced algebras. Additionally, we employ a new algebraic construction, based on the framework of Boolean algebras of conditionals, to provide an alternative semantics for Lewisian counterfactual conditionals. This semantic account allows us to establish new truth conditions for Lewisian counterfactuals, implying that Lewisian counterfactuals are definable conditionals, and each counterfactual can be characterized as a modality of a corresponding probabilistic conditional. We further extend these results by demonstrating that each Lewisian counterfactual can also be characterized as a modality of the corresponding Stalnaker conditional. The resulting formal semantic framework is much more expressive than the standard one and, in addition to providing new truth conditions for counterfactuals, it also allows us to define a new class of conditional logics falling into the broader framework of weak logics. On the philosophical side, we argue that our results shed new light on the understanding of Lewisian counterfactuals and prompt a conceptual shift in this field: Lewisian counterfactual dependence can be understood as a modality of probabilistic conditional dependence or Stalnakerian conditional dependence. In other words, whether a counterfactual connection occurs between A and B depends on whether it is "necessary" for a Stalnakerian/probabilistic dependence to occur between A and B. We also propose some ways to interpret the kind of necessity involved in this interpretation. The remaining two chapters deal with the probability of counterfactuals. We provide an answer to the question of how we can characterize the probability that a Lewisian counterfactual is true, which is an open problem in the literature. We show that the probability of a Lewisian counterfactual can be characterized in terms of belief functions from Dempster-Shafer theory of evidence, which are a super-additive generalization of standard probability. We define an updating procedure for belief functions based on the imaging procedure and show that the probability of a counterfactual A > B amounts to the belief function of B imaged on A. This characterization strongly relies on the logical results we proved in the previous chapters. Moreover, we also solve an open problem concerning the procedure to assign a probability to complex counterfactuals in the framework of causal modelling semantics. A limitation of causal modelling semantics is that it cannot account for the probability of counterfactuals with disjunctive antecedents. Drawing on the same previous works, we define a new procedure to assign a probability to counterfactuals with disjunctive antecedents in the framework of causal modelling semantics. We also argue that our procedure is satisfactory in that it yields meaningful results and adheres to some conceptually intuitive constraints one may want to impose when computing the probability of counterfactuals. (shrink)

In this essay, I consider some logical treatises and commentaries from the first decades of the 12th century (many of which are still unedited) which contain a discussion on modalities and modal logic. After presenting a short catalogue of these sources and a description of their common features, I shall focus on some definitions of the modal term “necessarium” which are provided in them. As we will see, Abelard and logicians of his time advanced three different characterizations (...) of this term: necessity was either defined in terms of unavoidability (ineuitabilitas), or in terms of immutability and omnitemporality (impermutabilitas, sempiternitas), or again in terms of absolute necessity as opposed to conditioned one (necessitas absoluta vs. determinata). I argue that the temporal understanding of necessity in terms of omnitemporality, inherited from ancient sources and extensively used by Abelard and others in the first years of the twelfth-century, started to disappear in texts datable from around the 1120, perhaps due to several difficulties that were related to this definition when applied in logical contexts. I also discuss how the notion of necessitas determinata was used by Abelard’s contemporaries to qualify the modal status of present and past events, which were generally believed to be necessary only in a “weak” and harmless sense that did not prevent them from being contingent. -/- . (shrink)

Augment the propositional language with two modal operators: □ and ■. Define ⧫ to be the dual of ■, i.e. ⧫=¬■¬. Whenever (X) is of the form φ → ψ, let (X⧫) be φ→⧫ψ . (X⧫) can be thought of as the modally qualified counterpart of (X)—for instance, under the metaphysical interpretation of ⧫, where (X) says φ implies ψ, (X⧫) says φ implies possibly ψ. This paper shows that for various interesting instances of (X), fairly weak assumptions suffice (...) for (X⧫) to imply (X)—so, the modally qualified principle is as strong as its unqualified counterpart. These results have surprising and interesting implications for issues spanning many areas of philosophy. (shrink)

Informal rigour is the process by which we come to understand particular mathematical structures and then manifest this rigour through axiomatisations. Structural relativity is the idea that the kinds of structures we isolate are dependent upon the logic we employ. We bring together these ideas by considering the level of informal rigour exhibited by our set-theoretic discourse, and argue that different foundational programmes should countenance different underlying logics (intermediate between first- and second-order) for formulating set theory. By bringing considerations (...) of perturbations in modal space to bear on the debate, we will suggest that a promising option for representing current set-theoretic thought is given by formulating set theory using quasi-weak second-order logic. These observations indicate that the usual division of structures into \particular (e.g. the natural number structure) and general (e.g. the group structure) is perhaps too coarse grained; we should also make a distinction between intentionally and unintentionally general structures. (shrink)

Many classically valid meta-inferences fail in a standard supervaluationist framework. This allegedly prevents supervaluationism from offering an account of good deductive reasoning. We provide a proof system for supervaluationist logic which includes supervaluationistically acceptable versions of the classical meta-inferences. The proof system emerges naturally by thinking of truth as licensing assertion, falsity as licensing negative assertion and lack of truth-value as licensing rejection and weak assertion. Moreover, the proof system respects well-known criteria for the admissibility of inference rules. Thus, (...) supervaluationists can provide an account of good deductive reasoning. Our proof system moreover brings to light how one can revise the standard supervaluationist framework to make room for higher-order vagueness. We prove that the resulting logic is sound and complete with respect to the consequence relation that preserves truth in a model of the non-normal modal logic _NT_. Finally, we extend our approach to a first-order setting and show that supervaluationism can treat vagueness in the same way at every order. The failure of conditional proof and other meta-inferences is a crucial ingredient in this treatment and hence should be embraced, not lamented. (shrink)

Sorensen (1992) has provided two modal-logical schemas to reconstruct the logical structure of two types of destructive thought experiments: the Necessity Refuter and the Possibility Refuter. The schemas consist of five propositions which Sorensen claims but does not prove to be inconsistent.We show that the five propositions, as presented by Sorensen, are not inconsistent, but by adding a premise (and a logical truth), we prove that the resulting sextet of premises is inconsistent. Häggqvist (2009) has provided a different (...) class='Hi'>modal-logical schema (Counterfactual Refuter), which is equivalent to four premises, again claimed to be inconsistent. We show that this schema also is not inconsistent, for similar reasons. Again, we add another premise to achieve inconsistency. The conclusion is that all three modal-logical reconstructions of the arguments that accompany thought experiments, two by Sorensen and one by Häggqvist, have now been made rigorously correct. This may inaugurate new avenues to respond to destructive thought experiments. (shrink)

We investigate an enrichment of the propositional modal language L with a "universal" modality ■ having semantics x ⊧ ■φ iff ∀y(y ⊧ φ), and a countable set of "names" - a special kind of propositional variables ranging over singleton sets of worlds. The obtained language ℒ $_{c}$ proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment ℒ(⍯) of ℒ, where ⍯ is an additional modality with the semantics x (...) ⊧ ⍯φ iff Vy(y ≠ x → y ⊧ φ). Model-theoretic characterizations of modal definability in these languages are obtained. Further we consider deductive systems in ℒ $_{c}$ . Strong completeness of the normal ℒ $_{c}$ logics is proved with respect to models in which all worlds are named. Every ℒ $_{c}$ -logic axiomatized by formulae containing only names (but not propositional variables) is proved to be strongly frame-complete. Problems concerning transfer of properties ([in]completeness, filtration, finite model property etc.) from ℒ to ℒ $_{c}$ are discussed. Finally, further perspectives for names in multimodal environment are briefly sketched. (shrink)

A modal logic for representing analogical proportions is presented. This logic is a modal interpretation of H. Prade and G. Richard's homogeneous analogy. A tableaux system is given with some examples an intuitions.

We introduce and study a variety of modal logics of parallelism, orthogonality, and affine geometries, for which we establish several completeness, decidability and complexity results and state a number of related open, and apparently difficult problems. We also demonstrate that lack of the finite model property of modal logics for sufficiently rich affine or projective geometries (incl. the real affine and projective planes) is a rather common phenomenon.

We study the modal logic M L r of the countable random frame, which is contained in and `approximates' the modal logic of almost sure frame validity, i.e. the logic of those modal principles which are valid with asymptotic probability 1 in a randomly chosen finite frame. We give a sound and complete axiomatization of M L r and show that it is not finitely axiomatizable. Then we describe the finite frames of that (...) class='Hi'>logic and show that it has the finite frame property and its satisfiability problem is in EXPTIME. All these results easily extend to temporal and other multi-modal logics. Finally, we show that there are modal formulas which are almost surely valid in the finite, yet fail in the countable random frame, and hence do not follow from the extension axioms. Therefore the analog of Fagin's transfer theorem for almost sure validity in first-order logic fails for modal logic. (shrink)

Modal logic is one of philosophy’s many children. As a mature adult it has moved out of the parental home and is nowadays straying far from its parent. But the ties are still there: philosophy is important to modal logic, modal logic is important for philosophy. Or, at least, this is a thesis we try to defend in this chapter. Limitations of space have ruled out any attempt at writing a survey of all the (...) work going on in our field—a book would be needed for that. Instead, we have tried to select material that is of interest in its own right or exemplifies noteworthy features in interesting ways. Here are some themes that have guided us throughout the writing: • The back-and-forth between philosophy and modal logic. There has been a good deal of give-and-take in the past. Carnap tried to use his modal logic to throw light on old philosophical questions, thereby inspiring others to continue his work and still others to criticise it. He certainly provoked Quine, who in his turn provided—and continues to provide—a healthy challenge to modal logicians. And Kripke’s and David Lewis’s philosophies are connected, in interesting ways, with their modal logic. Analytic philosophy would have been a lot different without modal logic! • The interpretation problem. The problem of providing a certain modal logic with an intuitive interpretation should not be conflated with the problem of providing a formal system with a model-theoretic semantics. An intuitively appealing model-theoretic semantics may be an important step towards solving the interpretation problem, but only a step. One may compare this situation with that in probability theory, where definitions of concepts like ‘outcome space’ and ‘random variable’ are orthogonal to questions about “interpretations” of the concept of probability. • The value of formalisation. Modal logic sets standards of precision, which are a challenge to—and sometimes a model for—philosophy. Classical philosophical questions can be sharpened and seen from a new perspective when formulated in a framework of modal logic. On the other hand, representing old questions in a formal garb has its dangers, such as simplification and distortion. • Why modal logic rather than classical (first or higher order) logic? The idioms of modal logic—today there are many!—seem better to correspond to human ways of thinking than ordinary extensional logic. (Cf. Chomsky’s conjecture that the NP + VP pattern is wired into the human brain.) In his An Essay in Modal Logic (1951) von Wright distinguished between four kinds of modalities: alethic (modes of truth: necessity, possibility and impossibility), epistemic (modes of being known: known to be true, known to be false, undecided), deontic (modes of obligation: obligatory, permitted, forbidden) and existential (modes of existence: universality, existence, emptiness). The existential modalities are not usually counted as modalities, but the other three categories are exemplified in three sections into which this chapter is divided. Section 1 is devoted to alethic modal logic and reviews some main themes at the heart of philosophical modal logic. Sections 2 and 3 deal with topics in epistemic logic and deontic logic, respectively, and are meant to illustrate two different uses that modal logic or indeed any logic can have: it may be applied to already existing (non-logical) theory, or it can be used to develop new theory. (shrink)

Vagueness does not necessarily come in with vague predicates, nor need it be expressed by them , but undoubtedly 'vague predicates' are traditionally in the focus of main stream discussions of vagueness. In her current modal logic presentation and discussion of the Sorites paradox Susanne Bobzien[1] lists among the properties of a Sorites series a rather weak modal tolerance principle governing the 'grey zone' containing the borderline cases of the Sorites series, which later proves crucial for her (...) solution of the Sorites paradox by use of epistemic interpreted modal operators in 1st order modal logic. We suggest (for different research interest) instead a non-modal description of the switch in the grey zone (respecting tolerance), by resort to similarity sequences, thus getting tangent to two other areas of research in the field. Let's say -any way- the Sorites paradox vanishes, the Sorites series does not. (shrink)

In this paper the propositional logic LTop is introduced, as an extension of classical propositional logic by adding a paraconsistent negation. This logic has a very natural interpretation in terms of topological models. The logic LTop is nothing more than an alternative presentation of modal logic S4, but in the language of a paraconsistent logic. Moreover, LTop is a logic of formal inconsistency in which the consistency and inconsistency operators have a nice (...) topological interpretation. This constitutes a new proof of S4 as being "the logic of topological spaces", but now under the perspective of paraconsistency. (shrink)

ABSTRACT: The modal systems of the Stoic logician Chrysippus and the two Hellenistic logicians Philo and Diodorus Cronus have survived in a fragmentary state in several sources. From these it is clear that Chrysippus was acquainted with Philo’s and Diodorus’ modal notions, and also that he developed his own in contrast of Diodorus’ and in some way incorporated Philo’s. The goal of this paper is to reconstruct the three modal systems, including their modal definitions and (...) class='Hi'>modal theorems, and to make clear the exact relations between them; moreover, to elucidate the philosophical reasons that may have led Chrysippus to modify his predessors’ modal concept in the way he did. It becomes apparent that Chrysippus skillfully combined Philo’s and Diodorus’ modal notions, with making only a minimal change to Diodorus’ concept of possibility; and that he thus obtained a modal system of modalities (logical and physical) which fit perfectly fit into Stoic philosophy. (shrink)

We study the general problem of axiomatizing structures in the framework of modal logic and present a uniform method for complete axiomatization of the modal logics determined by a large family of classes of structures of any signature.

This collection serves as an introduction to the concept of subjective fact, which plays a central role in some of the author's philosophical writings. The collection contains two book chapters and a paper. The first chapter (Chapter 2 of From Brain to Cosmos) begins with an informal characterization of the concept of subjective fact. Then it fleshes out this concept with examples, gives a more precise characterization, and addresses some potential weaknesses of the concept. This chapter shows how subjective fact (...) is related to key ideas in the philosophy of mind, such as intentionality. The second chapter (Chapter 3) is a detailed study of the concept of “instance of seeming” that was introduced in Chapter 2. Chapter 3 ends with some remarks on the modal logic of subjective facts. The paper, also by the book’s author, answers some potential questions about the ideas in the two included chapters. (shrink)

Fragmentalism allows incompatible facts to constitute reality in an absolute manner, provided that they fail to obtain together. In recent years, the view has been extensively discussed, with a focus on its formalisation in model-theoretic terms. This paper focuses on three formalisations: Lipman’s approach, the subvaluationist interpretation, and a novel view that has been so far overlooked. The aim of the paper is to explore the application of these formalisations to the alethic modal case. This logical exploration will allow (...) us to study (i) cases of metaphysical incompatibility between modal facts and (ii) cases of modal dialetheias. In turn, this will enrich our understanding of the role of impossibility in the fragmentalist framework. (shrink)

ABSTRACTHegel's Phenomenology of Spirit provides a fascinating picture of individual minds caught up in “recognitive” relations so as to constitute a realm—“spirit”—which, while necessarily embedded in nature, is not reducible to it. In this essay I suggest a contemporary path for developing Hegel's suggestive ideas in a way that broadly conforms to the demands of his own system, such that one moves from logic to a philosophy of mind. Hence I draw on Hegel's “subjective logic”, understood in the (...) light of modern modal logic, in an attempt to model the way minds might be thought as connected by way of shared intentional contents. Here, we should not be surprised at some of the parallels that emerge between the approaches of Hegel and the modal logician Arthur Prior, as Prior had testified to the influence of his teacher, John N. Findlay, who himself had strong Hegelian leanings. In the final section, Robert Stalnaker's version of possible-world semantics is suggested as a framework within which Hegel's recognitive account of the mind might be understood. (shrink)

이 책자는 형식 논리의 일종인 양상논리에 입문하고 싶으신 분들을 위한 짧은 교재입니다. “양상논리 맛보기” 라는 말마따나, 이 책자는 양상논리에 관심은 있지만 아직 본격적으로 공부를 시작하진 않은 분들께서 ‘맛보기’를 하기에 적합한 안내 책자입니다. 아무쪼록 이 책자가 양상논리를 공부해나가시는데 유용한 첫 발판이 될 수 있기를 바랍니다. / This booklet is a Korean adaptation and translation of Part VIII of forall x: Calgary (Fall 2021 edition), which is intended to be introductory material for modal logic. The original text is based on (...) Robert Trueman's A Modal Logic Primer, which is revised and expanded by Richard Zach and Aaron Thomas-Bolduc in forall x: Calgary. (forall x: Calgary is based on forall x: Cambridge by Tim Button, which is in turn based on forall x by P. D. Magnus, and also includes material from forall x: Lorain County Remix by Cathal Woods and J. Robert Loftis.) This booklet is licensed under a Creative Commons Attribution 4.0 license. (shrink)

kk states that knowing entails knowing that one knows, and K¬K states that not knowing entails knowing that one does not know. In light of the arguments against kk and K¬K⁠, one might consider modally qualified variants of those principles. According to weak kk, knowing entails the possibility of knowing that one knows. And according to weakK¬K⁠, not knowing entails the possibility of knowing that one does not know. This paper shows that weak kk and weakK¬K are much stronger than (...) they initially appear. Jointly, they entail kk and K¬K⁠. And they are susceptible to variants of the standard arguments against kk and K¬K⁠. This has interesting implications for the debate on positive introspection and for deeper issues concerning the structure and limits of knowability. (shrink)

Complete deductive systems are constructed for the non-valid (refutable) formulae and sequents of some propositional modal logics. Thus, complete syntactic characterizations in the sense of Lukasiewicz are established for these logics and, in particular, purely syntactic decision procedures for them are obtained. The paper also contains some historical remarks and a general discussion on refutation systems.

I consider the first-order modal logic which counts as valid those sentences which are true on every interpretation of the non-logical constants. Based on the assumptions that it is necessary what individuals there are and that it is necessary which propositions are necessary, Timothy Williamson has tentatively suggested an argument for the claim that this logic is determined by a possible world structure consisting of an infinite set of individuals and an infinite set of worlds. He notes (...) that only the cardinalities of these sets matters, and that not all pairs of infinite sets determine the same logic. I use so-called two-cardinal theorems from model theory to investigate the space of logics and consequence relations determined by pairs of infinite sets, and show how to eliminate the assumption that worlds are individuals from Williamson’s argument. (shrink)

In this work we propose an encoding of Reiter’s Situation Calculus solution to the frame problem into the framework of a simple multimodal logic of actions. In particular we present the modal counterpart of the regression technique. This gives us a theorem proving method for a relevant fragment of our modal logic.

We introduce a modal expansion of paraconsistent Nelson logic that is also as a generalization of the Belnapian modal logic recently introduced by Odintsov and Wansing. We prove algebraic completeness theorems for both logics, defining and axiomatizing the corresponding algebraic semantics. We provide a representation for these algebras in terms of twiststructures, generalizing a known result on the representation of the algebraic counterpart of paraconsistent Nelson logic.

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

In proof-theoretic semantics, meaning is based on inference. It may be seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional logic have been explored by several authors. In this paper, we develop base-extension semantics for the classical propositional modal systems (...) K, KT , K4, and S4, with □ as the primary modal operator. We establish appropriate soundness and completeness theorems and establish the duality between □ and a natural presentation of ♢. We also show that our semantics is in its current form not complete with respect to euclidean modal logics. Our formulation makes essential use of relational structures on bases. (shrink)