A counterpossible is a counterfactual with an impossible antecedent. Counterpossibles present a puzzle for standard theories of counterfactuals, which predict that all counterpossibles are semantically vacuous. Moreover, counterpossibles play an important role in many debates within metaphysics and epistemology, including debates over grounding, causation, modality, mathematics, science, and even God. In this article, we will explore various positions on counterpossibles as well as their potential philosophical consequences.

In this introduction, we offer an overview of main systems developed in the growing literature on connexive logic, and also point to a few topics that seem to be collecting attention of many of those interested in connexive logic. We will also make clear the context to which the papers in this special issue belong and contribute.

Logical pluralism is the view that there is more than one correct logic. This very general characterization gives rise to a whole family of positions. I argue that not all of them are stable. The main argument in the paper is inspired by considerations known as the “collapse problem”, and it aims at the most popular form of logical pluralism advocated by JC Beall and Greg Restall. I argue that there is a more general argument available that challenges all variants (...) of logical pluralism that meet the following three conditions: that there are at least two correct logical systems characterized in terms of different consequence relations, that there is some sort of rivalry among the correct logics, and that logical consequence is normative. The hypothesis I argue for amounts to conditional claim: If a position satisfies all these conditions, then that position is unstable in the sense that it collapses into competing positions. (shrink)

This paper explores trivalent truth conditions for indicative conditionals, examining the “defective” truth table proposed by de Finetti and Reichenbach. On their approach, a conditional takes the value of its consequent whenever its antecedent is true, and the value Indeterminate otherwise. Here we deal with the problem of selecting an adequate notion of validity for this conditional. We show that all standard validity schemes based on de Finetti’s table come with some problems, and highlight two ways out of the predicament: (...) one pairs de Finetti’s conditional with validity as the preservation of non-false values, but at the expense of Modus Ponens; the other modifies de Finetti’s table to restore Modus Ponens. In Part I of this paper, we present both alternatives, with specific attention to a variant of de Finetti’s table proposed by Cooper and Cantwell. In Part II, we give an in-depth treatment of the proof theory of the resulting logics, DF/TT and CC/TT: both are connexive logics, but with significantly different algebraic properties. (shrink)

This paper investigates the logic of reasons. Its aim is to provide an analysis of the sentences of the form ‘p is a reason for q’ that yields a coherent account of their logical properties. The idea that we will develop is that ‘p is a reason for q’ is acceptable just in case a suitably defined relation of incompatibility obtains between p and ¬q. As we will suggest, a theory of reasons based on this idea can solve three challenging (...) puzzles that concern, respectively, contraposing reasons, conflicting reasons, and supererogatory reasons, and opens a new perspective on some classical issues concerning non-deductive inferences. (shrink)

In this introduction to the special issue “40 years of FDE”, we offer an overview of the field and put the papers included in the special issue into perspective. More specifically, we first present various semantics and proof systems for FDE, and then survey some expansions of FDE by adding various operators starting with constants. We then turn to unary and binary connectives, which are classified in a systematic manner. First-order FDE is also briefly revisited, and we conclude by listing (...) some open problems for future research. (shrink)

The “official” history of connexive logic was written in 2012 by Storrs McCall who argued that connexive logic was founded by ancient logicians like Aristotle, Chrysippus, and Boethius; that it was further developed by medieval logicians like Abelard, Kilwardby, and Paul of Venice; and that it was rediscovered in the 19th and twentieth century by Lewis Carroll, Hugh MacColl, Frank P. Ramsey, and Everett J. Nelson. From 1960 onwards, connexive logic was finally transformed into non-classical calculi which partly concur with (...) systems of relevance logic and paraconsistent logic. In this paper it will be argued that McCall’s historical analysis is fundamentally mistaken since it doesn’t take into account two versions of connexivism. While “humble” connexivism maintains that connexive properties only apply to “normal” antecedents, “hardcore” connexivism insists that they also hold for “abnormal” propositions. It is shown that the overwhelming majority of the forerunners of connexive logic were only “humble” connexivists. Their ideas concerning connexive implication don’t give rise, however, to anything like a non-classical logic. (shrink)

.This paper discusses Aristotle’s thesis and Boethius’ thesis, the most distinctive theorems of connexive logic. Its aim is to show that, although there is something plausible in Aristotle’s thesis and Boethius’ thesis, the intuitions that may be invoked to motivate them are consistent with any account of indicative conditionals that validates a suitably restricted version of them. In particular, these intuitions are consistent with the view that indicative conditionals are adequately formalized as strict conditionals.

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)

When discussing Logical Pluralism several critics argue that such an open-minded position is untenable. The key to this conclusion is that, given a number of widely accepted assumptions, the pluralist view collapses into Logical Monism. In this paper we show that the arguments usually employed to arrive at this conclusion do not work. The main reason for this is the existence of certain substructural logics which have the same set of valid inferences as Classical Logic—although they are, in a clear (...) sense, non-identical to it. We argue that this phenomenon can be generalized, given the existence of logics which coincide with Classical Logic regarding a number of metainferential levels—although they are, again, clearly different systems. We claim this highlights the need to arrive at a more refined version of the Collapse Argument, which we discuss at the end of the paper. (shrink)

In this paper, I review the motivation of connexive and strongly connexive logics, and I investigate the question why it is so hard to achieve those properties in a logic with a well motivated semantic theory. My answer is that strong connexivity, and even just weak connexivity, is too stringent a requirement. I introduce the notion of humble connexivity, which in essence is the idea to restrict the connexive requirements to possible antecedents. I show that this restriction can be well (...) motivated, while it still leaves us with a set of requirements that are far from trivial. In fact, formalizing the idea of humble connexivity is not as straightforward as one might expect, and I offer three different proposals. I examine some well known logics to determine whether they are humbly connexive or not, and I end with a more wide-focused view on the logical landscape seen through the lens of humble connexivity. (shrink)

In this paper, we shall consider the so-called cancellation view of negation and the inferential role of contradictions. We will discuss some of the problematic aspects of negation as cancellation, such as its original presentation by Richard and Valery Routley and its role in motivating connexive logic. Furthermore, we will show that the idea of inferential ineffectiveness of contradictions can be conceptually separated from the cancellation model of negation by developing a system we call qLPm, a combination of Graham Priest’s (...) minimally inconsistent Logic of Paradox with q-entailment as introduced by Grzegorz Malinowski. (shrink)

In this paper, a family of paraconsistent propositional logics with constructive negation, constructive implication, and constructive co-implication is introduced. Although some fragments of these logics are known from the literature and although these logics emerge quite naturally, it seems that none of them has been considered so far. A relational possible worlds semantics as well as sound and complete display sequent calculi for the logics under consideration are presented.

Various four- and three-valued modal propositional logics are studied. The basic systems are modal extensions BK and BS4 of Belnap and Dunn's four-valued logic of firstdegree entailment. Three-valued extensions of BK and BS4 are considered as well. These logics are introduced semantically by means of relational models with two distinct evaluation relations, one for verification and the other for falsification. Axiom systems are defined and shown to be sound and complete with respect to the relational semantics and with respect to (...) twist structures over modal algebras. Sound and complete tableau calculi are presented as well. Moreover, a number of constructive non-modal logics with strong negation are faithfully embedded into BS4, into its three-valued extension B3S4, or into temporal BS4, BtS4. These logics include David Nelson's three-valued logic N3, the four-valued logic N4 bottom, the connexive logic C, and several extensions of bi-intuitionistic logic by strong negation. (shrink)

This volume examines the concept of falsification as a central notion of semantic theories and its effects on logical laws. The point of departure is the general constructivist line of argument that Michael Dummett has offered over the last decades. From there, the author examines the ways in which falsifications can enter into a constructivist semantics, displays the full spectrum of options, and discusses the logical systems most suitable to each one of them. While the idea of introducing falsifications into (...) the semantic account is Dummett's own, the many ways in which falsificationism departs quite radically from verificationism are here spelled out in detail for the first time. The volume is divided into three large parts. The first part provides important background information about Dummett’s program, intuitionism and logics with gaps and gluts. The second part is devoted to the introduction of falsifications into the constructive account and shows that there is more than one way in which one can do this. The third part details the logical effects of these various moves. In the end, the book shows that the constructive path may branch in different directions: towards intuitionistic logic, dual intuitionistic logic and several variations of Nelson logics. The author argues that, on balance, the latter are the more promising routes to take. "Kapsner’s book is the first detailed investigation of how to incorporate the notion of falsification into formal logic. This is a fascinating logico-philosophical investigation, which will interest non-classical logicians of all stripes." Graham Priest, Graduate Center, City University of New York and University of Melbourne. (shrink)

Francez has suggested that connexivity can be predicated of connectives other than the conditional, in particular conjunction and disjunction. Since connexivity is not any connection between antecedents and consequents—there might be other connections among them, such as relevance—, my question here is whether Francez’s conjunction and disjunction can properly be called ‘connexive’. I analyze three ways in which those connectives may somehow inherit connexivity from the conditional by standing in certain relations to it. I will show that Francez’s connectives fail (...) all these three ways, and that even other connectives obtained by following more closely Wansing’s method to get a connexive conditional, fail to be connexive as well. (shrink)

This paper introduces and explores a conservative extension of inquisitive logic. In particular, weak negation is added to the standard propositional language of inquisitive semantics, and it is shown that, although we lose some general semantic properties of the original framework, such an enrichment enables us to model some previously inexpressible speech acts such as weak denial and ‘might’-assertions. As a result, a new modal logic emerges. For this logic, a Fitch-style system of natural deduction is formulated. The main result (...) of this paper is a theorem establishing the completeness of the system with respect to inquisitive semantics with weak negation. At the conclusion of the paper, the possibility of extending the framework to the level of first order logic is briefly discussed. (shrink)

In this paper, first some propositional conditional logics based on Belnap and Dunn’s useful four-valued logic of first-degree entailment are introduced semantically, which are then turned into systems of weakly and unrestrictedly connexive conditional logic. The general frame semantics for these logics makes use of a set of allowable (or admissible) extension/antiextension pairs. Next, sound and complete tableau calculi for these logics are presented. Moreover, an expansion of the basic conditional connexive logics by a constructive implication is considered, which gives (...) an opportunity to discuss recent related work, motivated by the combination of indicative and counterfactual conditionals. Tableau calculi for the basic constructive connexive conditional logics are defined and shown to be sound and complete with respect to their semantics. This semantics has to ensure a persistence property with respect to the preorder that is used to interpret the constructive implication. (shrink)

This brief note corrects an error in one of the reduction steps in my paper 'Normalisation for Bilateral Classical Logic with some Philosophical Remarks' published in the Journal of Applied Logics 8/2 (2021): 531-556.

I argue that a pragmatic scepticism about metaphysical modality is a perfectly reasonable position to maintain. I then illustrate the difficulties and limitations associated with some strategies for defeating such scepticism. These strategies appeal to associations between metaphysical modality and the following: objective probability, counterfactuals and distinctive explanatory value.

In this paper, I investigate whether the intuitions that make connexive logics seem plausible might lie in pragmatic phenomena, rather than the semantics of conditional statements. I conclude that pragmatics indeed underwrites these intuitions, at least for indicative statements. Whether this has any effect on logic choice, however, heavily depends on one’s semantic theory of conditionals and on how one chooses to logically treat pragmatic failures.

In this paper, we apply relating semantics to the widely discussed problem of free choice between permitted actions or situations in normative systems. Leaving aside contexts in which the free choice principle is obviously unacceptable or uncontroversially valid, we concentrate on free choice for explicit permissions. In order to construct a formal representation of explicit permissions, we introduce a special constant, $\texttt {permit}$, which is analogous to the constant $\texttt {violation}$ used in the Andersonian–Kangerian approach to deontic logic with respect (...) to prohibition and obligation. Consequently, we define a permission operator on the basis of the $\texttt {permit}$ constant and a relation of legitimization. The general idea is that $P \varphi $ is true if and only if $\texttt {permit}$ is true, which means that a permission is actually issued and $\varphi $ is legitimized by $\texttt {permit}$. The intuitive notion of legitimization is formally represented by an operator of relating implication: a non-classical implication that is semantically defined by adding a constraint to the classical meaning of implication to the effect that arguments are related by a special relation. The properties of this relation are based on an informal, intuitive meaning of legitimization and determine the properties of the permission operator. We show that the resulting permission operator possesses the free choice property and avoids certain unwanted consequences that follow from alternative approaches. (shrink)

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)

Paraconsistent logics are the formal systems in which absurdities do not trivialise the logic. In this paper, we give Hintikka-style game theoretical semantics for a variety of paraconsistent and non-classical logics. For this purpose, we consider Priest’s Logic of Paradox, Dunn’s First-Degree Entailment, Routleys’ Relevant Logics, McCall’s Connexive Logic and Belnap’s four-valued logic. We also present a game theoretical characterisation of a translation between Logic of Paradox/Kleene’s K3 and S5. We underline how non-classical logics require different verification games and prove (...) the correctness theorems of their respective game theoretical semantics. This allows us to observe that paraconsistent logics break the classical bidirectional connection between winning strategies and truth values. (shrink)

The present note revisits the joint work of Leonard Goddard and Richard Routley on significance logics with the aim of shedding new light on their understanding by studying them under the lens of recent semantic developments, such as the plurivalent semantics developed by Graham Priest. These semantics allow sentences to receive one, more than one, or no truth-value at all from a given carrier set. Since nonsignificant sentences are taken to be neither true nor false, i.e. truth-value gaps, in this (...) essay we show that with the aid of plurivalent semantics it is possible to straightforwardly instantiate Goddard and Routley’s understanding of how the connectives should work within significance logics. (shrink)

The aim of this paper is to provide a proof-theoretic characterization of relevant logics including fusion and fission connectives, as well as Ackermann’s truth constant. We achieve this by employing the well-established methodology of labelled sequent calculi. After having introduced several systems, we will conduct a detailed proof-theoretic analysis, show a cut-admissibility theorem, and establish soundness and completeness. The paper ends with a discussion that contextualizes our current work within the broader landscape of the proof theory of relevant logics.

This paper discusses the possible classification of Aristotle’s syllogistic as a non-classical logical system, positing Aristotle himself as a non-classical logician. Initially, we find compelling arguments for this thesis, particularly regarding the expressive power and the rules governing logical inference inherent in Aristotle’s approach. My analysis nevertheless addresses two significant counterarguments. The first, the special case objection, posits that Aristotle’s syllogistic can be framed as a classical logic which deals with canonical syllogistic forms. I argue that this objection is insufficient, (...) as it is possible to point cases in which his system seems to differ from classical logic. The second counterargument, the formalisation gap objection, highlights that Aristotle’s syllogistic resists straightforward modern logical interpretations. This latter objection is evaluated as more compelling and substantial. In particular, a distinction between two concepts is proposed which could help us understand what Aristotle was aiming at in his theory of inference: the notions of ‘to follow from’ and ‘to be a conclusion of’. While the former aligns with the usual sense formal validity, the second requires an inferential structure connecting the premises to the conclusion, explaining why Aristotle excluded inferences like from A ⊢ A syllogisms despite acknowledging that A follows from A. (shrink)

I argue in favour of object languages of logics to be diversely-generated, that is, not having identical immediate sub-formulas. In addition to diversely-generated object languages constituting a more appropriate abstraction of the use of sentential connectives in natural language, I show that such language lead to a simplifications w.r.t. some specific issues: the identity of proofs, the factual equivalence and the Mingle axiom in Relevance logics. I also point out that some of the properties of classical logic based on freely-generated (...) object languagest. (shrink)

Two intuitionistic paradefinite logics N4C and N4C+ are introduced as Gentzen-type sequent calculi. These logics are regarded as a combination of Nelson’s paraconsistent four-valued logic N4 and Wansing’s basic constructive connexive logic C. The proposed logics are also regarded as intuitionistic variants of Arieli, Avron, and Zamansky’s ideal paraconistent four-valued logic 4CC. The logic N4C has no quasi-explosion axiom that represents a relationship between conflation and paraconsistent negation, but the logic N4C+ has this axiom. The Kripke-completeness and cut-elimination theorems for (...) N4C and N4C+ are proved. (shrink)

However broad or vague the notion of connexivity may be, it seems to be similar to the notion of relevance even when relevance and connexive logics have been shown to be incompatible to one another. Relevance logics can be examined by suggesting syntactic relevance principles and inspecting if the theorems of a logic abide to them. In this paper we want to suggest that a similar strategy can be employed with connexive logics. To do so, we will suggest some properties (...) that seem to be hinted at in Nelson’s work. Following this strategy will ideally shed some light over the notion of content and will also help make a clear comparison between relevance and connexive logics. (shrink)

This paper scrutinizes Everett Nelson's conception of consistency by comparing it with the “standard” account of C. I. Lewis. This conflict surprisingly resembles a related controversy between the ancient logicians Chrysippus and Diodorus. Nelson's intuitions behind his peculiar conception of consistency are analysed and certain features of his logical system are critically examined. In particular, his objections against the law of the transitivity of implication and against the laws of conjunction and disjunction have to be discussed. Although Nelson's considerations contain (...) interesting ideas in favour of a relevantist conception of logic, they fail to convincingly support the hardcore connexive thesis that even a selfcontradictory proposition doesn't entail its own negation. (shrink)

In this paper we show that, when analyzed with contemporary tools in logic—such as Dunn-style semantics, Reichenbach’s three-valued logic exhibits many interesting features, and even new responses to some of the old objections to it can be attempted. Also, we establish some connections between Reichenbach’s three-valued logic and some contra-classical logics.

In this paper, we present the history of and the research directions in relating logic. For this purpose we will describe Epstein's Programme, which postulates accounting for the content of sentences in logical research. We will focus on analysing the content relationship and Epstein's logics that are based on it, which are special cases of relating logic. Moreover, the set-assignment semantics will be discussed. Next, the Torunian Programme of Relating Semantics will be presented; this programme explores the various non-logical relationships (...) in logical research, including those which are content-related. We will present a general description of relating logic and semantics as well as the most prominent issues regarding the Torunian Programme, including some of its special cases and the results achieved to date. -/- . (shrink)

In this study, we introduce Gentzen-type sequent calculi BDm and BDi for a modal extension and an intuitionistic modification, respectively, of De and Omori’s extended Belnap–Dunn logic BD+ with classical negation. We prove theorems for syntactically and semantically embedding BDm and BDi into Gentzen-type sequent calculi S4 and LJ for normal modal logic and intuitionistic logic, respectively. The cut-elimination, decidability, and completeness theorems for BDm and BDi are obtained using these embedding theorems. Moreover, we prove the Glivenko theorem for embedding (...) BD+ into BDi and the McKinsey–Tarski theorem for embedding BDi into BDm. (shrink)

In “Lectio 55” of his Notule libri Priorum, Robert Kilwardby discussed various objections that had been raised against Aristotle’s Theses. The first thesis, AT1, says that no proposition q is implied both by a proposition p and by its negation, ∼p. AT2 says that no proposition p is implied by its own negation. In Prior Analytics, Aristotle had shown that AT2 entails AT1, and he argued that the assumption of a proposition p such that (∼p → p) would be “absurd”. (...) The unrestricted validity of AT1, AT2, however, is at odds with other principles which were widely accepted by medieval logicians, namely the law Ex Impossibili Quodlibet, EIQ, and the rules of disjunction introduction. Since, according to EIQ, the impossible proposition (p ∧ ∼p) implies every proposition, it also implies ∼(p∧∼p), in contradiction to AT2. Furthermore, by way of disjunction introduction, the proposition (p∨∼p) is implied both by p and by ∼p, in contradiction to AT1. Kilwardby tried to defend AT1, AT2 against these objections by claiming that EIQ holds only for accidental but not for natural implications. The second argument, however, cannot be refuted in this way because Kilwardby had to admit that every disjunction (p ∨ q) is naturally implied by its disjuncts. He therefore introduced the further requirement that, in order to constitute a genuine counterexample to AT1, (p → q) and (∼p → q) have to hold “by virtue of the same thing”. In a recently published paper, Spencer Johnston accepted this futile defence of AT1 and developed a formal semantics that would fit Kilwardby’s presumably connexive implication. This procedure, however, is misguided because the remaining considerations of Lesson 55  which were entirely ignored by Johnston  show that Kilwardby eventually recognized that AT2 is bound to fail. After all he concluded: “So it should be granted that from the impossible its opposite follows, and that the necessary follows from its opposite”. (shrink)

This paper provides an inferentialist motivation for a logic belonging in the connexive family, by borrowing elements from the bilateralist interpretation for Classical Logic without the Cut rule, proposed by David Ripley. The paper focuses on the relation between inferentialism and relevance, through the exploration of what we call relevant assertion and denial, showing that a connexive system emerges as a symptom of this interesting link. With the present attempt we hope to broaden the available interpretations for connexive logics, showing (...) they can be rightfully motivated in terms of certain relevantist constraints imposed on assertion and denial. (shrink)

While Classical Logic (CL) used to be the gold standard for evaluating the rationality of human reasoning, certain non-theorems of CL—like Aristotle’s and Boethius’ theses—appear intuitively rational and plausible. Connexive logics have been developed to capture the underlying intuition that conditionals whose antecedents contradict their consequents, should be false. We present results of two experiments (total n = 72), the first to investigate connexive principles and related formulae systematically. Our data suggest that connexive logics provide more plausible rationality frameworks for (...) human reasoning compared to CL. Moreover, we experimentally investigate two approaches for validating connexive principles within the framework of coherence-based probability logic (Pfeifer & Sanfilippo, 2021). Overall, we observed good agreement between our predictions and the data, but especially for Approach 2. (shrink)

In this paper we elaborate a conception of entailment based on what we call the Ackermann principle, which explicates valid entailment through a logical connection between sentences depending on their informational content. We reconstruct Dunn’s informational semantics for entailment on the basis of Restall’s approach, with assertion and denial as two independent speech acts, by introducing the notion of a ‘position description’. We show how the machinery of position descriptions can effectively be used to define the positive and the negative (...) information carried by sentences of a given language and to present a formalized version of the Ackermann principle as an inclusion relationship between the informational contents of the conclusions and the premises of a valid entailment. Being so interpreted, the entailment relation exhibits certain properties, including the property of transitivity. Whereas properties such as Anderson and Belnap’s variable sharing property or Parry’s proscriptive principle are normally presented as imposing a relevance requirement on valid entailment, the suggested formalization of the Ackermann principle supports all of Gentzen’s structural rules, including weakening, a rule that is normally given up in sequent-style proof systems for relevance logics. In this way we propose an Ackermann-inspired explication of the nature of entailment as a relation between the informational contents of sentences. (shrink)

How to say no less, no more about conditional than what is needed? From a logical analysis of necessary and sufficient conditions (Section 1), we argue that a stronger account of conditional can be obtained in two steps: firstly, by reminding its historical roots inside modal logic and set-theory (Section 2); secondly, by revising the meaning of logical values, thereby getting rid of the paradoxes of material implication whilst showing the bivalent roots of conditional as a speech-act based on affirmations (...) and rejections (Section 3). Finally, the two main inference rules for conditional, viz. Modus Ponens and Modus Tollens, are reassessed through a broader definition of logical consequence that encompasses both a normal relation of truth propagation and a weaker relation of falsity non-propagation from premises to conclusion (Section 3). (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)

Logical pluralism is a general idea that there is more than one correct logic. Carnielli and Rodrigues [2019a] defend an epistemic interpretation of the paraconsistent logic N4, according to which an argument is valid in this logic just in case it necessarily preserves evidence. The authors appeal to this epistemic interpretation to briefly motivate a kind of logical pluralism: “different accounts of logical consequence may preserve different properties of propositions”. The aim of this paper is to study the prospect of (...) a logical pluralism based on different interpretations of logical systems. First, we give our analysis of what it means to interpret a logic – and make some hopefully useful distinctions along the way. Second, we present what we call an interpretational logical pluralism: there is more than one correct logic and a logic is correct only if it has some adequate interpretation. We consider four variants of this idea, bring up some possible objections, and try to find plausible solutions on behalf of the pluralist. We will argue that interpretations of logical systems provide a promising – albeit not unproblematic – route to logical pluralism. (shrink)

The paper provides an alternative interpretation of ‘pair points’, discussed in Beall et al., "On the ternary relation and conditionality", J. of Philosophical Logic 41(3), 595-612. Pair points are seen as points viewed from two different ‘perspectives’ and the latter are explicated in terms of two independent valuations. The interpretation is developed into a semantics using pairs of Kripke models (‘pair models’). It is demonstrated that, if certain conditions are fulfilled, pair models are validity-preserving copies of positive substructural models. This (...) yields a general soundness and completeness result for a variety of (positive) substructural logics with respect to multimodal Kripke frames with binary accessibility relations. In addition, an epistemic interpretation of pair models is provided. (shrink)

Special issue: "Reflecting on the Legacy of C.I. Lewis: Contemporary and Historical Perspectives on Modal Logic".

This volume presents recent advances in philosophical logic with chapters focusing on non-classical logics, including paraconsistent logics, substructural logics, modal logics of agency and other modal logics. The authors cover themes such as the knowability paradox, tableaux and sequent calculi, natural deduction, definite descriptions, identity, truth, dialetheism and possible worlds semantics. The developments presented here focus on challenging problems in the specification of fundamental philosophical notions, as well as presenting new techniques and tools, thereby contributing to the development of the (...) field. Each chapter contains a bibliography, to assist the reader in making connections in the specific areas covered. Thus this work provides both a starting point for further investigations into philosophical logic and an update on advances, techniques and applications in a dynamic field. The chapters originate from papers presented during the Trends in Logic XI conference at the Ruhr University Bochum, June 2012. (shrink)

One of the oldest systems of paraconsistent logic is the set of so-called C-systems of Newton da Costa, and this has been generalized into a family of systems now known as logics of formal inconsistencies by Walter Carnielli, Marcelo Coniglio and João Marcos. The characteristic notion in these systems is the so-called consistency operator which, roughly speaking, indicates how gluts are behaving. One natural question then is to ask if we can let not only gluts but also gaps be around (...) and generalize the notion of consistency into classicality. This is already considered by Andréa Loparić and da Costa in the style of C-systems. The aim of this paper is to develop a family of systems that generalizes the system of Loparić and da Costa which may be called logics of formal classicality. (shrink)

In this paper, I stress the utility of employing test-driven development (TDD) for conceiving logical systems. TDD, originally invented in the context of Extreme Programming, is a methodology widely used by software engineers to conceive and develop programs. Its main principle is to design the tests of the expected properties of the system before the development phase. I argue that this methodology is especially convenient in conceiving applied logics. Indeed, this technique is efficient with most decidable logics having a software (...) implementation. Having a clear list of the desired inferences right from the beginning makes it possible to refine the properties of the system step by step until its completion. I distinguish and detail seven advantages of the usage of TDD for the conception of a logical theory. Most importantly, this methodology increases the predictability of the inferential power of the theory. A second important benefit is that the time required for the conception of the logic goes down dramatically. This methodology will change both ideas and practices. Logic is no longer considered to be a formal science, but rather to be an empirical one. Research in the field is geared toward specific and concrete goals. Programs are considered tools used to verify the conformity of formal theories. To sum up, I defend the view that, in some situations, this way of designing a formal system brings significant benefits, and that the construction of new logics can be conducted similarly to the development of open source software. (shrink)

We develop some of Williamson’s ideas regarding how propositional calculus aids in comprehending Aristotelian logic. Specifically, we enhance the utilisation of truth tables to examine the structure of opposition diagrams. Using ‘conditioned truth tables’, we establish logical dependency relationships between the truth values of different propositions. This approach proves effective in interpreting various texts of the Organon concerning the doctrine of opposition.