One of the most dominant approaches to semantics for relevant (and many paraconsistent) logics is the Routley-Meyer semantics involving a ternary relation on points. To some (many?), this ternary relation has seemed like a technical trick devoid of an intuitively appealing philosophical story that connects it up with conditionality in general. In this paper, we respond to this worry by providing three different philosophical accounts of the ternary relation that correspond to three conceptions of conditionality. We close by briefly discussing (...) a general conception of conditionality that may unify the three given conceptions. (shrink)

This comprehensive text shows how various notions of logic can be viewed as notions of universal algebra providing more advanced concepts for those who have an introductory knowledge of algebraic logic, as well as those wishing to delve into more theoretical aspects.

This paper explores allowing truth value assignments to be undetermined or "partial" and overdetermined or "inconsistent", thus returning to an investigation of the four-valued semantics that I initiated in the sixties. I examine some natural consequence relations and show how they are related to existing logics, including ukasiewicz's three-valued logic, Kleene's three-valued logic, Anderson and Belnap's relevant entailments, Priest's "Logic of Paradox", and the first-degree fragment of the Dunn-McCall system "R-mingle". None of these systems have nested implications, and I investigate (...) twelve natural extensions containing nested implications, all of which can be viewed as coming from natural variations on Kripke's semantics for intuitionistic logic. Many of these logics exist antecedently in the literature, in particular Nelson 's "constructible falsity". (shrink)

Nonclassical logics have played an increasing role in recent years in disciplines ranging from mathematics and computer science to linguistics and philosophy. _Generalized Galois Logics_ develops a uniform framework of relational semantics to mediate between logical calculi and their semantics through algebra. This volume addresses normal modal logics such as K and S5, and substructural logics, including relevance logics, linear logic, and Lambek calculi. The authors also treat less-familiar and new logical systems with equal deftness.

We give a set of postulates for the minimal normal modal logicK + without negation or any kind of implication. The connectives are simply , , , . The postulates (and theorems) are all deducibility statements . The only postulates that might not be obvious are.

We study an application of gaggle theory to unary negative modal operators. First we treat negation as impossibility and get a minimal logic system Ki that has a perp semantics. Dunn 's kite of different negations can be dealt with in the extensions of this basic logic Ki. Next we treat negation as “unnecessity” and use a characteristic semantics for different negations in a kite which is dual to Dunn 's original one. Ku is the minimal logic that has a (...) characteristic semantics. We also show that Shramko's falsification logic FL can be incorporated into some extension of this basic logic Ku. Finally, we unite the two basic logics Ki and Ku together to get a negative modal logic K-, which is dual to the positive modal logic K+ in [7]. Shramko has suggested an extension of Dunn 's kite and also a dual version in [12]. He also suggested combining them into a “united” kite. We give a united semantics for this united kite of negations. (shrink)

We present a Kripke model for Girard's Linear Logic (without exponentials) in a conservative fashion where the logical functors beyond the basic lattice operations may be added one by one without recourse to such things as negation. You can either have some logical functors or not as you choose. Commutatively and associatively are isolated in such a way that the base Kripke model is a model for noncommutative, nonassociative Linear Logic. We also extend the logic by adding a coimplication operator, (...) similar to Curry's subtraction operator, which is resituated with Linear Logic's contensor product. And we can add contraction to get nondistributive Relevance Logic. The model rests heavily on Urquhart's representation of nondistributive lattices and also on Dunn's Gaggle Theory. Indeed, the paper may be viewed as an investigation into nondistributive Gaggle Theory restricted to binary operations. The valuations on the Kripke model are three valued: true, false, and indifferent. The lattice representation theorem of Urquhart has the nice feature of yielding Priestley's representation theorem for distributive lattices if the original lattice happens to be distributive. Hence the representation is consistent with Stone's representation of distributive and Boolean lattices, and our semantics is consistent with the Lemmon-Scott representation of modal algebras and the Routley-Meyer semantics for Relevance Logic. (shrink)

In this paper we introduce canonical extensions of partially ordered sets and monotone maps and a corresponding discrete duality. We then use these to give a uniform treatment of completeness of relational semantics for various substructural logics with implication as the residual(s) of fusion.

The implicational fragment of the logic of relevant implication, $R_{\to}$ is one of the oldest relevance logics and in 1959 was shown by Kripke to be decidable. The proof is based on $LR_{\to}$ , a Gentzen-style calculus. In this paper, we add the truth constant $\mathbf{t}$ to $LR_{\to}$ , but more importantly we show how to reshape the sequent calculus as a consecution calculus containing a binary structural connective, in which permutation is replaced by two structural rules that involve $\mathbf{t}$ (...) . This calculus, $LT_\to^{\text{\textcircled{$\mathbf{t}$}}}$ , extends the consecution calculus $LT_{\to}^{\mathbf{t}}$ formalizing the implicational fragment of ticket entailment . We introduce two other new calculi as alternative formulations of $R_{\to}^{\mathbf{t}}$ . For each new calculus, we prove the cut theorem as well as the equivalence to the original Hilbert-style axiomatization of $R_{\to}^{\mathbf{t}}$ . These results serve as a basis for our positive solution to the long open problem of the decidability of $T_{\to}$ , which we present in another paper. (shrink)

Both I and Belnap, motivated the "Belnap-Dunn 4-valued Logic" by talk of the reasoner being simply "told true" (T) and simply "told false" (F), which leaves the options of being neither "told true" nor "told false" (N), and being both "told true" and "told false" (B). Belnap motivated these notions by consideration of unstructured databases that allow for negative information as well as positive information (even when they conflict). We now experience this on a daily basis with the Web. But (...) the 4-valued logic is deductive in nature, and its matrix is discrete: there are just four values. In this paper I investigate embedding the 4-valued logic into a context of probability. Jøsang's Subjective Logic introduced uncertainty to allow for degrees of belief, disbelief, and uncertainty. We extend this so as to allow for two kinds of uncertainty— that in which the reasoner has too little information (ignorance) and that in which the reasoner has too much information (conflicted). Jøsang's "Opinion Triangle" becomes an "Opinion Tetrahedron" and the 4-values can be seen as its vertices. I make/prove various observations concerning the relation of non-classical "probability" to non-classical logic. (shrink)

The implicational fragment of the logic of relevant implication, $R_\to$ is known to be decidable. We show that the implicational fragment of the logic of ticket entailment, $T_\to$ is decidable. Our proof is based on the consecution calculus that we introduced specifically to solve this 50-year old open problem. We reduce the decidability problem of $T_\to$ to the decidability problem of $R_\to$. The decidability of $T_\to$ is equivalent to the decidability of the inhabitation problem of implicational types by combinators over (...) the base $\{\textsf{B},\textsf{B}',\textsf{I},\textsf{W}\}$. (shrink)

Prominent philosophers have argued that contradictions contain either too much or too little information to be useful. We dispute this with what we call the “Paradox of the Two Firefighters.” Suppose you are awakened in your hotel room by a fire alarm. You open the door. You see three possible ways out: left, right, straight ahead. You see two firefighters. One says there is exactly one safe route and it is to your left. The other says there is exactly one (...) safe route and it is to your right. While the two firemen are giving you contradictory information, they are also both giving you the perhaps useful information that there is a safe way out and it is not straight ahead. We give two analyses. The first uses the “Opinion Tetrahedron,” introduced by Dunn as a generalization of Audun Jøsang’s “Opinion Triangle.” The Opinion Tetrahedron in effect embeds the values of the “Belnap-Dunn 4-valued Logic” into a context of subjective probability generalized to allow for degrees of belief, disbelief, and two kinds of uncertainty—that in which the reasoner has too little information and that in which the reasoner has too much information. Jøsang had only a single value for uncertainty. We also present an alternative solution, again based on subjective probability but of a more standard type. This solution builds upon “linear opinion pooling.” Kiefer had already developed apparatus for assessing risk using expert opinion, and this influences the second solution. Finally, we discuss how these solutions might apply to “Big Data” and the World Wide Web. (shrink)

Given classical (2 valued) structures and and a homomorphism h of onto , it is shown how to construct a (non-degenerate) 3-valued counterpart of . Classical sentences that are true in are non-false in . Applications to number theory and type theory (with axiom of infinity) produce finite 3-valued models in which all classically true sentences of these theories are non-false. Connections to relevant logic give absolute consistency proofs for versions of these theories formulated in relevant logic (the proof for (...) number theory was obtained earlier by R. K. Meyer and suggested the present abstract development). (shrink)

Four-valued semantics proved useful in many contexts from relevance logics to reasoning about computers. We extend this approach further. A sequent calculus is defined with logical connectives conjunction and disjunction that do not distribute over each other. We give a sound and complete semantics for this system and formulate the same logic as a tableaux system. Intensional conjunction and its residuals can be added to the sequent calculus straightforwardly. We extend a simplified version of the earlier semantics for this system (...) and prove soundness and completeness. Then, with some modifications to this semantics, we arrive at a mathematically elegant yet powerful semantics that we call generalized Kripke semantics. (shrink)

Symmetric generalized Galois logics (i.e., symmetric gGl s) are distributive gGl s that include weak distributivity laws between some operations such as fusion and fission. Motivations for considering distribution between such operations include the provability of cut for binary consequence relations, abstract algebraic considerations and modeling linguistic phenomena in categorial grammars. We represent symmetric gGl s by models on topological relational structures. On the other hand, topological relational structures are realized by structures of symmetric gGl s. We generalize the weak (...) distributivity laws between fusion and fission to interactions of certain monotone operations within distributive super gGl s. We are able to prove appropriate generalizations of the previously obtained theorems—including a functorial duality result connecting classes of gGl s and classes of structures for them. (shrink)

In this paper two different formulations of Robinson's arithmetic based on relevant logic are examined. The formulation based on the natural numbers (including zero) is shown to collapse into classical Robinson's arithmetic, whereas the one based on the positive integers (excluding zero) is shown not to similarly collapse. Relations of these two formulations to R. K. Meyer's system R# of relevant Peano arithmetic are examined, and some remarks are made about the role of constant functions (e.g., multiplication by zero) in (...) relevant arithmetic. (shrink)

Relevance logics are known to be sound and complete for relational semantics with a ternary accessibility relation. This paper investigates the problem of adequacy with respect to special kinds of dynamic semantics (i.e., proper relation algebras and relevant families of relations). We prove several soundness results here. We also prove the completeness of a certain positive fragment of R as well as of the first-degree fragment of relevance logics. These results show that some core ideas are shared between relevance logics (...) and relation algebras. Some details of certain incompleteness results, however, pinpoint where relevance logics and relation algebras diverge. To carry out these semantic investigations, we define a new tableaux formalization and new sequent calculi (with the single cut rule admissible) for various relevance logics. (shrink)

The validity of an entailment has nothing to do with whether or not the components are true, false, necessary, or impossible; it has to do solely with whether or not there is a necessary connection between antecedent and consequent. Hence it is a mistake (we feel) to try to build a sieve which will “strain out” entailments from the set of material or strict “implications” present in some system of truth-functions, or of truth-functions with modality. Anderson and Belnap (1962, p. (...) 47). (shrink)

This paper explores the development of mathematics on a quantum logical base when mathematical postulates are taken as necessary truths. First it is shown that first-order Peano arithmetic formulated with quantum logic has the same theorems as classical first-order Peano arithmetic. Distribution for first-order arithmetical formulas is a theorem not of quantum logic but rather of arithmetic. Second, it is shown that distribution fails for second-order Peano arithmetic without extensionality. Third, it is shown that distribution holds for second-order Peano arithmetic (...) (second-order quantum logic) with extensionality. Some remarks about extensions to quantum set theory are made. (shrink)

In spite of a powerful tradition, more than two thousand years old, that in a valid argument the premises must be relevant to the conclusion, twentieth-century logicians neglected the concept of relevance until the publication of Volume I of this monumental work. Since that time relevance logic has achieved an important place in the field of philosophy: Volume II of Entailment brings to a conclusion a powerful and authoritative presentation of the subject by most of the top people working in (...) the area. Originally the aim of Volume II was simply to cover certain topics not treated in the first volume--quantification, for example--or to extend the coverage of certain topics, such as semantics. However, because of the technical progress that has occurred since the publication of the first volume, Volume II now includes other material. The book contains the work of Alasdair Urquhart, who has shown that the principal sentential systems of relevance logic are undecidable, and of Kit Fine, who has demonstrated that, although the first-order systems are incomplete with respect to the conjectured constant domain semantics, they are still complete with respect to a semantics based on "arbitrary objects." Also presented is important work by the other contributing authors, who are Daniel Cohen, Steven Giambrone, Dorothy L. Grover, Anil Gupta, Glen Helman, Errol P. Martin, Michael A. McRobbie, and Stuart Shapiro. Robert G. Wolf's bibliography of 3000 items is a valuable addition to the volume. Originally published in 1992. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905. (shrink)