R. K. Meyer once gave precise form to the question of whether relevant implication can be defined in any modal system, and his answer was `no'. In the present paper, we extend S4, first with propositional quantifiers, to the system S4π+; and then with definite propositional descriptions, to the system S4π+ lp . We show that relevant implication can in some sense be defined in the modal system S4π+ lp , although it cannot be defined in S4π+.

There is a strong case to be made for thinking that an obscure logic, KR, is better than classical logic and better than any relevant logic. The argument for KR over relevant logics is that KR counts disjunctive syllogism valid, and this is the biggest complaint about relevant logics. The argument for KR over classical logic depends on the normativity of logic and the paradoxes of implication. The paradoxes of implication are taken by relevant logicians to justify relevant logic, but (...) considerations on the normativity of logic show that only some of the paradoxes of implication are genuine. KR avoids all the genuine paradoxes of implication, unlike classical logic. Overall, KR avoids the genuine paradoxes of implication and avoids the major objection to relevant logics. This combination of features provides strong reason to give KR a place in the conversation about the right logic. (shrink)

We give a reading of binary necessity statements of the form “ϕ is necessary for ψ” in terms of proofs. This reading is based on the idea of interpreting such statements as “Every proof of ψ uses ϕ”.

In this work, attention is drawn to the abundant use of metaphor and analogy in works of logic. I argue that pervasiveness of figurative language is to be counted among the features that characterize logic and distinguish it from other sciences. This characteristic feature reflects the creativity that is inherent in logic and indeed has been demonstrated to be a necessary part of logic. The goal of this paper, in short, is to provide specific examples of figurative language used in (...) logic that yield insights into the nature of the subject. I encourage the reader to take metaphors seriously, and to accept that they are not mere embellishments but key elements in our understanding of logic. (shrink)

The point of the present paper is to draw attention to some interesting similarities, as well as differences, between the approaches to the logic of noncontingency of Evgeni Zolin and of Claudio Pizzi. Though neither of them refers to the work of the other, each is concerned with the definability of a (normally behaving, though not in general truth-implying) notion of necessity in terms of noncontingency, standard boolean connectives and additional but non-modal expressive resources. The notion of definability involved is (...) different in the two cases (‘external’ for Zolin, ‘internal’ for Pizzi), as are the additional resources: infinitary conjunction in the case of Zolin, and for Pizzi, first, propositional quantification, and then, later, most ingeniously, the use of a propositional constant. As well as surveying and comparing of the work of these authors, the discussion includes some some novelties, such as the confirmation of a conjecture of Zolin’s (Theorem 2.7). (shrink)

Both Lowe and Tsai have presented their own versions of the theory that both indicative and subjunctive conditionals are strict conditionals. We critically discuss both versions and we find each version wanting.

ABSTRACT Classical and intuitionistic logic both validate Ex Contradictione Quodlibet, according to which any proposition whatsoever follows from a contradiction. Many philosophers have found ECQ counter-intuitive, but criticisms of the principle have almost universally been directed from a position of support for relevance or other orthodox paraconsistent logics, according to which some, but not necessarily all, propositions follow from a contradiction. This paper draws attention to the historically significant view that nothing whatsoever follows from a contradiction – Ex Contradictione Nihil. (...) It addresses the key arguments – model-theoretic, proof-theoretic, meaning theoretic and holist – deployed by proponents of ECQ against their standard opponents, and shows that each can be defeated from a position of support for ECN. In the course of answering these arguments, some understanding is developed of possible motivations for ECN and a solid case is built that ECN deserves further investigation. (shrink)

Various sources in the literature claim that the deduction theorem does not hold for normal modal or epistemic logic, whereas others present versions of the deduction theorem for several normal modal systems. It is shown here that the apparent problem arises from an objectionable notion of derivability from assumptions in an axiomatic system. When a traditional Hilbert-type system of axiomatic logic is generalized into a system for derivations from assumptions, the necessitation rule has to be modified in a way that (...) restricts its use to cases in which the premiss does not depend on assumptions. This restriction is entirely analogous to the restriction of the rule of universal generalization of first-order logic. A necessitation rule with this restriction permits a proof of the deduction theorem in its usual formulation. Other suggestions presented in the literature to deal with the problem are reviewed, and the present solution is argued to be preferable to the other alternatives. A contraction-and cut-free sequent calculus equivalent to the Hubert system for basic modal logic shows the standard failure argument untenable by proving the underivability of DA from A. (shrink)

C. I. Lewis intended his systems S1–S5 as contributions to the study of “strict implication”, but in his formulation, strict implication is so thoroughly intertwined with other notions, such as possibility and negation, that it remains a problem, to separate out the properties of strict implication itself. I shall solve this problem for S2–5 and von Wright's M. The results for S3–5 are given below, while the implicative parts of S2 and M, which are rather more complicated, are given in (...) §5.In this presentation, ‘⊃’ stands for strict implication, and missing brackets for ‘⊃’ are restored by associationtothe right. Astrictformula is one of the form A ⊃ B. Axiom schemes are used throughout. (shrink)

In 1880, when Oliver Wendell Holmes (later to be a Justice of the U.S. Supreme Court) criticized the logical theology of law articulated by Christopher Columbus Langdell (the first Dean of Harvard Law School), neither Holmes nor Langdell was aware of the revolution in logic that had begun, the year before, with Frege's Begriffsschrift. But there is an important element of truth in Holmes's insistence that a legal system cannot be adequately understood as a system of axioms and corollaries; and (...) this element of truth is not obviated by the more powerful logical techniques that are now available. (shrink)

Moral obligation and permissibility are usually thought to be interdefinable. Following the pattern of the duality definitions of necessity and possibility, we have that something’s being permissible could be defined as its not being obligatory to not do it. And that something’s being obligatory could be defined as its not being permissible to not do it. In this paper, I argue that neither direction of this alleged interdefinability works. Roughly, the problem is that a claim that some act is obligatory (...) or permissible entails that there is a moral law, whereas a negative claim that some act is not obligatory or not permissible does not. Nevertheless, one direction of the interdefinability can potentially be salvaged. I argue that, if we do not require the conceptual possibility of moral dilemmas, then there is a way to plausibly define obligation in terms of permissibility. I conclude that permissibility is the only feasible deontic primitive. (shrink)

We investigate a hitherto under-considered avenue of response for the logical pluralist to collapse worries. In particular, we note that standard forms of the collapse arguments seem to require significant order-theoretic assumptions, namely that the collection of admissible logics for the pluralist should be closed under meets and joins. We consider some reasons for rejecting this assumption, noting some prima facie plausible constraints on the class of admissible logics which would lead a pluralist admitting those logics to resist such closure (...) conditions. (shrink)

This article is a presentation of Plantinga’s ontological argument in its historical and systematical frames. Criticisms of the argument are presented as well. Philosophical claims underlying the defense of the argument are described as minimalist, but their connection with a strong logical system is noted.

This paper studies proof systems for the logics of super-strict implication \(\textsf{ST2}\) – \(\textsf{ST5}\), which correspond to C.I. Lewis’ systems \(\textsf{S2}\) – \(\textsf{S5}\) freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating \(\textsf{STn}\) in \(\textsf{Sn}\) and backsimulating \(\textsf{Sn}\) in \(\textsf{STn}\), respectively (for \({\textsf{n}} =2, \ldots, 5\) ). Next, \(\textsf{G3}\) -style labelled sequent calculi are investigated. It is shown that these calculi have the good structural properties that are distinctive (...) of \(\textsf{G3}\) -style calculi, that they are sound and complete, and it is shown that the proof search for \(\mathsf {G3.ST2}\) is terminating and therefore the logic is decidable. (shrink)

This paper studies proof systems for the logics of super-strict implication ST2–ST5, which correspond to C.I. Lewis’ systems S2–S5 freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating STn in Sn and backsimulating Sn in STn, respectively(for n=2,...,5). Next, G3-style labelled sequent calculi are investigated. It is shown that these calculi have the good structural properties that are distinctive of G3-style calculi, that they are sound and complete, and (...) it is shown that the proof search for G3. ST2 is terminating and therefore the logic is decidable. (shrink)

This paper examines whether Sherlock Holmes’ “Science of Deduction and Analysis,” as reconstructed by Hintikka and Hintikka The sign of three: Peirce, Dupin, Holmes, Indiana University Press, Bloomington, 1983), exemplifies a logic of discovery. While the Hintikkas claimed it does, their approach remained largely programmatic, and ultimately unsuccessful. Their reconstruction must thus be expanded, in particular to account for the role of memory in inquiry. Pending this expansion, the Hintikkas’ claim is vindicated. However, a tension between the naturalistic aspirations of (...) their model and the formal apparatus they built it on is identified. The paper concludes on suggestions for easing this tension without losing the normative component of the Hintikkas’ epistemological model. (shrink)

Propositional quantifiers are added to a propositional modal language with two modal operators. The resulting language is interpreted over so-called products of Kripke frames whose accessibility relations are equivalence relations, letting propositional quantifiers range over the powerset of the set of worlds of the frame. It is first shown that full second-order logic can be recursively embedded in the resulting logic, which entails that the two logics are recursively isomorphic. The embedding is then extended to all sublogics containing the logic (...) of so-called fusions of frames with equivalence relations. This generalizes a result due to Antonelli and Thomason, who construct such an embedding for the logic of such fusions. (shrink)

Robert Stalnaker has recently advocated propositional contingentism, the claim that it is contingent what propositions there are. He has proposed a philosophical theory of contingency in what propositions there are and sketched a possible worlds model theory for it. In this paper, such models are used to interpret two propositional modal languages: one containing an existential propositional quantifier, and one containing an existential propositional operator. It is shown that the resulting logic containing an existential quantifier is not recursively axiomatizable, as (...) it is recursively isomorphic to second-order logic, and a natural candidate axiomatization for the resulting logic containing an existential operator is shown to be incomplete. (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)

Although logical settings are typically concerned with tracking alethic considerations, frameworks exist in which topic-theoretic considerations—e.g., tracking subject-matter or topic—are given equal importance. Intuitions about extending topic through a propositional language are generally straightforward for extensional cases. For a number of reasons, arriving at a compelling account of the subject-matter of intensional operators—such as intensional conditionals—is a more difficult task. In particular, the framework of topic-sensitive intentional modals (TSIMs) championed by Francesco Berto and his collaborators leave the topics of intensional (...) formulae undefined, which artificially constricts the expressivity of the theory. This paper proposes an approach to fill in this lacuna, emphasizing an analogous problem in Parry-style containment logics. In this setting, the approach receives a proof-of-concept through the introduction of a natural and general family of subsystems of Parry’s $${\textsf{PAI}}$$ PAI —with sound and complete axiomatizations—that allow a fine degree of control over the topics of intensional conditionals. (shrink)

We examine the relationship between the logics of nonsense of Bochvar and Halldén and the containment logics in the neighborhood of William Parry’s A I. We detail two strategies for manufacturing containment logics from nonsense logics—taking either connexive and paraconsistent fragments of such systems—and show how systems determined by these techniques have appeared as Frederick Johnson’s R C and Carlos Oller’s A L. In particular, we prove that Johnson’s system is precisely the intersection of Bochvar’s B 3 and Graham Priest’s (...) non-symmetrized connexive logic and that Oller’s system lies just beneath the intersection of B 3 and Priest’s paraconsistent L P. We conclude by examining Oller’s system in more depth, giving it a characterization in terms of L P and showing that it plays the same role to Harry Deutsch’s paraconsistent containment logic S that Aleksandr Zinov'ev’s S 1 plays with respect to A I. (shrink)

The hallmark of the deductive systems known as ‘conceptivist’ or ‘containment’ logics is that for all theorems of the form , all atomic formulae appearing in also appear in . Significantly, as a consequence, the principle of Addition fails. While often billed as a formalisation of Kantian analytic judgements, once semantics were discovered for these systems, the approach was largely discounted as merely the imposition of a syntactic filter on unrelated systems. In this paper, we examine a number of prima (...) facie unrelated deductive contexts in which Addition fails and attempt to harmonise them by developing a computational interpretation of conceptivist logics. (shrink)

What is an inference rule? This question does not have a unique answer. One usually finds two distinct standard answers in the literature; validity inference $(\sigma \vdash_\mathrm{v} \varphi$ if for every substitution $\tau$, the validity of $\tau \lbrack\sigma\rbrack$ entails the validity of $\tau\lbrack\varphi\rbrack)$, and truth inference $(\sigma \vdash_\mathrm{t} \varphi$ if for every substitution $\tau$, the truth of $\tau\lbrack\sigma\rbrack$ entails the truth of $\tau\lbrack\varphi\rbrack)$. In this paper we introduce a general semantic framework that allows us to investigate the notion of inference (...) more carefully. Validity inference and truth inference are in some sense the extremal points in our framework. We investigate the relationship between various types of inference in our general framework, and consider the complexity of deciding if an inference rule is sound, in the context of a number of logics of interest: classical propositional logic, a nonstandard propositional logic, various propositional modal logics, and first-order logic. (shrink)