Questions concerning the proof-theoretic strength of classical versus nonclassical theories of truth have received some attention recently. A particularly convenient case study concerns classical and nonclassical axiomatizations of fixed-point semantics. It is known that nonclassical axiomatizations in four- or three-valued logics are substantially weaker than their classical counterparts. In this paper we consider the addition of a suitable conditional to First-Degree Entailment—a logic recently studied by Hannes Leitgeb under the label HYPE. We show in particular that, by (...) formulating the theory PKF over HYPE, one obtains a theory that is sound with respect to fixed-point models, while being proof-theoretically on a par with its classical counterpart KF. Moreover, we establish that also its schematic extension—in the sense of Feferman—is as strong as the schematic extension of KF, thus matching the strength of predicative analysis. (shrink)

Relevant logics have traditionally been viewed as paraconsistent. This paper shows that this view of relevant logics is wrong. It does so by showing forth a logic which extends classical logic, yet satisfies the Entailment Theorem as well as the variable sharing property. In addition it has the same S4-type modal feature as the original relevant logic E as well as the same enthymematical deduction theorem. The variable sharing property was only ever regarded as a necessary property for a logic (...) to have in order for it to not validate the so-called paradoxes of implication. The Entailment Theorem on the other hand was regarded as both necessary and sufficient. This paper shows that the latter theorem also holds for classical logic, and so cannot be regarded as a sufficient property for blocking the paradoxes. The concept of suppression is taken up, but shown to be properly weaker than that of variable sharing. (shrink)

We investigate the notion of classical negation from a non-classical perspective. In particular, one aim is to determine what classical negation amounts to in a paracomplete and paraconsistent four-valued setting. We first give a general semantic characterization of classical negation and then consider an axiomatic expansion BD+ of four-valued Belnap–Dunn logic by classical negation. We show the expansion complete and maximal. Finally, we compare BD+ to some related systems found in the literature, specifically a four-valued modal logic of Béziau and (...) the logic of classical implication and a paraconsistent de Morgan negation of Zaitsev. (shrink)

We collect together some misgivings about the logic R of relevant inplication, and then give support to a weak entailment logic $DJ^{d}$ . The misgivings centre on some recent negative results concerning R, the conceptual vacuousness of relevant implication, and the treatment of classical logic. We then rectify this situation by introducing an entailment logic based on meaning containment, rather than meaning connection, which has a better relationship with classical logic. Soundness and completeness results are proved for $DJ^{d}$ with respect (...) to a content semantics, which embraces the concept of meaning containment. (shrink)

The post-classical genre of the “protocols for dialectical inquiry and disputation” has its more proximate origins in the famed Risāla of Shams al-Dīn al-Samarqandī. The greater part of his conceptions and methodology, however, consists in a streamlining and universalizing of the more strictly juristic dialectic of his teacher Burhān al-Dīn al-Nasafī ; and this in turn draws on the highly logicized dialectic of Rukn al-Dīn al-ʿAmīdī and his teacher Raḍī al-Dīn al-Nīsābūrī. At the heart of methods in this lineage, and (...) carried forward by al-Samarqandī into the universal ādāb al-baḥth, are three truth-preserving logical relationships critical to the truth-seeking enterprise of dialectic: entailment, mutual negation or exclusion, and causal concomitance. The practical elaboration of these relations reveals a logic in action—a premodern dialogical logic for living disputation praxis. In fact, so critical were these to the dialectical enterprise that al-Samarqandī devoted a specialized treatise entirely to summarizing their defining features and rules, aptly naming it the ʿAyn al-Naẓar, or “Wellspring of Rational Investigation.” In this article, and drawing upon a recently published digital critical edition, I will present an analytical outline of these core logical relations as presented in the ʿAyn al-Naẓar. Then I will address a number of points of interest in this text, grouped under six themes: the potential for cross-disciplinary advancement; notions in discursive development; significant or uniquely contributive formulations; peculiarities of content; signs of an evolving, universalist agenda; and evidence that the ʿAyn al-Naẓar was designed as an aide-mémoire for the active disputant. (shrink)

We collect together some misgivings about the logic R of relevant inplication, and then give support to a weak entailment logic $DJ^{d}$ . The misgivings centre on some recent negative results concerning R, the conceptual vacuousness of relevant implication, and the treatment of classical logic. We then rectify this situation by introducing an entailment logic based on meaning containment, rather than meaning connection, which has a better relationship with classical logic. Soundness and completeness results are proved for $DJ^{d}$ with respect (...) to a content semantics, which embraces the concept of meaning containment. (shrink)

The well-known logic first degree entailment logic (FDE), introduced by Belnap and Dunn, is defined with |$\wedge $|⁠, |$\vee $| and |$\sim $| as the sole primitive connectives. The aim of this paper is to establish the lattice formed by the class of all 4-valued C-extending implicative expansions of FDE verifying the axioms and rules of Routley and Meyer’s basic logic B and its useful disjunctive extension B|$^{\textrm {d}}$|⁠. It is to be noted that Boolean negation (so, classical propositional logic) (...) is definable in the strongest element in the said class. (shrink)

The paper contains two concepts of implication that can be called analytic in the sense of Parry [5] or Fine [2]. Contrary to the Parry's approach, these implications do not involve S4 strict implication but the classical one. This fact refers to the similar notion of so-called demodalized analytic implication of Dunn [1] and strong implication of Vanderveken, cf. [4, 6]. The features of analytic classical implications are presented in the form of two propositional logics on the pure implicational language.

This edited volume focuses on the work of Professor Larisa Maksimova, providing a comprehensive account of her outstanding contributions to different branches of non-classical logic. The book covers themes ranging from rigorous implication, relevance and algebraic logic, to interpolation, definability and recognizability in superintuitionistic and modal logics. It features both her scientific autobiography and original contributions from experts in the field of non-classical logics. Professor Larisa Maksimova's influential work involved combining methods of algebraic and relational semantics. Readers will be able (...) to trace both influences on her work, and the ways in which her work has influenced other logicians. In the historical part of this book, it is possible to trace important milestones in Maksimova’s career. Early on, she developed an algebraic semantics for relevance logics and relational semantics for the logic of entailment. Later, Maksimova discovered that among the continuum of superintuitionisitc logics there are exactly three pretabular logics. She went on to obtain results on the decidability of tabularity and local tabularity problems for superintuitionistic logics and for extensions of S4. Further investigations by Maksimova were aimed at the study of fundamental properties of logical systems in big classes of logics, and on decidability and recognizability of such properties. To this end she determined a powerful combination of algebraic and semantic methods, which essentially determine the modern state of investigations in the area, as can be seen in the later chapters of this book authored by leading experts in non-classical logics. These original contributions bring the reader up to date on the very latest work in this field. (shrink)

The Liar paradox arguably shows that a coherent and self-applicable notion of truth is governed by nonclassical logic. It then seems natural to conclude that classical logic is inadequate for defining a truth theory. In this article, we argue that this is not the case. In the spirit of Reinhardt (Math Logic Formal Syst 94:227, 1985; J Philos Logic 15:219–251, 1986), and in analogy with Hilbert’s program for the foundation of classical mathematics, we will articulate an instrumentalist justification for (...) the use classical logic: it will be argued that classical reasoning is a _useful but dispensable instrument_, which can yield philosophically adequate truth theories. (shrink)

Classical logic is traditionally introduced by itself, but that makes it seem arbitrary and unnatural. This text introduces classical alongside several nonclassical logics (relevant, constructive, quantative, paraconsistent).

A consequence relation is strongly classical if it has all the theorems and entailments of classical logic as well as the usual meta-rules (such as Conditional Proof). A consequence relation is weakly classical if it has all the theorems and entailments of classical logic but lacks the usual meta-rules. The most familiar example of a weakly classical consequence relation comes from a simple supervaluational approach to modelling vague language. This approach is formally equivalent to an account of logical consequence according (...) to which α1, ..., αn entails β just in case □α1, ..., □αn entails □β in the modal logic S5. This raises a natural question: If we start with a different underlying modal logic, can we generate a strongly classical logic? This paper explores this question. In particular, it discusses four related technical issues: (1) Which base modal logics generate strongly classical logics and which generate weakly classical logics? (2) Which base logics generate themselves? (3) How can we directly characterize the logic generated from a given base logic? (4) Given a logic that can be generated, which base logics generate it? The answers to these questions have philosophical interest. They can help us to determine whether there is a plausible supervaluational approach to modelling vague language that yields the usual meta-rules. They can also help us to determine the feasibility of other philosophical projects that rely on an analogous formalism, such as the project of defining logical consequence in terms of the preservation of an epistemic status. (shrink)

This paper focuses on the relation between logic and ontology. In particular, it demonstrates how classical logical theory can clarify the ontological part of Ludwig Wittgenstein’s Tractatus Logico-Philosophicus. To this end, the work examines the adequacy of a formal system that was devised by the Polish logician, mathematician and philosopher Roman Suszko (1919–1979) as a model for the Tractatus. Following a brief explanation of the Tractarian ontology, the main ideas of Suszko’s system and its philosophical significance will be considered. The (...) latter will be illustrated in the context of central Tractarian concepts. Finally, two implications for a better understanding of the Tractarian ontology will be pointed out. (shrink)

This monograph presents a general theory of weakly implicative logics, a family covering a vast number of non-classical logics studied in the literature, concentrating mainly on the abstract study of the relationship between logics and their algebraic semantics. It can also serve as an introduction to algebraic logic, both propositional and first-order, with special attention paid to the role of implication, lattice and residuated connectives, and generalized disjunctions. Based on their recent work, the authors develop a powerful uniform framework for (...) the study of non-classical logics. In a self-contained and didactic style, starting from very elementary notions, they build a general theory with a substantial number of abstract results. The theory is then applied to obtain numerous results for prominent families of logics and their algebraic counterparts, in particular for superintuitionistic, modal, substructural, fuzzy, and relevant logics. The book may be of interest to a wide audience, especially students and scholars in the fields of mathematics, philosophy, computer science, or related areas, looking for an introduction to a general theory of non-classical logics and their algebraic semantics. (shrink)

Demonstrating the different roles that logic plays in the disciplines of computer science, mathematics, and philosophy, this concise undergraduate textbook covers select topics from three different areas of logic: proof theory, computability theory, and nonclassical logic. The book balances accessibility, breadth, and rigor, and is designed so that its materials will fit into a single semester. Its distinctive presentation of traditional logic material will enhance readers' capabilities and mathematical maturity. The proof theory portion presents classical propositional logic and first-order (...) logic using a computer-oriented (resolution) formal system. Linear resolution and its connection to the programming language Prolog are also treated. The computability component offers a machine model and mathematical model for computation, proves the equivalence of the two approaches, and includes famous decision problems unsolvable by an algorithm. The section on nonclassical logic discusses the shortcomings of classical logic in its treatment of implication and an alternate approach that improves upon it: Anderson and Belnap's relevance logic. Applications are included in each section. The material on a four-valued semantics for relevance logic is presented in textbook form for the first time. Aimed at upper-level undergraduates of moderate analytical background, Three Views of Logic will be useful in a variety of classroom settings. Gives an exceptionally broad view of logic. Treats traditional logic in a modern format. Presents relevance logic with applications. Provides an ideal text for a variety of one-semester upper-level undergraduate courses. (shrink)

ABSTRACT The concept of paraconsistent logical consequence is usually negatively defined as a validity semantics in which not every sentences is deducible or in which inferential explosion does not occur. Paraconsistency has been negatively characterized in this way because paraconsistent logics have been designed specifically to avoid the trivialization of deductive inference entailed by the classical paradoxes of material implication for applications in a system that tolerates syntactical contradictions. The effect of the negative characterization of paraconsistency has been to encourage (...) an unsystematic development of distinct versions of paraconsistent logic. It has also contributed to a restricted overview of the full range of paraconsistent formalisms. After reviewing a standard negative characterization of paraconsistency and commenting on its limitations, I propose a positive characterization that makes possible a constructivistic description of the complete spectrum of distinct families of paraconsistent logics, and the description of a new type of maximally relevant paraconsistency, which I argue compares favorably with previously identified categories of paraconsistent logics. (shrink)

This is a survey paper of approaches to the concept of logical implication. Roughly stated the main motivation of these approaches is to provide a necessary and sufficient condition for a set of propositions to logically imply a single proposition. In regard to their affinities these approaches are grouped into two: the transformational conception and the informational conception. Some approaches in each conception are philosophical and some are mathematical in character, their common assumption being that they reflect a previous intuition (...) – in some cases – already at work in classical mathematics. The first part of the paper is devoted to approaches within the transformational conception of logical implication emphasizing the contributions of Bolzano, Russell, Tarski, Quine and current model – theory. The second part of the paper discusses approaches within the informational conception of logical implication. Carnap and Bar Hillel’s extrinsic approach and Corcoran’s intrinsic approach developed in his information-theoretic logic are respectively compared and some of their philosophical underpinnings are brought to light. The paper concludes with some final remarks concerning the ontic question of the nature of logical implication and the epistemic question of the human access to this relation in both conceptions of logical implication. The article also attempts to connect the views of these representative thinkers with the current philosophical debate on the nature of logical consequence and the role of set-theoretic model theory in philosophy of logic. (shrink)

The semantic valuations of classical logic, strong Kleene logic, the logic of paradox and the logic of first-degree entailment, all respect the Dunn conditions: we call them Dunn logics. In this paper, we study the interpolation properties of the Dunn logics and extensions of these logics to more expressive languages. We do so by relying on the \ calculus, a signed tableau calculus whose rules mirror the Dunn conditions syntactically and which characterizes the Dunn logics in a uniform way. In (...) terms of the \ calculus, we first introduce two different interpolation methods, each of which uniformly shows that the Dunn logics have the interpolation property. One of the methods is closely related to Maehara’s method but the other method, which we call the pruned tableau method, is novel to this paper. We provide various reasons to prefer the pruned tableau method to the Maehara-style method. We then turn our attention to extensions of Dunn logics with so-called appropriate implication connectives. Although these logics have been considered at various places in the literature, a study of the interpolation properties of these logics is lacking. We use the pruned tableau method to uniformly show that these extended Dunn logics have the interpolation property and explain that the same result cannot be obtained via the Maehara-style method. Finally, we show how the pruned tableau method constructs interpolants for functionally complete extensions of the Dunn logics. (shrink)

Consider the problem which set V of propositional variables suffices for whenever, where, and ⊢c and ⊢i denote derivability in classical and intuitionistic implicational logic, respectively. We give a direct proof that stability for the final propositional variable of the (implicational) formula A is sufficient; as a corollary one obtains Glivenko's theorem. Conversely, using Glivenko's theorem one can give an alternative proof of our result. As an alternative to stability we then consider the Peirce formula. It is an easy consequence (...) of the result above that adding a single instance of the Peirce formula suffices to move from classical to intuitionistic derivability. Finally we consider the question whether one could do the same for minimal logic. Given a classical derivation of a propositional formula not involving ⊥, which instances of the Peirce formula suffice as additional premises to ensure derivability in minimal logic? We define a set of such Peirce formulas, and show that in general an unbounded number of them is necessary. (shrink)

Various connexive FDE-based modal logics are studied. Some of these logics contain a conditional that is both connexive and strict, thereby highlighting that strictness and connexivity of a conditional do not exclude each other. In particular, the connexive modal logics cBK-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^{-}$$\end{document}, cKN4, scBK-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^{-}$$\end{document}, scKN4, cMBL, and scMBL are introduced semantically by means of classes of Kripke models. The logics cBK-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} (...) \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^{-}$$\end{document} and cKN4 are connexive variants of the FDE-based modal logics BK-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^{-}$$\end{document} and KN4 with a weak and a strong implication, respectively. The system cMBL is a connexive variant of the modal bilattice logic MBL. The latter is a modal extension of Arieli and Avron’s logic of logical bilattices and is characterized by a class of Kripke models with a four-valued accessibility relation. In the systems scBK-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^{-}$$\end{document}, scKN4, and scMBL, the conditional is both connexive and strict. Sound and complete tableau calculi for all these logics are presented and used to show that the entailment relations of the systems under consideration are decidable for finite premise set. Moreover, the logics cBK-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {cBK}^-$$\end{document} and cMBL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {cMBL}$$\end{document} are shown to be algebraizable. The algebraizability of cMBL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {cMBL}$$\end{document} is derived from proving cMBL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {cMBL}$$\end{document} to be definitionally equivalent to MBL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {MBL}$$\end{document}. All connexive modal logics studied in this paper are decidable, paraconsistent, and inconsistent but non-trivial logics. (shrink)

Some apparently valid arguments crucially rely on context change. To take a kind of example first discussed by Frege, ‘Tomorrow, it’ll be sunny’ taken on a day seems to entail ‘Today, it’s sunny’ taken on the next day, but the first sentence taken on a day sadly does not seem to entail the second sentence taken on the second next day. Mid-argument context change has not been accounted for by the tradition that has extensively studied the distinctive logical properties of (...) context-dependent languages, for that tradition has focussed on arguments whose premises and conclusions are taken at the same context. I first argue for the desiderability of having a logic that accounts for mid-argument context change and I explain how one can informally understand such context change in a standard framework in which the relation of logical consequence holds among sentences. I then propose a family of simple temporal “intercontextual” logics that adequately model the validity of certain arguments in which the context changes. In particular, such logics validate the apparently valid argument in the Fregean example. The logics lack many traditional structural properties (reflexivity, contraction, commutativity etc.) as a consequence of the logical significance acquired by the sequence structure of premises and conclusions. The logics are however strong enough to capture in the form of logical truths all the valid arguments of both classical logic and Kaplan-style “intracontextual” logic. Finally, I extend the framework by introducing new operations into the object language, such as intercontextual conjunction, disjunction and implication, which, contrary to intracontextual conjunction, disjunction and implication, perfectly match the metalinguistic, intercontextual notions of premise combination, conclusion combination and logical consequence by representing their respective two operands as taken at different contexts. (shrink)

From the point of view of non-classical logics, Heyting's implication is the smallest implication for which the deduction theorem holds. This book studies properties of logical systems having some of the classical connectives and implication in the neighbourhood of Heyt ing's implication. I have not included anything on entailment, al though it belongs to this neighbourhood, mainly because of the appearance of the Anderson-Belnap book on entailment. In the later chapters of this book, I have included material that might be (...) of interest to the intuitionist mathematician. Originally, I intended to include more material in that spirit but I decided against it. There is no coherent body of material to include that builds naturally on the present book. There are some serious results on topological models, second order Beth and Kripke models, theories of types, etc., but it would require further research to be able to present a general theory, possibly using sheaves. That would have postponed pUblication for too long. I would like to dedicate this book to my colleagues, Professors G. Kreisel, M.O. Rabin and D. Scott. I have benefited greatly from Professor Kreisel's criticism and suggestions. Professor Rabin's fun damental results on decidability and undecidability provided the powerful tools used in obtaining the majority of the results reported in this book. Professor Scott's approach to non-classical logics and especially his analysis of the Scott consequence relation makes it possible to present Heyting's logic as a beautiful, integral part of non-classical logics. (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)

The idea of a 'logic of quantum mechanics' or quantum logic was originally suggested by Birkhoff and von Neumann in their pioneering paper [1936]. Since that time there has been much argument about whether, or in what sense, quantum 'logic' can be actually considered a true logic (see, e.g. Bell and Hallett [1982], Dummett [1976], Gardner [1971]) and, if so, how it is to be distinguished from classical logic. In this paper I put forward a simple and natural semantical framework (...) for quantum logic which reveals its difference from classical logic in a strikingly intuitive way, viz. through the fact that quantum logic admits (suitably formulated versions of) the characteristic quantum-mechanical notions of superposition and incompatibility of attributes. That is, precisely the features that distinguish quantum from classical physics also serve, within this framework, to distinguish quantum from classical logic. Some light is shed on the question of whether quantum logic is a genuine logical system by introducing a natural entailment relation for quantum-logical formulas with the implication symbol. The novelty is that, although implication behaves as it should (i.e. the 'deduction theorem' holds), the order of introduction of premises is significant. The fact that a reasonable entailment relation can be formulated for quantum logic supports the view that it is a genuine logical system and not merely an algebraic formalism. (shrink)

The Komori–Kashima problem, that asks whether the implicational intermediate logics axiomatizable by formulas minimal in classical logic are only intuitionistic logic and classical logic, has stood for over a decade. In this paper, we give a counter-example to this problem. Additionally, we also give some open problems derived from this result.

Here we shall employ the term "classical" to denote situations in science in which all propositions satisfy all the laws of classical logic, including that of excluded middle. This means that if x is a proposition of a given field of science, then the following statements will be true in regard to it: "either x or non-x," "either x is true or non-x is true," "x is either true or false." The emphasis here upon the law of excluded middle is (...) associated with the fact that criticism of this law is the basic content of nonclassical criticism of classical logic. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:First Order Relationality and Its Implications:A Response to David ElsteinRoger T. Ames (bio)David Elstein has asked a series of important questions about Human Becomings that provide me with an opportunity to try to bring the argument of the book into clearer focus. Let me begin by thanking David for his always generous and intelligent reflection on not only my new monograph [End Page 181] but also on Henry Rosemont's (...) and my best efforts to expand upon the idea of "role ethics" as a productive way to read Confucian ethics.David asks: Is relationality truly a part of original Confucian thought? Does relationality rule out any notion of essential human nature, and does it necessarily imply or entail role ethics? Is relationality true or merely a useful way of thinking (if these can be distinguished)? Do we know that it's useful?I think the answer to these questions turns on two very different ways of understanding relationality, namely the doctrines of first and second order relationality. The term 'ontology' as "the science of being per se or in itself" gives us a doctrine of external, second order relations. Ontology was introduced into our philosophical vocabulary as a new term for an old way of thinking at the beginning of the seventeenth century by two German philosophers.1 For the classical Greeks, "the science of being per se" (to on he on) was posited as their "first philosophy" with all of its implications for metaphysics, epistemology, logic, ethics, philosophy of religion, and so on. Ontology is that branch of metaphysics that seeks to classify and explain the things that exist, with its underlying assumption that there are unchanging substances or essences internal to things that are available to us to classify them as this and not that. Ontology privileges "being per se" with its categorical language and its "substance" and "attribute" dualism, giving us a grammar of substances as property-bearers and properties that are borne, respectively.Such ontological thinking animates Plato's pursuit of formal, "real" definitions in his quest for certainty (that is, definitions not of words but of what really is), and underlies Aristotle's taxonomical science of knowing "what is what." For these classical Greek philosophers, only what is real and is thus true can be the proper object of knowledge, giving us a logic of the changeless. Corollary to ontology is causal thinking, formal definitions, and, important for David's question, a doctrine of external, second order relationality in which relations conjoin discrete and self-sufficient things, such as human "beings." As the contemporary philosopher Zhao Tingyang 趙汀陽 avers, this kind of substance ontology defining the real things that constitute the content of an orderly and structured cosmosprovides a "dictionary" kind of explanation of the world, seeking to set up an accurate understanding of the limits of all things. In simple terms, it determines "what is what," and all concepts are footnotes to "being" or "is."2In the Book of Changes, we find a vocabulary making explicit cosmological assumptions that stand in stark contrast to this substance ontology and that brings with it a doctrine of first order, constitutive relations. This alternative "first philosophy" has prompted me to create the neologism "zoetology," with the Greek zoe- "life" and -logia "discourse," as my own new term for an old way of thinking that we might translate into modern Chinese as shengshenglun 生生論: "the art of living." The starting point in this zoetological cosmology, then, is that nothing does anything by [End Page 182] itself; association is a fact. Since the very nature of life is associative and transactional, the vocabulary appealed to in defining Confucian cosmology is irreducibly dyadic and collateral: always multiple, never one.And further, it is the nature of life itself that it seeks to optimize the available conditions for its continuing growth, where such growth has a persistent existential and thus intentional aspect. "Life" is the productive correlation between organism and environment that gives rise to correlative, relational, ecological thinking that many of our best sinologists (Marcel Granet, David Keightley, Tang Junyi, K. C. Chang, A. C. Graham, and many others) would ascribe to the earliest semblances of Chinese... (shrink)

It is often assumed that Aristotle, Boethius, Chrysippus, and other ancient logicians advocated a connexive conception of implication according to which no proposition entails, or is entailed by, its own negation. Thus Aristotle claimed that the proposition ‘if B is not great, B itself is great […] is impossible’. Similarly, Boethius maintained that two implications of the type ‘If p then r’ and ‘If p then not-r’ are incompatible. Furthermore, Chrysippus proclaimed a conditional to be ‘sound when the contradictory of (...) its consequent is incompatible with its antecedent’, a view which, in the opinion of S. McCall, entails the aforementioned theses of Aristotle and Boethius. Now a critical examination of the historical sources shows that the ancient logicians most likely meant their theses as applicable only to ‘normal’ conditionals with antecedents which are not self-contradictory. The corresponding restrictions of Aristotle’s and Boethius’ theses to such self-consistent antecedents, however, turn out to be theorems of ordinary modal logic and thus don’t give rise to any non-classical system of genuinely connexive logic,. (shrink)

In this paper, bi-intuitionistic multilattice logic, which is a combination of multilattice logic and the bi-intuitionistic logic also known as Heyting–Brouwer logic, is introduced as a Gentzen-type sequent calculus. A Kripke semantics is developed for this logic, and the completeness theorem with respect to this semantics is proved via theorems for embedding this logic into bi-intuitionistic logic. The logic proposed is an extension of first-degree entailment logic and can be regarded as a bi-intuitionistic variant of the original classical multilattice logic (...) determined by the algebraic structure of multilattices. Similar completeness and embedding results are also shown for another logic called bi-intuitionistic connexive multilattice logic, obtained by replacing the connectives of intuitionistic implication and co-implication with their connexive variants. (shrink)

Solutions to semantic paradoxes often involve restrictions of classical logic for semantic vocabulary. In the paper we investigate the costs of these restrictions in a model case. In particular, we fix two systems of truth capturing the same conception of truth: of the system KF of Feferman formulated in classical logic, and the system PKF of Halbach and Horsten, formulated in basic De Morgan logic. The classical system is known to be much stronger than the nonclassical one. We assess (...) the reasons for this asymmetry by showing that the truth theoretic principles of PKF cannot be blamed: PKF with induction restricted to non-semantic vocabulary coincides in fact with what the restricted version of KF proves true. (shrink)

Connexive logics are based on two ideas: that no statement entails or is entailed by its own negation (this is Aristotle’s thesis) and that no statement entails both something and the negation of this very thing (this is Boethius' thesis). Usually, connexive logics are contra-classical. In this note, I introduce a reading of the connexive theses that makes them compatible with classical logic. According to this reading, the theses in question do not talk about validity alone; rather, they talk in (...) part about (a property related to) the soundness of arguments. (shrink)

The book discusses philosophical and logical problems of quantum physics and its interpretations. Emphasis lies on the compatibility of quantum physics with classical logic and various ontological stances.

Some necessary connection theorists maintain that an analysis of causation requires some kind of sui generis metaphysical modal notion such as physical or nomic necessary. However, among necessary connection theorists there are some who argue that the causal connection is not properly understood as merely “physical” or irreducibly “nomic,” but as one of logical entailment. A cause logically entails its effect. Prominent among these theorists have been idealists such as Brand Blanshard.

In this paper we first develop a logic independent account of relevant implication. We propose a stipulative denition of what it means for a multiset of premises to relevantly L-imply a multiset of conclusions, where L is a Tarskian consequence relation: the premises relevantly imply the conclusions iff there is an abstraction of the pair such that the abstracted premises L-imply the abstracted conclusions and none of the abstracted premises or the abstracted conclusions can be omitted while still maintaining valid (...) L-consequence. Subsequently we apply this denition to the classical logic consequence relation to obtain NTR-consequence, i.e. the relevant CL-consequence relation in our sense, and develop a sequent calculus that is sound and complete with regard to relevant CL-consequence. We present a sound and complete sequent calculus for NTR. In a next step we add rules for an object language relevant implication to the sequent calculus. The object language implication reflects exactly the NTR-consequence relation. One can see the resulting logic NTR-> as a relevant logic in the traditional sense of the word. By means of a translation to the relevant logic R, we show that the presented logic NTR is very close to relevance logics in the Anderson-Belnap-Dunn-Routley-Meyer tradition. However, unlike usual relevant logics, NTR is decidable for the full language, Disjunctive Syllogism and Adjunction are valid, and neither Modus Ponens nor the Cut rule are admissible. (shrink)

The serious formal investigation of n-valued systems of logic for n>2 dates back to Post's 1921 doctoral dissertation. The primary use for such structures, however, has been as model-theoretic devices in the investigation of systems of lower order. Ackermann's short book now comes as a welcome addition to the literature dealing with the formal properties and applications of n-valued systems in their own right. Ackermann begins with a general discussion of implicational calculi in which fundamental ideas of validity, well-formedness, and (...) other basic notions are set forth elegantly and clearly. While assuming the classical implicational calculus as an underlying substructure, Ackermann next motivates a consideration of possible modifications of the formal system in the direction of greater generality by means of the standard Lewis objections to the reading of "⊃" as "implies." This leads to the well known story of strict entailment, introduction of modal operators, and then a four-valued matrix as an underlying semantics for the expanded system. There then follows a good general discussion of the properties of many-valued logics, various nonstandard propositional calculi, and an admirable presentation of the Lukasiewicz-Tarski propositional calculus, accompanied by a number of important metatheorems. Ackermann also includes chapters on alternative multivalued [[sic]] systems and a glance at their applications. One would like to see, however, some discussion of such controversial matters as n-valued quantificational theory and the well-known objections to the entire program of nonstandard logistic theory. There is a good bibliography of important books and articles in the field.—H. P. K. (shrink)

At the onset of quantum mechanics, it was argued that the new theory would entail a rejection of classical logic. The main arguments to support this claim come from the non-commutativity of quantum observables, which allegedly would generate a non-distributive lattice of propositions, and from quantum superpositions, which would entail new rules for quantum disjunctions. While the quantum logic program is not as popular as it once was, a crucial question remains unsettled: what is the relationship between the logical structures (...) of classical and quantum mechanics? In this essay we answer this question by showing that the original arguments promoting quantum logic contain serious flaws, and that quantum theory does satisfy the classical distributivity law once the full meaning of quantum propositions is properly taken into account. Moreover, we show that quantum mechanics can generate a distributive lattice of propositions, which, unlike the one of quantum logic, includes statements about expectation values which are of undoubtable physical interest. Lastly, we show that the lattice of statistical propositions in classical mechanics follows the same structure, yielding an analogue non-commutative sublattice of classical propositions. This fact entails that the purported difference between classical and quantum logic stems from a misconstructed parallel between the two theories. (shrink)

This edited book focuses on non-classical logics and their applications, highlighting the rapid advances and the new perspectives that are emerging in this area. Non-classical logics are logical formalisms that violate or go beyond classical logic laws, and their specific features make them particularly suited to describing and reason about aspects of social interaction. The richness and diversity of non-classical logics mean that this area is a natural catalyst for ideas and insights from many different fields, from information theory to (...) game theory and business science. This volume is the post-proceedings of the 8th International Conference on Logic and Cognition, held at Sun Yat-Sen University Institute of Logic and Cognition in Guangzhou, China in December 2016. The conference series started in 2001, and is organized by the ILC, often in collaboration with various international research groups. This eighth installment was jointly organized by ILC and Alessandra Palmigiano's Applied Logic research group. The conference series aims to foster the development of effective logical tools to study social behavior from a philosophical, cognitive and formal perspective in order to challenge the field of logic in ways that open up new and exciting research directions. Chapter "The Category of Node-and-Choice Forms, with Subcategories for Choice-Sequence Forms and Choice-Set Forms" of this book is available open access under a CC BY 4.0 license at link.springer.com. (shrink)