General frames are often used in classical modal logic. Since they are duals of modal algebras, completeness follows automatically as with algebras but the intuitiveness of Kripke frames is also retained. This paper develops basics of general frames for relevant modal logics by showing that they share many important properties with general frames for classical modal logic.

The?-admissibility is one of the most important problems in the realm of relevant logics. To prove the 7-admissibility, either the method of normal models or the method using metavaluations may be employed. The?-admissibility of a wide class of relevant modal logics has been discussed in Part I based on a former method, but the?-admissibility based on metavaluations has not hitherto been fully considered. Sahlqvist axioms are well known as a means of expressing generalized forms of formulas with (...) modal operators. This paper shows that? is admissible for relevant modal logics with restricted Sahlqvist axioms in terms of the method using metavaluations. (shrink)

A logic is called metacomplete if formulas that are true in a certain preferred interpretation of that logic are theorems in its metalogic. In the area of relevant logics, metacompleteness is used to prove primeness, consistency, the admissibility of γ and so on. This paper discusses metacompleteness and its applications to a wider class of modal logics based on contractionless relevant logics and their neighbours using Slaney’s metavaluational technique.

The relevant modal logic G is a simple extension of the logic RT, the relevant counterpart of the familiar classically based system T. Using the Routley-Meyer semantics for relevant modal logics, this paper proves three main results regarding G: (i) G is semantically complete, but only with a non-standard interpretation of necessity. From this, however, other nice properties follow. (ii) With a standard interpretation of necessity, G is semantically incomplete; there is no class (...) of frames that characterizes G. (iii) The class of frames for G characterizes the classically based logic T. (shrink)

Halldén completeness closely resembles the relevance property. To prove Halldén completeness in terms of Kripke-style semantics, the van Benthem–Humberstone theorem is often used. In relevant modal logics, the Halldén completeness of Meyer–Fuhrmann logics has been obtained using the van Benthem–Humberstone theorem. However, there remain a number of Halldén-incomplete relevant modal logics. This paper discusses the Halldén completeness of a wider class of relevant modal logics, namely, those with some Sahlqvist axioms.

Semantics are given for modal extensions of relevant logics based on the kind of frames introduced in [7]. By means of a simple recipe we may obtain from a class FRM (L) of unreduced frames characterising a (non-modal) logic L, frame-classes FRM (L.M) characterising conjunctively regular modal extensions L.M of L. By displaying an incompleteness phenomenon, it is shown how the recipe fails when reduced frames are under consideration.

The admissibility of Ackermann's rule? is one of the most important problems in relevant logic. While the?-admissibility of normal modal logics based on the relevant logic R has been previously discussed, the case for weaker relevant modal logics has not yet been considered. The method of normal models has often been used to prove the?-admissibility. This paper discusses which relevant modal logics admit? from the viewpoint of the method of normal models.

Kripke-completeness of every classical modal logic with Sahlqvist formulas is one of the basic general results on completeness of classical modal logics. This paper shows a Sahlqvist theorem for modal logic over the relevant logic Bin terms of Routley- Meyer semantics. It is shown that usual Sahlqvist theorem for classical modal logics can be obtained as a special case of our theorem.

Kripke-completeness of every classical modal logic with Sahlqvist formulas is one of the basic general results on completeness of classical modal logics. This paper shows a Sahlqvist theorem for modal logic over the relevant logic Bin terms of Routley-Meyer semantics. It is shown that usual Sahlqvist theorem for classical modal logics can be obtained as a special case of our theorem.

The admissibility of Ackermann’s rule γ is one of the most important problems in relevant logic. While the γ-admissibility of normal modal logics based on the relevant logic R has been previously discussed, the case for weaker relevant modal logics has not yet been considered. The method of normal models has often been used to prove the γ-admissibility. This paper discusses which relevant modal logics admit γ from the viewpoint of the (...) method of normal models. (shrink)

The admissibility of Ackermann's rule γ is one of the most important problems in relevant logics. The admissibility of γ was first proved by an algebraic method. However, the development of Routley-Meyer semantics and metavaluational techniques makes it possible to prove the admissibility of γ using the method of normal models or the method using metavaluations, and the use of such methods is preferred. This paper discusses an algebraic proof of the admissibility of γ in relevant modal (...) logics based on modern algebraic models. (shrink)

Many relevant logics can be conservatively extended by Boolean negation. Mares showed, however, that E is a notable exception. Mares’ proof is by and large a rather involved model-theoretic one. This paper presents a much easier proof-theoretic proof which not only covers E but also generalizes so as to also cover relevant logics with a primitive modal operator added. It is shown that from even very weak relevant logics augmented by a weak K-ish modal operator, (...) and up to the strong relevant logic R with a S5 modal operator, all fail to be conservatively extended by Boolean negation. The proof, therefore, also covers Meyer and Mares’ proof that NR—R with a primitive S4-modality added—also fails to be conservatively extended by Boolean negation. (shrink)

The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's.First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus. (...) In this family one finds systems that correspond to the associative Lambek calculus, linear logic, relevant logics, BCK logic and intuitionistic logic. Above these basic systems, sequent systems parallel to the basic systems are constructed, which formalize various notions of derived rules for the basic systems. The deduction theorem is provable for the basic systems if, and only if, they are at least as strong as systems corresponding to linear logic, or BCK logic, depending on the language, and their deductive metalogic is not stronger than they are. (shrink)

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 (...) class='Hi'>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)

In this paper thecanonicalmodal logics, a kind of complete modal logics introduced in K. Fine [4] and R. I. Goldblatt [5], will be characterized semantically using the concept of anultrafilter extension, an operation on frames inspired by the algebraic theory of modal logic. Theorem 8 of R. I. Goldblatt and S. K. Thomason [6] characterizing the modally definable Σ⊿-elementary classes of frames will follow as a corollary. A second corollary is Theorem 2 of [4] which states that (...) any complete modal logic defining a Σ⊿-elementary class of frames is canonical.The main tool in obtaining these results is the duality between modal algebras and general frames developed in R. I. Goldblatt [5]. The relevant notions and results from this theory will be stated in §2. The concept of a canonical modal logic is introduced and motivated in §3, which also contains the above-mentioned theorems. In §4, a kind of appendix to the preceding discussion, preservation of first-order sentences under ultrafilter extensions is discussed.The modal language to be considered here has an infinite supply of proposition letters, a propositional constant ⊥, the usual Boolean operators ¬, ∨, ∨, →, and ↔ —with ¬ and ∨ regarded as primitives—and the two unary modal operators ◇ and □ — ◇ being regarded as primitive. Modal formulas will be denoted by lower case Greek letters, sets of formulas by Greek capitals. (shrink)

This book offers a state-of-the-art introduction to the basic techniques and results of neighborhood semantics for modal logic. In addition to presenting the relevant technical background, it highlights both the pitfalls and potential uses of neighborhood models – an interesting class of mathematical structures that were originally introduced to provide a semantics for weak systems of modal logic. In addition, the book discusses a broad range of topics, including standard modal logic results ; (...) bisimulations for neighborhood models and other model-theoretic constructions; comparisons with other semantics for modal logic ; neighborhood semantics for first-order modal logic, applications in game theory ; applications in epistemic logic ; and non-normal modal logics with dynamic modalities. The book can be used as the primary text for seminars on philosophical logic focused on non-normal modal logics; as a supplemental text for courses on modal logic, logic in AI, or philosophical logic ; or as the primary source for researchers interested in learning about the uses of neighborhood semantics in philosophical logic and game theory. (shrink)

Modal logic is an enormous subject, and so any discussion of it must limit itself according to some set of principles. Modal logic is of interest to mathematicians, philosophers, linguists and computer scientists, for somewhat different reasons. Typically a philosopher may be interested in capturing some aspect of necessary truth, while a mathematician may be interested in characterizing a class of models having special structural features. For a computer scientist there is another criterion that is not (...) as relevant for the other disciplines: a logic should be ‘well-behaved.’ This is, admittedly, a vague notion, but some things are clear enough. A logic that can be axiomatized is better than one that can’t be; a logic with a simple axiomatization is better yet; and a logic with a reasonably implementable proof procedure is best of all. My current interests are largely centered in computer science, and so I will only discuss well-behaved modal logics. My talk is organized into three sections, depending on the expressiveness of the modal logics considered: propositional; first-order with rigid designators; first-order with non-rigid designators. Even limited as I have said, the subject is a big one, and this talk can be no more than an outline. For a general discussion of propositional modal logic see [2]; for this and first-order modal logic see [9], [10] and [8]; for tableau systems in modal logic see [6]. (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.

The implication relationship between subsystems in Reverse Mathematics has an underlying logic, which can be used to deduce certain new Reverse Mathematics results from existing ones in a routine way. We use techniques of modal logic to formalize the logic of Reverse Mathematics into a system that we name s-logic. We argue that s-logic captures precisely the “logical” content of the implication and nonimplication relations between subsystems in Reverse Mathematics. We present a sound, complete, (...) decidable, and compact tableau-style deductive system for s-logic, and explore in detail two fragments that are particularly relevant to Reverse Mathematics practice and automated theorem proving of Reverse Mathematics results. (shrink)

This paper shows that the Dawson technique of modelling deontic logics into alethic modal logics to gain insight into deontic formulas is not available for modelling a normal (in the spirit of Anderson) relevance deontic modal logic into either of the normal relevance alethic modal logics R S4or R M. The technique is to construct an extension of the well known entailment matrix set M 0and show that the model of the deontic formula P (A v (...) B). PA v PB is excluded. (shrink)

We modify the semantics of topological modal logic, a language due to Moss and Parikh. This enables us to study the corresponding theory of further classes of subset spaces. In the paper we deal with spaces where every chain of opens fulfils a certain finiteness condition. We consider both a local finiteness condition relevant to points and a global one concerning the whole frame. Completeness of the appearing logical systems, which turn out to be generalizations of the (...) well-known modal system G, can be obtained in the same manner as in the case of the general subset space logic. It is our main purpose to show that the systems differ with regard to the finite model property. (shrink)

Propositional modal logic over relational frames is naturally extended with propositional quantifiers by letting them range over arbitrary sets of worlds of the relevant frame. This is also known as second-order propositional modal logic. The propositionally quantified modal logic of a class of relational frames is often not axiomatizable, although there are known exceptions, most notably the case of frames validating the strong modal logic$\mathrm {S5}$. Here, we develop new general methods (...) with which many of the open questions in this area can be answered. We illustrate the usefulness of these methods by applying them to a range of examples, which provide a detailed picture of which normal modal logics define classes of relational frames whose propositionally quantified modal logic is axiomatizable. We also apply these methods to establish new results in the multimodal case. (shrink)

BERTRAND RUSSELL ON MODALITY AND LOGICAL RELEVANCE - SECOND EDITION of 2015. Praise for the first edition of 1999: "In the twenty-nine years since Russell's death, much of the major scholarship has drawn heavily on his manuscripts and unpublished correspondence. The author shows that the published Russell is capable of new interpretations; in particular, that modal notions such as possibility have a greater place in various aspects of his logical and philosophical thought than has been previously imagined." -Ivor Grattan-Guinness, (...) Foreword to the first edition. EXCERPT FROM PUBLISHED REVIEW: "Dejnožka's book is the first full-length study of modality in Russell. It is useful for its very full survey of passages in which Russell makes use of or alludes to modal notions. Dejnožka's command of Russell's huge output is indeed impressive and his utilization of it thorough...." - Nicholas Griffin, Studia Logica. EXCERPT FROM PUBLISHED REVIEW: "Dejnožka's book raises a very important point in the history of formal logic. Until now the major studies on this topic have drawn heavily on the development of classical logic as standardized by Gottlob Frege and Bertrand Russell. Dejnožka challenges the reader to open his mind for a new interpretation of Russell's work, in particular that modal and relevance notions have a greater place in his philosophy of logic than has been stressed before.... "Dejnožka rightly observes that many of Russell's insights on modality are a result of his discussions with Hugh MacColl, who was indeed the first to seriously attempt to develop formal modal logic. This particularly applies to Russell's conception of a modal logic without modal operators....That is, classical logic can be used to simulate modal expressions. Thus, the notions of (logical) necessity and possibility are not 'fundamental notions'....On this basis, Dejnožka develops a higher level of modality, where the quantification scope extends to the predicates yielding what Russell calls 'fully general propositions'.... "The best studied translation method is known as the standard translation, and it is quite compatible with Dejnožka's suggestions.... "Dejnožka's book is full of material which stimulates [one] to rethink Russell's philosophy of logic and...it is greatly to the author's credit that he brings to light such a wealth of crucial issues in the history and philosophy of logic. - Shahid Rahman, History and Philosophy of Logic. BOOK DESCRIPTION: This book is the only exhaustive study of Russell on modality and logical relevance ever written. This is the second edition, revised over a period of over sixteen years, and over twice as long. Russell initially rejects the possibility of a modal logic in an unpublished paper written ca. 1903-05 and read to an audience in 1905. But the very next year, he adopts the theory of modality he had rejected, and he repeats that theory in published works for many years to come. That theory, together with other texts scattered among Russell's writings, implies eight modal logics which Russell himself never expressly accepted. And Russell's express acceptance of the early Wittgenstein's theory of entailment ("following from") as truth-ground containment implies a deductive relevance logic in Russell's writings which Russell himself never expressly accepted. The book ends with a look at John Maynard Keynes and Anglo-American evidence law as the origins of Russell's theory of probability as degree of logical relevance. Thus the book is written toward the reunion of modern classical logicians with modal logicians and relevantists. On the reunion of modern classical logicians with relevantists, please see also The Concept of Relevance and the Logic Diagram Tradition (2012). Thus I hope to have created two new fields of Russell studies. I may have created a new legal field as well: the history of logical relevance in evidence law: 132 pages (368-500) in chapter 10. (shrink)

his paper provides a sound and complete axiomatisation for constant domain modal logics without Boolean negation. This is a simpler case of the difficult problem of providing a sound and complete axiomatisation for constant-domain quantified relevant logics, which can be seen as a kind of modal logic with a two-place modal operator, the relevant conditional. The completeness proof is adapted from a proof for classical modal predicate logic (I follow James Garson’s 1984 (...) presentation of the completeness proof quite closely), but with an important twist, to do with the absence of Boolean negation. (shrink)

The history of contemporary modal logic dates back to the writings of C. S. Lewis in the early part of this century. Since then, a growing body of literature has attested to professional interest in the area, and in a number of related issues in philosophical logic which have received wide attention. The recent development of powerful formal techniques for modal system building, together with an increasing interest in modal logic as a tool for (...) philosophical analysis, have created a need for an up-to-date text to introduce students to this material. Snyder's book attempts to answer this need. Assuming an understanding of elementary propositional logic, Snyder introduces a reductive technique called cancellation for detecting the theorems of a system of logic. This technique, analogous to the construction of Smullyan trees but more compact, is extended to modal and quantified contexts. Cancellation versions of the systems M and Mn of G. H. von Wright, and S4 and S5 of Lewis are developed. Snyder uses a Hintikka type of semantics, showing how the various formal systems are differentiated at the semantic level by differing conditions which must be imposed on the model systems used as interpretations for them. These model systems, and the conditions imposed upon them, are in turn described by means of a metalanguage which is essentially first-order quantificational logic. The power of this technique stems from the fact that for every object language formula of a system, there is a corresponding formula in the metalanguage which describes the conditions an interpretation must meet in order to satisfy the original formula. The conditions that the interpretations of a given system of logic must meet are reflected in this metalanguage as "antecedent assumptions," and these in turn correspond to cancellation rules for the object language. This correspondence is constructed in such a way that the metalinguistic counterpart of each theorem of the system will be a theorem of first-order logic. Snyder's primary interest is in showing how modal logic can be used, with the help of these techniques, to build a large variety of formal systems and to "tailor" such systems to meet a variety of analytical tasks. Simple modal systems are developed for the articulation of a number of modal concepts, in addition to the classic alethic ones. Examples are taken from temporal, deontic, and epistemic logic to show how specific interpretations of the meanings of the relevant operators lead to the incorporation of appropriate conditions in the formal systems used to articulate them. An entire chapter is devoted to a discussion of the paradoxes of material and strict implication, and to an attempt to articulate the notion of entailment through the development of formal systems which include a dyadic modal operator that is free of these paradoxes. The final chapter discusses such classical issues as proper names, reference, fictional entities, definite descriptions, and existence presuppositions. Appendices deal with such matters as the equivalence of the cancellation systems to more classical axiomatic-deduction systems, and the sketch of a proof of soundness and completeness for all the modal systems presented. While designed as a text, this volume should be of interest to both logicians and those working in metaphysics and language analysis, since the primary concern of the author is to develop techniques that will facilitate the usefulness of modal logic as a tool for philosophical analysis. The instructor's manual contains many suggestions derived from the author's experience in teaching this non-standard treatment of the subject.--K. T. (shrink)

A variety of modal logics based on the relevant logic R are presented. Models are given for each of these logics and completeness is shown. It is also shown that each of these logics admits Ackermann's rule γ and as a corollary of this it is proved that each logic is a conservative extension of its counterpart based on classical logic, hence we call them “classically complete”. MSC: 03B45, 03B46.

Here, I combine the semantics of Mares and Goldblatt [20] and Seki [29, 30] to develop a semantics for quantified modal relevant logics extending ${\bf B}$. The combination requires demonstrating that the Mares–Goldblatt approach is apt for quantified extensions of ${\bf B}$ and other relevant logics, but no significant bridging principles are needed. The result is a single semantic approach for quantified modal relevant logics. Within this framework, I discuss the requirements a quantified modal (...) relevant logic must satisfy to be “sufficiently classical” in its modal fragment, where frame conditions are given that work for positive fragments of logics. The roles of the Barcan formula and its converse are also investigated. (shrink)

The complexity of the satisfiability problems of various arrow logics and cylindric modal logics is determined. As is well known, relativising these logics makes them decidable. There are several parameters that can be set in such a relativisation. We focus on the following three: the number of variables involved, the similarity type and the kind of relativised models considered. The complexity analysis shows the importance and relevance of these parameters.

Wittgenstein and Heidegger were not merely pioneering leaders of different philosophical schools. They both disavowed a Judeo-Christian God and influenced trends opposed to traditional metaphysical arguments. Therefore, we may suppose that they had a major role in relegating medieval arguments for God to archaic syllogistic pedantries. But I will argue that a conditional premise in Thomas’ Second-Way argument not only finds expression in modal logic, since it specifies necessarily if there is no God, there is no world, but (...) involves a natural sort of reasoning. Its ordinariness bears on Wittgenstein and Heidegger because they had extraordinary moods induced by considering the world’s possible nonexistence. Taken with their expressed disbelief in God when they consider the nonexistence, these things suggest a surreptitious embracement of Thomas’ reasoning. This fact both strengthens and makes it relevant to a pervasive twentieth-century “angst.”. (shrink)

This book concerns the philosophical analysis of modal sentences. David Lewis' Modal Translation Scheme 'translates' sentences of quantified modal logic into sentences of predicate logic supplemented by counterpart theory. A number of theoretical advantages are thereby secured. One component of the translation scheme makes reference to non-actual but possible worlds i.e. the primitive predicate "at a world(s), w". The author addresses the problem of advanced modal sentences which threaten this predicate and so the ability (...) of genuine realism to secure the aforementioned theoretical benefits. The problem of advanced modal sentences is a relatively new field of philosophical research. This ground-breaking book will primarily be of interest to researchers in modality, particularly those working in this field. (shrink)

A well established technique toward developing the proof theory of a Hilbert-style modal logic is to introduce a Gentzen-style equivalent (a Gentzenisation), then develop the proof theory of the latter, and finally transfer the metatheoretical results to the original logic (e.g., [1, 6, 8, 18, 10, 12]). In the first-order modal case, on one hand we know that the Gentzenisation of the straightforward first-order extension of GL, the logic QGL, admits no cut elimination (if the (...) rule is included as primitive; or, if not included, then the rule is not admissible [1]). On the other hand the (cut-free) Gentzenisations of the first-order modal logics M3 and ML3 of [10, 12] do have cut as an admissible rule. The syntactic cut admissibility proof given in [18] for the Gentzenisation of the propositional provability logic GL is extremely complex, and it was the basis of the proofs of cut admissibility of the Gentzenisations of M3 and ML3, where the presence of quantifiers and quantifier rules added to the complexity and length of the proof. A recent proof of cut admissibility in a cut-free Gentzenisation of GL is given in [5] and is quite short and easy to read. We adapt it here to revisit the proofs for the cases of M3 and ML3, resulting to similarly short and easy to read proofs, only slightly complicated by the presence of quantification and its relevant rules. (shrink)

This paper investigates set-theoretical semantics for logics that contain unary connectives, which can be viewed as modalities. Indeed, some of the logics we consider are closely related to linear logic. We use insights from the relational semantics of relevance logics together with a new version of the squeeze lemma in our semantics for logics with disjunction. The ideal-based semantics, which takes co-theories to be situations, dualizes the theory-based semantics for logics with conjunction.

In "An Alternative Semantics for Quantified Relevant Logic" (JSL 71 (2006)) we developed a semantics for quantified relevant logic that uses general frames. In this paper, we adapt that model theory to treat quantified modal logics, giving a complete semantics to the quantified extensions, both with and without the Barcan formula, of every proposi- tional modal logic S. If S is canonical our models are based on propositional frames that validate S. We employ (...) frames in which not every set of worlds is an admissible proposition, and an alternative interpretation of the uni- versal quantifier using greatest lower bounds in the lattice of admissible propositions. Our models have a fixed domain of individuals, even in the absence of the Barcan formula. For systems with the Barcan formula it is possible to preserve the usual Tarskian reading of the quantifier, at the expensive of sometimes losing va- lidity of S in the underlying propositional frames. We apply our results to a number of logics, including S4.2, S4M and KW, whose quantified extensions are incomplete for the standard semantics. (shrink)

We reconstruct as much as we can the part of al-Fārābī's treatment of modal logic that is missing from the surviving pages of his Long Commentary on the Prior Analytics. We use as a basis the quotations from this work in Ibn Sīnā, Ibn Rushd and Maimonides, together with relevant material from al-Fārābī's other writings. We present a case that al-Fārābī's treatment of the dictum de omni had a decisive effect on the development and presentation of Ibn (...) Sīnā's modal logic. We give further evidence that the Harmonisation of the Opinions of Plato and Aristotle was not written by al-Fārābī. (shrink)

In this paper, we build on earlier work by Standefer (Logic J IGPL 27(4):543–569, 2019) in investigating extensions of substructural logics, particularly relevant logics, with the machinery of justification logics. We strengthen a negative result from the earlier work showing a limitation with the canonical model method of proving completeness. We then show how to enrich the language with an additional operator for implicit commitment to circumvent these problems. We then extend the logics with axioms for D, 4, (...) and 5, which requires additional justification term operators, following the work of Pacuit (in proceedings of the fifth panhellenic logic symposium, 2005) and Rubtsova (in Grigoriev D, Harrison J (eds) Computer science—theory and applications, CSR 2006; J Logic Comput 16(5):671–684, 2006), and present the required modifications to the frame semantics. We present a simplification of the neighborhood frames from the earlier work and we close by investigating the distinctive contribution of the + operator to the logic. (shrink)

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

In this paper, we investigate neighbourhood semantics for modal extensions of relevant logics. In particular, we combine the neighbourhood interpretation of the relevant implication (and related connectives) with a neighbourhood interpretation of modal operators. We prove completeness for a range of systems and investigate the relations between neighbourhood models and relational models, setting out a range of augmentation conditions for the various relations and operations.

Once upon a time, modal logic was castigated because it ‘had no semantics.’ Kripke, Hintikka, Kanger, and others changed all that. In a similar way, when Relevant Logic was introduced by Anderson and Belnap, it too was castigated for ‘having no semantics.’ The present overview marks a culmination of that effort. The semantic approach described here brings together a number of hitherto disparate efforts to set out formal systems for logics of relevant implication and entailment. (...) It also makes clear (despite some of our hopes and utterances) that the One True Logic does not exist. This is as true for relevant logics as Kripke et al., showed it to be for modal logics. In both cases, subtle (and not so subtle) variations on semantical postulates produce different logics in the same family. The question of which semantical postulates are correct makes no sense without further context, i.e., the questioner needs to answer the question: Correct for what? The question that does remain is: What motivates the relevant family of logics? And this is the question that is the main job for this chapter to investigate. (shrink)

Epistemic closure has been a central issue in epistemology over the last forty years. According to versions of the relevant alternatives and subjunctivist theories of knowledge, epistemic closure can fail: an agent who knows some propositions can fail to know a logical consequence of those propositions, even if the agent explicitly believes the consequence (having “competently deduced” it from the known propositions). In this sense, the claim that epistemic closure can fail must be distinguished from the fact that agents (...) do not always believe, let alone know, the consequences of what they know—a fact that raises the “problem of logical omniscience” that has been central in epistemic logic. This paper, part I of II, is a study of epistemic closure from the perspective of epistemic logic. First, I introduce models for epistemic logic, based on Lewis’s models for counterfactuals, that correspond closely to the pictures of the relevant alternatives and subjunctivist theories of knowledge in epistemology. Second, I give an exact characterization of the closure properties of knowledge according to these theories, as formalized. Finally, I consider the relation between closure and higher-order knowledge. The philosophical repercussions of these results and results from part II, which prompt a reassessment of the issue of closure in epistemology, are discussed further in companion papers. As a contribution to modal logic, this paper demonstrates an alternative approach to proving modal completeness theorems, without the standard canonical model construction. By “modal decomposition” I obtain completeness and other results for two non-normal modal logics with respect to new semantics. One of these logics, dubbed the logic of ranked relevant alternatives, appears not to have been previously identified in the modal logic literature. More broadly, the paper presents epistemology as a rich area for logical study. (shrink)

In this paper a system, RPF, of second-order relevance logic with S5 necessity is presented which contains a defined, notion of identity for propositions. A complete semantics is provided. It is shown that RPF allows for more than one necessary proposition. RPF contains primitive syntactic counterparts of the following semantic notions: (1) the reflexive, symmetrical, transitive binary alternativeness relation for S5 necessity, (2) the ternary Routley-Meyer alternativeness relation for implication, and (3) the Routley-Meyer notion of a prime intensional theory, (...) as well as defined syntactic counterparts, of the semantic notions of a possible world and the Routley-Meyer * operator. (shrink)