Since the publication of David Lewis’ Counterfactuals, the standard line on subjunctive conditionals with impossible antecedents (or counterpossibles) has been that they are vacuously true. That is, a conditional of the form ‘If p were the case, q would be the case’ is trivially true whenever the antecedent, p, is impossible. The primary justification is that Lewis’ semantics best approximates the English subjunctive conditional, and that a vacuous treatment of counterpossibles is a consequence of that very elegant theory. Another justification (...) derives from the classical lore than if an impossibility were true, then anything goes. In this paper we defend non-vacuism, the view that counterpossibles are sometimes non-vacuously true and sometimes non-vacuously false. We do so while retaining a Lewisian semantics, which is to say, the approach we favor does not require us to abandon classical logic or a similarity semantics. It does however require us to countenance impossible worlds. An impossible worlds treatment of counterpossibles is suggested (but not defended) by Lewis (Counterfactuals. Blackwell, Oxford, 1973), and developed by Nolan (Notre Dame J Formal Logic 38:325–527, 1997), Kment (Mind 115:261–310, 2006a: Philos Perspect 20:237–302, 2006b), and Vander Laan (In: Jackson F, Priest G (eds) Lewisian themes. Oxford University Press, Oxford, 2004). We follow this tradition, and develop an account of comparative similarity for impossible worlds. (shrink)

In this paper, we study two companions of a logic, viz., the left variable inclusion companion and the restricted rules companion, their nature and interrelations, especially in connection with paraconsistency. A sufficient condition for the two companions to coincide has also been proved. Two new logical systems—intuitionistic paraconsistent weak Kleene logic (IPWK) and paraconsistent pre-rough logic (PPRL)—are presented here as examples of logics of left variable inclusion. IPWK is the left variable inclusion companion of intuitionistic propositional logic and is also (...) the restricted rules companion of it. PPRL, on the other hand, is the left variable inclusion companion of pre-rough logic but differs from the restricted rules companion of it. We have discussed algebraic semantics for these logics in terms of Płonka sums. This amounts to introducing a contaminating truth value, intended to denote a state of indeterminacy. (shrink)

The naive theory of properties states that for every condition there is a property instantiated by exactly the things which satisfy that condition. The naive theory of properties is inconsistent in classical logic, but there are many ways to obtain consistent naive theories of properties in nonclassical logics. The naive theory of classes adds to the naive theory of properties an extensionality rule or axiom, which states roughly that if two classes have exactly the same members, they are identical. In (...) this paper we examine the prospects for obtaining a satisfactory naive theory of classes. We start from a result by Ross Brady, which demonstrates the consistency of something resembling a naive theory of classes. We generalize Brady’s result somewhat and extend it to a recent system developed by Andrew Bacon. All of the theories we prove consistent contain an extensionality rule or axiom. But we argue that given the background logics, the relevant extensionality principles are too weak. For example, in some of these theories, there are universal classes which are not declared coextensive. We elucidate some very modest demands on extensionality, designed to rule out this kind of pathology. But we close by proving that even these modest demands cannot be jointly satisfied. In light of this new impossibility result, the prospects for a naive theory of classes are bleak. (shrink)

Varieties of natural deduction systems are introduced for Wansing’s paraconsistent non-commutative substructural logic, called a constructive sequential propositional logic (COSPL), and its fragments. Normalization, strong normalization and Church-Rosser theorems are proved for these systems. These results include some new results on full Lambek logic (FL) and its fragments, because FL is a fragment of COSPL.

The view that contradictions cannot be true has been part of accepted philosophical theory since at least the time of Aristotle. In this regard, it is almost unique in the history of philosophy. Only in the last forty years has the view been systematically challenged with the advent of dialetheism. Since Graham Priest introduced dialetheism as a solution to certain self-referential paradoxes, the possibility of true contradictions has been a live issue in the philosophy of logic. Yet, despite the arguments (...) advanced by dialetheists, many logicians and philosophers still hold the opinion that contradictions cannot be true. -/- Rather than advocating the truth of certain contradictions, this thesis offers a different challenge to the classical logician. By showing that it can be philosophically coherent to propose that true contradictions are metaphysically possible, the thesis suggests that the classical logician must do more than she currently has to justify her confidence in the impossibility of true contradictions. Simply fighting off the dialetheist’s putative examples of true contradictions at the actual world isn’t enough to justify the classical logician’s conclusion that true contradictions are impossible. -/- To aid the thesis dialectically, we introduce a new position, absolutism, which hypothesises that it’s metaphysically possible for at least one contradiction to be true, contrasting with the dialetheic hypothesis that some contradictions are true in the actual world. We demonstrate that absolutism can be given a philosophically coherent interpretation, an appropriate logic, and that certain criticisms are completely toothless against absolutism. The challenge put to the classical logician is then: On what logical or philosophical grounds can we rule out the metaphysical possibility of true contradictions? (shrink)

The non-alethic systems N1 of da Costa and A of Grana are both paraconsistent and paracomplete. Based on them, a multi-agent doxastic logic NADK can be obtained by logical expansion. The soundness and completeness of NADK are proved and its special theorems are also presented. In this logic, the belief version of the laws of contradiction and excluded middle, as well as the principle of explosion are all invalid. Therefore, it may provide a reliable logical basis for any theory which (...) has paraconsistent or paracomplete epistemic conflicts, such as true contradictions, true contrarieties, and belief paradoxes. We also explain in detail how a non-alethic doxastic logic provides a reliable logical basis for tolerating these three types of epistemic conflicts. The present paper is the deepening and development of system N1 and A. (shrink)

Richard Sylvan (né Routley) was one of Australasia's most prolific and systematic philosophers. Though known for his innovative work in logic and metaphysics, the astonishing breadth of his philosophical endeavours included almost all reaches of philosophy. Taking the view that very basic assumptions of mainstream philosophy were fundamentally mistaken, he sought radical change across a wide range of theories. However, his view of the centrality of logic and recognition of the possibilities opened up by logical innovation in the fundamental areas (...) of metaphysics resulted in his working primarily in these two, closely connected fields. It is this work in logic and metaphysics that is the main focus of what follows. (shrink)

Wansing’s extended intuitionistic linear logic with strong negation, called WILL, is regarded as a resource-conscious refinment of Nelson’s constructive logics with strong negation. In this paper, (1) the completeness theorem with respect to phase semantics is proved for WILL using a method that simultaneously derives the cut-elimination theorem, (2) a simple correspondence between the class of Petri nets with inhibitor arcs and a fragment of WILL is obtained using a Kripke semantics, (3) a cut-free sequent calculus for WILL, called twist (...) calculus, is presented, (4) a strongly normalizable typed λ-calculus is obtained for a fragment of WILL, and (5) new applications of WILL in medical diagnosis and electric circuit theory are proposed. Strong negation in WILL is found to be expressible as a resource-conscious refutability, and is shown to correspond to inhibitor arcs in Petri net theory. (shrink)

Logical analyses of scientific representations of the world have usually focused on axiomatized or axiomatizable theories. As practiced, science seldom employs such theories. Rather, we find aggregations of claims, the logical relations of which are not as neat as philosophers of science might like them to be. Indeed, a common feature of such aggregations is the presence of certain “theoretical anomalies,” statements that are in some way incompatible with the remainder of the corpus. Huygens’ description of light as exhibiting an (...) asymmetry with respect to its direction of propagation in polarization phenomena was such an anomaly because of its inconsistency with his account of light as longitudinal waves in a medium. (See Sabra 1981, pp. 226-227.) Although the occurrence of these anomalies is indicative of a problem that must be dealt with, inconsistent representations of the world are not without significant heuristic value. (shrink)

A general Gentzen-style framework for handling both bilattice (or strong) negation and usual negation is introduced based on the characterization of negation by a modal-like operator. This framework is regarded as an extension, generalization or re- finement of not only bilattice logics and logics with strong negation, but also traditional logics including classical logic LK, classical modal logic S4 and classical linear logic CL. Cut-elimination theorems are proved for a variety of proposed sequent calculi including CLS (a conservative extension of (...) CL) and CLScw (a conservative extension of some bilattice logics, LK and S4). Completeness theorems are given for these calculi with respect to phase semantics, for SLK (a conservative extension and fragment of LK and CLScw, respectively) with respect to a classical-like semantics, and for SS4 (a conservative extension and fragment of S4 and CLScw, respectively) with respect to a Kripke-type semantics. The proposed framework allows for an embedding of the proposed calculi into LK, S4 and CL. (shrink)

It is known that the full computation-tree logic CTL * is an important base logic for model checking. The bisimulation theorem for CTL* is known to be useful for abstraction in model checking. In this paper, the bisimulation theorems for two paraconsistent four-valued extensions 4CTL* and 4LCTL* of CTL* are shown, and a translation from 4CTL* into CTL* is presented. By using 4CTL* and 4LCTL*, inconsistency-tolerant and spatiotemporal reasoning can be expressed as a model checking framework.

In [Waragai & Shidori, 2007], a system of paraconsistent logic called PCL1, which takes a similar approach to that of da Costa, is proposed. The present paper gives further results on this system and its related systems. Those results include the concrete condition to enrich the system PCL1 with the classical negation, a comparison of the concrete notion of “behaving classically” given by da Costa and by Waragai and Shidori, and a characterisation of the notion of “behaving classically” given by (...) Waragai and Shidori. (shrink)

In our approach credibility of information plays an importantrole in modeling of both belief state and belief change [4]. It turns out thatthe credibility-based consequence operators used to define the notion of beliefstate tolerate inconsistency under some conditions.