Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as possible. In this paper we introduce the strongest possible notion of maximal paraconsistency, and investigate it in the context of logics that are based on deterministic or non-deterministic three-valued matrices. We show that all reasonable paraconsistent logics based on three-valued deterministic matrices are maximal in our strong sense. This applies to practically all three-valued (...) paraconsistent logics that have been considered in the literature, including a large family of logics which were developed by da Costa's school. Then we show that in contrast, paraconsistent logics based on three-valued properly nondeterministic matrices are not maximal, except for a few special cases (which are fully characterized). However, these non-deterministic matrices are useful for representing in a clear and concise way the vast variety of the (deterministic) three-valued maximally paraconsistent matrices. The corresponding weaker notion of maximality, called premaximal paraconsistency, captures the "core" of maximal paraconsistency of all possible paraconsistent determinizations of a non-deterministic matrix, thus representing what is really essential for their maximal paraconsistency. (shrink)

“Weak relevant model structures” (wr-ms) are defined on “weak relevant matrices” by generalizing Brady’s model structure ${\mathcal{M}_{\rm CL}}$ built upon Meyer’s Crystal matrix CL. It is shown how to falsify in any wr-ms the Generalized Modus Ponens axiom and similar schemes used to derive Curry’s Paradox. In the last section of the paper we discuss how to extend this method of falsification to more general schemes that could also be used in deriving Curry’s Paradox.

We discuss Smirnovs problem of finding a common background for classifying implicational logics. We formulate and solve the problem of extending, in an appropriate way, an implicational fragment H of the intuitionistic propositional logic to an implicational fragment TV of the classical propositional logic. As a result we obtain logical constructions having the form of Boolean lattices whose elements are implicational logics. In this way, whole classes of new logics can be obtained. We also consider the transition from implicational logics (...) to full logics. On the base of the lattices constructed, we formulate the main classification principles for propositional logics. (shrink)

The present PhD dissertation aims to examine the relation between modality and change in Aristotle’s metaphysics. -/- On the one hand, Aristotle supports his modal realism (i.e., worldly objects have modal properties - potentialities and essences - that ground the ascriptions of possibility and necessity) by arguing that the rejection of modal realism makes change inexplicable, or, worse, banishes it from the realm of reality. On the other hand, the Stagirite analyses processes by means of modal notions (‘change is the (...) actuality of what is virtual insofar as it is virtual’). In other words: to grasp what change is, one has to resort to the modal idiom of potentialities, while the fact that there is change is indicative of the fact that nature is full of modal properties. -/- Aristotle’s modal and kinetic realism finds a negative in the figure of the Megaric Diodorus Kronus. The polemical situation of Greek philosophy has indeed the dialectical advantage of not opposing the Aristotelian position to a sui generis straw man. Both in its reduction of modal judgements to temporal quantifications and in its dissolution of the reality of the state-of-being-in-motion in favour of a cinematographic view of processes, the philosophical figure of reductionist antirealism embodied by Diodorus constitutes an alternative that takes the opposite view of Aristotle’s realism. -/- The present study is structured as a discussion between these two positions. In the face of Diodorus’ antirealist challenges, Aristotle articulates modal and kinetic considerations: the answers he gives to Diodorus’ puzzles thus provide valuable insight into his metaphysics. Moreover, the examination of Aristotle’s and Diodorus’ metaphysics, because of their insight and originality, will not fail to interest the philosopher concerned with the metaphysical foundations of modern physics, insofar as the entanglement between modalities and processes is nowadays at the core of mechanics (phase spaces, path integrals, etc.). (shrink)

Among Dunn’s many important contributions to relevance logic was his work on the system RM (R-mingle). Although RM is an interesting system in its own right, it is widely considered to be too strong. In this chapter, I revisit a closely related system, RM0 (sometimes known as ‘constructive mingle’), which includes the mingle axiom while not degenerating in the way that RM itself does. My main interest will be in examining this logic from two related semantical perspectives. First, I give (...) a purely operational bisemilattice semantics for it by adapting previous work of Humberstone. Second, I examine a more conventional algebraic semantics for it and discuss how this relates to the operational semantics. A novel operational semantics for J (intuitionistic logic) as well as its conventional Heyting algebraic semantics emerge as special cases of the corresponding semantics for RM0. The results of this chapter suggest that RM0 is a more interesting logic than has been appreciated and that Humberstone’s operational semantic framework similarly deserves more attention than it has received. (shrink)

Although much technical and philosophical attention has been given to relevance logics, the notion of relevance itself is generally left at an intuitive level. It is difficult to find in the literature an explicit account of relevance in formal reasoning. In this article I offer a formal explication of the notion of relevance in deductive logic and argue that this notion has an interesting place in the study of classical logic. The main idea is that a premise is relevant to (...) an argument when it contributes to the validity of that argument. I then argue that the sequents which best embody this ideal of relevance are the so-called perfect sequents—that is, sequents which are valid but have no proper subsequents that are valid. Church’s theorem entails that there is no recursively axiomatizable proof-system that proves all and only the perfect sequents, so the project that emerges from studying perfection in classical logic is not one of finding a perfect subsystem of classical logic, but is rather a comparative study of classifying subsystems of classical logic according to how well they approximate the ideal of perfection. (shrink)

Greek antiquity saw the development of two distinct systems of logic: Aristotle’s theory of the categorical syllogism and the Stoic theory of the hypothetical syllogism. Some ancient logicians argued that hypothetical syllogistic is more fundamental than categorical syllogistic on the grounds that the latter relies on modes of propositional reasoning such asreductio ad absurdum. Peripatetic logicians, by contrast, sought to establish the priority of categorical over hypothetical syllogistic by reducing various modes of propositional reasoning to categorical form. In the 17th (...) century, this Peripatetic program of reducing hypothetical to categorical logic was championed by Gottfried Wilhelm Leibniz. In an essay titledSpecimina calculi rationalis, Leibniz develops a theory of propositional terms that allows him to derive the rule ofreductio ad absurdumin a purely categorical calculus in which every proposition is of the formA is B. We reconstruct Leibniz’s categorical calculus and show that it is strong enough to establish not only the rule ofreductio ad absurdum, but all the laws of classical propositional logic. Moreover, we show that the propositional logic generated by the nonmonotonic variant of Leibniz’s categorical calculus is a natural system of relevance logic known as RMI$_{{}_ \to ^\neg }$. (shrink)

The logic RM and its basic fragments (always with implication) are considered here as entire consequence relations, rather than as sets of theorems. A new observation made here is that the disjunction of RM is definable in terms of its other positive propositional connectives, unlike that of R. The basic fragments of RM therefore fall naturally into two classes, according to whether disjunction is or is not definable. In the equivalent quasivariety semantics of these fragments, which consist of subreducts of (...) Sugihara algebras, this corresponds to a distinction between strong and weak congruence properties. The distinction is explored here. A result of Avron is used to provide a local deduction-detachment theorem for the fragments without disjunction. Together with results of Sobociski, Parks and Meyer (which concern theorems only), this leads to axiomatizations of these entire fragments — not merely their theorems. These axiomatizations then form the basis of a proof that all of the basic fragments of RM with implication are finitely axiomatized consequence relations. (shrink)

We suggest two precise abstract definitions of the notion of ‘relevance logic’ which are both independent of any proof system or semantics. We show that according to the simpler one, R → source is the minimal relevance logic, but R itself is not. In contrast, R and many other logics are relevance logics according to the second definition, while all fragments of linear logic are not.

It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMImin has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMImin is decidable.

As is well known, the variable-sharing property (vsp) is, according to Anderson and Belnap, a necessary property of any relevant logic. In this paper, we shall consider two versions of the vsp, what we label the "weak vsp" (wvsp) and the "strong vsp" (svsp). In addition, the "no loose pieces property," a property related to the wvsp and the svsp, will be defined. Each one of these properties shall generally be characterized by means of a class of logical matrices. In (...) this way, any logic verified by an actual matrix in one of these classes has the property the class generally represents. Particular matrices (and so, logics) in each class are provided. (shrink)

We show that as long as the propositional constants t and f are not included in the language, any language-preserving extension of any important fragment of the relevance logics R and RMI can have only classical tautologies as theorems . This property is not preserved, though, if either t or f is added to the language, or if the contraction axiom is deleted.