Scroggs's theorem on the extensions of S5 is an early landmark in the modern mathematical studies of modal logics. From it, we know that the lattice of normal extensions of S5 is isomorphic to the inverse order of the natural numbers with infinity and that all extensions of S5 are in fact normal. In this paper, we consider extending Scroggs's theorem to modal logics with propositional quantifiers governed by the axioms and rules analogous to the (...) usual ones for ordinary quantifiers. We call them Π-logics. Taking S5Π, the smallest normal Π-logic extending S5, as the natural counterpart to S5 in Scroggs's theorem, we show that all normal Π-logics extending S5Π are complete with respect to their complete simple S5 algebras, that they form a lattice that is isomorphic to the lattice of the open sets of the disjoint union of two copies of the one-point compactification of N, that they have arbitrarily high Turing-degrees, and that there are non-normal Π-logics extending S5Π. (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)

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)

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.

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)

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.

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 determine the modal logic of fixed-point models of truth and their axiomatizations by Solomon Feferman via Solovay-style completeness results.

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 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)

Intuitionistic logic provides an elegant solution to the Sorites Paradox. Its acceptance has been hampered by two factors. First, the lack of an accepted semantics for languages containing vague terms has led even philosophers sympathetic to intuitionism to complain that no explanation has been given of why intuitionistic logic is the correct logic for such languages. Second, switching from classical to intuitionistic logic, while it may help with the Sorites, does not appear to offer any advantages when dealing with the (...) so-called paradoxes of higher-order vagueness. We offer a proposal that makes strides on both issues. We argue that the intuitionist’s characteristic rejection of any third alethic value alongside true and false is best elaborated by taking the normal modal system S4M to be the sentential logic of the operator ‘it is clearly the case that’. S4M opens the way to an account of higher-order vagueness which avoids the paradoxes that have been thought to infect the notion. S4M is one of the modal counterparts of the intuitionistic sentential calculus and we use this fact to explain why IPC is the correct sentential logic to use when reasoning with vague statements. We also show that our key results go through in an intuitionistic version of S4M. Finally, we deploy our analysis to reply to Timothy Williamson’s objections to intuitionistic treatments of vagueness. (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)

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

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)

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 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)

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)

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)

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.

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)

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)

A brief overview of the system S5 in modal logic as defined by Brian F. Chellas, author of "Modal Logic: An Introduction." The history and usage of modal logic are given mention, along with some applications. Very much a draft. Written for PhileInSophia on July 5, 2021.

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.

The contemporary versions of the ontological argument that originated from Charles Hartshorne are formalized proofs based on unique modal theories. The simplest well-known theory of this kind arises from the b system of modal logic by adding two extra-logical axioms: “If the perfect being exists, then it necessarily exists‘ and “It is possible that the perfect being exists‘. In the paper a similar argument is presented, however none of the systems of modal logic is relevant to it. (...) Its only premises are the axiom and, instead of, the new axiom : “If the perfect being doesn’t exist, it necessarily doesn’t‘. The main goal of the work is to prove that is no more controversial than and -- in consequence -- the whole strength of the modal ontological argument lies in the set of its extra-logical premises. In order to do that, three arguments are formulated: ontological, “cosmological‘ and metalogical. (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)

Some philosophers advance the claim that the phenomena of logical omniscience and of the indiscernibility of metaphysical statements, which arise in (certain) interpretations of normal modal logic, provide strong reasons in favour of impossible world approaches. These two specific lines of argument will be presented and discussed in this paper. Contrary to the recent much-held view that the characteristics of these two phenomena provide us with strong reasons to adopt impossible world approaches, the view defended here is that no (...) such ‘knock-down arguments’ do emanate on those grounds. This is not to rule out that there cannot be any other good reasons for assuming impossible world semantics. However, the discussion of a further argument for impossible worlds will suggest that different attempts to argue for them likely present intertwined problems. (shrink)

A fundamental question asked in modal logic is whether a given theory is consistent. But consistent with what? A typical way to address this question identifies a choice of background knowledge axioms (say, S4, D, etc.) and then shows the assumptions codified by the theory in question to be consistent with those background axioms. But determining the specific choice and division of background axioms is, at least sometimes, little more than tradition. This paper introduces generic theories for propositional (...) class='Hi'>modal logic to address consistency results in a more robust way. As building blocks for background knowledge, generic theories provide a standard for categorical determinations of consistency. We argue that the results and methods of this paper help to elucidate problems in epistemology and enjoy sufficient scope and power to have purchase on problems bearing on modalities in judgement, inference, and decision making. (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)

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.

In this thesis we present two logical systems, $\bf MP$ and $\MP$, for the purpose of reasoning about knowledge and effort. These logical systems will be interpreted in a spatial context and therefore, the abstract concepts of knowledge and effort will be defined by concrete mathematical concepts.

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.

Possible worlds are commonly seen as an interpretation of modal operators such as "possible" and "necessary". Here, we develop possible world semantics (PWS) which can be expressed in basic set theory and first-order logic, thus offering a reductionist account of modality. Specifically, worlds are understood as complete sets of statements and possible worlds are sets whose statements are consistent with a set of conceptual laws. We introduce the construction calculus (CC), a set of axioms and rules for truth, possibility, (...) worldness and consistency. We show that CC allows to prove fundamental theorems about necessity, possibility, impossibility and contigency, thus demonstrating prima-facie plausibility of PWS. Finally, we discuss the explanatory power of our approach and draw connections between our account and established philosophical conceptions of possible worlds. (shrink)

ABSTRACT: This 1974 paper builds on our 1969 paper (Corcoran-Weaver [2]). Here we present three (modal, sentential) logics which may be thought of as partial systematizations of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of these three logics coincide with one another and with those of standard formalizations of Lewis's S5. These logics, when regarded as logistic systems (cf. Corcoran [1], p. 154), are (...) seen to be equivalent; but, when regarded as consequence systems (ibid., p. 157), one diverges from the others in a fashion which suggests that two standard measures of semantic complexity may not be as closely linked as previously thought. -/- This 1974 paper uses the linear notation for natural deduction presented in [2]: each two-dimensional deduction is represented by a unique one-dimensional string of characters. Thus obviating need for two-dimensional trees, tableaux, lists, and the like—thereby facilitating electronic communication of natural deductions. The 1969 paper presents a (modal, sentential) logic which may be thought of as a partial systematization of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of this logic coincides those of standard formalizations of Lewis’s S4. Among the paper's innovations is its treatment of modal logic in the setting of natural deduction systems--as opposed to axiomatic systems. The author’s apologize for the now obsolete terminology. For example, these papers speak of “a proof of a sentence from a set of premises” where today “a deduction of a sentence from a set of premises” would be preferable. 1. Corcoran, John. 1969. Three Logical Theories, Philosophy of Science 36, 153–77. J P R -/- 2. Corcoran, John and George Weaver. 1969. Logical Consequence in Modal Logic: Natural Deduction in S5 Notre Dame Journal of Formal Logic 10, 370–84. MR0249278 (40 #2524). 3. Weaver, George and John Corcoran. 1974. Logical Consequence in Modal Logic: Some Semantic Systems for S4, Notre Dame Journal of Formal Logic 15, 370–78. MR0351765 (50 #4253). (shrink)

Many authors have noted that there are types of English modal sentences cannot be formalized in the language of basic first-order modal logic. Some widely discussed examples include “There could have been things other than there actually are” and “Everyone who is actually rich could have been poor.” In response to this lack of expressive power, many authors have discussed extensions of first-order modal logic with two-dimensional operators. But claims about the relative expressive power of these extensions (...) are often justified only by example rather than by rigorous proof. In this paper, we provide proofs of many of these claims and present a more complete picture of the expressive landscape for such languages. (shrink)

In a previous work we introduced the algorithm \SQEMA\ for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general correspondence and canonical completeness result. \SQEMA\ is based on transformation rules, the most important of which employs a modal version of a result by Ackermann that enables elimination of an existentially quantified predicate variable in a formula, provided a certain negative polarity condition on that variable is satisfied. In this paper we develop several (...) extensions of \SQEMA\ where that syntactic condition is replaced by a semantic one, viz. downward monotonicity. For the first, and most general, extension \SSQEMA\ we prove correctness for a large class of modal formulae containing an extension of the Sahlqvist formulae, defined by replacing polarity with monotonicity. By employing a special modal version of Lyndon's monotonicity theorem and imposing additional requirements on the Ackermann rule we obtain restricted versions of \SSQEMA\ which guarantee canonicity, too. (shrink)

We introduce now for the first time the neutrosophic modal logic. The Neutrosophic Modal Logic includes the neutrosophic operators that express the modalities. It is an extension of neutrosophic predicate logic and of neutrosophic propositional logic.

A certain type of inference rules in modal logics, generalizing Gabbay's Irreflexivity rule, is introduced and some general completeness results about modal logics axiomatized with such rules are proved.

The passionate and staunch defence of logic of the controversial thinker Ibn Ḥazm, Abū Muḥammad ʿAlī b. Aḥmad b. Saʿīd of Córdoba (384-456/994-1064), had lasting consequences in the Islamic world. Indeed, his book Facilitating the Understanding of the Rules of Logic and Introduction Thereto, with Common Expressions and Juristic Examples (Kitāb al-Taqrīb li-ḥadd al-manṭiq wa-l-mudkhal ilayhi bi-l-alfāẓ al-ʿāmmiyya wa-l-amthila al-fiqhiyya), composed in 1025-1029, was well known and discussed during and after his time; and it paved the way for the studies (...) of his compatriots Ibn Bājjah (d. 1138), Ibn Ṭufayl (1185), and Ibn Rushd (1198), who each gave demonstrative reasoning a privileged place within the methods of attaining knowledge. Unfortunately, as too often in the history of science, Ibn Ḥazm’s innovative perspectives and contributions in logic have been overlooked or considered with an attitude of contempt. On the one hand, his work has been seen, at best, as promulgating the benefits of studying Aristotle’s logic, so that his contribution is assessed as more didactical than conceptual. And on the other hand, those who do examine his innovations often consider them to be mistaken. As indicated by Chejne (1984, p. 2) contempt towards the logical work of Ibn Ḥazm was also present in its reception by the Eastern philosophers who accused him of deviating from Aristotelian logic and of dabbling in things beyond his capability. However, a reassessment of his work on logic has since begun, by delving into the ways the thinker of Córdoba studied the links between deontic and modal qualification of propositions. In this context Lameer’s (2013) paper on the logical sources of Ibn Ḥazm is worth mentioning; the author (p. 417, footnote 1) observes that, although, strictly speaking, it was al-Fārābī who first drew the parallelism between deontic and modal concepts, it was Ibn Ḥazm who developed it and worked it out in a more precise manner. A primary aim of this paper is to help fill some of these gaps by stressing the role of the work of Ibn Ḥazm in developing a notion of deontic necessity deeply rooted in legal normativity, and in explicitly discussing the transference between deontic and modal concepts. According to our view; the basic units of Islamic deontic logic are what we might call, indulging in terminological anachronism, heteronomous imperatives. As it turns out, the heteronomy of imperatives within Islamic legal systems contrasts with those of the purely moral realm, which seem to be closer to an autonomous conception of moral law. There it concurs again with Leibniz’s proposal to define obligatory as “what is necessary for a good person to do”. In the present paper, we will focus on the heteronomous imperatives of legal systems rather than on the imperatives of the purely moral realm. In this context, the work of Ibn Ḥazm extends the parallelism between the necessity of events and that of human actions stressed by his predecessors. According to our understanding, Ibn Ḥazm’s parallelism can be rendered explicit formally by means of a conditional (or hypothetical) structure shared by both deontic and modal propositions. Moreover, this structure makes apparent that this parallelism displays an underlying system of “degrees”. Indeed, while in the domain of events, given some conditions, it makes sense to distinguish between an event that is more likely to happen than another. Ibn Ḥazm speaks of near and distant possibility (such as the higher degree of likelihood of rain, given the condensation of clouds in December, and its lower degree, when the condensation occurs in summer); and, in the domain of actions, the Islamic notion of weighting actions determines degrees of virtue (or of legal and moral value). So whereas the degree of virtue of performing a forbidden act as determined by the distribution of sanction and reward is 0, we obtain the same value by pondering the likelihood of an impossible event to take place. Furthermore, as discussed in section II.3.2, the system of values at work in the parallelism can be seen as opening the way to a more direct correspondence. Thus, while in the realm of nature, likelihood of occurrence of an event is dependent upon the conditions specific to the occurrence of that event; while, in the realm of jurisprudence, likelihood of performing an action is dependent upon the distribution of reward and sanction specific to that action (being that, given the choice to perform or not perform a given action, those that will be rewarded are more likely to be performed than those that are not). According to this perspective, the point of the parallelism is that both deontic and modal qualifications measure the degree of an action or event to become actual; that is – indulging once more in anachronism (but this time from the Leibnizian background) – the degree measures how feasible (facile) an action or event may be. This suggests that Ibn Ḥazm’s perspectives already herald the links to probability and possibility explored by Leibniz six centuries later – see for example Leibniz’s (1671, A VI, I, p. 424-26) use of probability in the context of conditional right. Nevertheless, it also shows a crucial difference to the approach developed in the Elementa Jura Naturalis: whereas Leibniz’s studies seek to define what is to be just or virtuous, the logical system of deontic imperatives within Islamic jurisprudence presupposes that what is to be virtuous has already been settled. Determining what is to be virtuous is not achieved by logical reasoning within the system of legal jurisprudence, but by delving into the higher objectives of the Sharīʿa. While developing our point, we will delve into the logical structure of the heteronomous imperatives. This distinguishes our contribution from the existing literature, such as the papers of Chejne (1984), Lameer (2014), and Guerrero (1997, 2010, 2014), which do not provide a logical analysis of the deontic concepts put into work by Ibn Ḥazm. The true antecedent to the present paper is the work of Farid Zidani (2007, 2015), who, so far as we know, was the first to undertake such a task. Some of our own developments and general epistemological thoughts go beyond Ibn Ḥazm’s framework and motivations; mainly those contained in sections II.3.2 and IV. However, according to our view, these reflections suggest that Ibn Ḥazm’s approach has the substance for a broader and deeper exploration of the logic of norms. The paper is structured as follows:I.Ibn Ḥazm’s Logic of Heteronomous Imperatives. After presenting some extracts of the relevant text, we proceed by providing a formal reconstruction of the five forms of deontic modalities. II. A Landmark in the History of the Logical Analysis of Norms. Duties and Modalities. In this section, we study the transferences from deontic to modal necessity and possibility. We briefly compare the deontic system of Islamic Jurisprudence with that of Leibniz.III. Leibniz and Hypothetical Imperatives in Law.IV. Beyond Ibn Ḥazm: Conclusions and the Work Ahead. We will conclude the paper by discussing briefly some conceptual points that distinguish the logic of heteronomous imperatives from contemporary deontic logic. Our final words will discuss deontic-modal parallelism in the context of Ibn Ḥazm’s rejection of reasoning by conjecture and what we call “the internalization of nature.”. (shrink)

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.

The previously introduced algorithm \sqema\ computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend \sqema\ with an additional rule based on a recursive version of Ackermann's lemma, which enables the algorithm to compute local frame equivalents of modal formulae in the extension of first-order logic with monadic least fixed-points \mffo. This computation operates by transforming input formulae into locally frame equivalent ones in the pure fragment of the hybrid mu-calculus. In particular, we (...) prove that the recursive extension of \sqema\ succeeds on the class of `recursive formulae'. We also show that a certain version of this algorithm guarantees the canonicity of the formulae on which it succeeds. (shrink)

Harold Hodes in [1] introduces an extension of first-order modal logic featuring a backtracking operator, and provides a possible worlds semantics, according to which the operator is a kind of device for ‘world travel’; he does not provide a proof theory. In this paper, I provide a natural deduction system for modal logic featuring this operator, and argue that the system can be motivated in terms of a reading of the backtracking operator whereby it serves to indicate (...) class='Hi'>modal scope. I prove soundness and completeness theorems with respect to Hodes’ semantics, as well as semantics with fewer restrictions on the accessibility relation. (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)

Metaphysics-first approaches dominate the current literature in the epistemology of modality. According to metaphysics-firsters, metaphysical theses have an important role in the justification of modal epistemologies. For example, the thesis that essentialist truths constitute the metaphysical grounds of modal truths is meant to have an important role in the justification of essentialist modal epistemologies. In this article, we argue against this approach. We first pick up some of the groundwork on behalf of the metaphysics-firsters and explicitly spell (...) out potential arguments for their view. However, despite some initial plausibility, these arguments are ultimately found wanting. We conclude that the metaphysics-first approach lacks motivation and puts far too stringent demands upon modal epistemologists. (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)

In this article, we present a modal logic system that allows representing relationships between sets or classes of individuals defined by a specific property. We introduce two modal operators, [a] and <a>, which are used respectively to express "for all A" and "there exists an A". Both the syntax and semantics of the system have two levels that avoid the nesting of the modal operator. The semantics is based on a variant of Kripke semantics, where the (...) class='Hi'>modal operators are indexed over propositional logic formulas ("pre-formulas" in the paper). Furthermore, we present a set of axioms and rules that govern the system and we prove that the logic is correct and complete with respect to Kripke models. In the final section of the article, we discuss potential future work. We consider the possibility of combining our operator with other modalities, such as necessity or knowledge. Additionally, as an example of the utility of our modal operator, we briefly analyze a conveniently adapted Barcan formula within the framework of our system. In summary, we propose combining our modal operator with other ones as a simpler, more compact, albeit less expressive way to address quantified modal logic. (shrink)

We employ a recently developed methodology -- called "structural refinement" -- to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent systems. This method can be seen as a means by which labelled sequent systems can be transformed into nested sequent systems through the introduction of propagation rules and the elimination of structural rules, followed by a notational translation. The nested systems we obtain incorporate propagation rules that are parameterized with (...) formal grammars, and which encode certain frame conditions expressible as first-order Horn formulae that correspond to a subclass of the Scott-Lemmon axioms. We show that our nested systems are sound, cut-free complete, and admit hp-admissibility of typical structural rules. (shrink)

Well-known results due to David Makinson show that there are exactly two Post complete normal modal logics, that in both of them, the modal operator is truth-functional, and that every consistent normal modal logic can be extended to at least one of them. Lloyd Humberstone has recently shown that a natural analog of this result in congruential modal logics fails, by showing that not every congruential modal logic can be extended to one in (...) which the modal operator is truth-functional. As Humberstone notes, the issue of Post completeness in congruential modal logics is not well understood. The present article shows that in contrast to normal modal logics, the extent of the property of Post completeness among congruential modal logics depends on the background set of logics. Some basic results on the corresponding properties of Post completeness are established, in particular that although a congruential modal logic is Post complete among all modal logics if and only if its modality is truth-functional, there are continuum many modal logics Post complete among congruential modal logics. (shrink)