This paper discusses the relation between the minimal positive relevant logic B and intersection and union type theories. There is a marvelous coincidence between these very differently motivated research areas. First, we show a perfect fit between the Intersection Type Discipline ITD and the tweaking BT of B, which saves implication and conjunction but drops disjunction . The filter models of the -calculus (and its intimate partner Combinatory Logic CL) of the first author and her coauthors then become theory models (...) of these calculi. (The logician's "theory" is the algebraist's "filter".) The coincidence extends to a dual interpretation of key particles—the subtype translates to provable , type intersection to conjunction , function space to implication, and whole domain to the (trivially added but trivial) truth T. This satisfying ointment contains a fly. For it is right, proper, and to be expected that type union should correspond to the logical disjunction of B. But the simulation of functional application by a fusion (or modus ponens product) operation on theories leaves the key Bubbling lemma of work on ITD unprovable for the -prime theories now appropriate for the modeling. The focus of the present paper lies in an appeal to Harrop theories which are (a) prime and (b) closed under fusion. A version of the Bubbling lemma is then proved for Harrop theories, which accordingly furnish a model of and CL. (shrink)

Kripke-completeness of every classical modal logic with Sahlqvist formulas is one of the basic general results on completeness of classical modal logics. This paper shows a Sahlqvist theorem for modal logic over the relevant logic Bin terms of Routley- Meyer semantics. It is shown that usual Sahlqvist theorem for classical modal logics can be obtained as a special case of our theorem.

Relevant logics are a family of non-classical logics characterized by the behavior of their implication connectives. Unlike some other non-classical logics, such as intuitionistic logic, there are multiple philosophical views motivating relevant logics. Further, different views seem to motivate different logics. In this article, we survey five major views motivating the adoption of relevant logics: Use Criterion, sufficiency, meaning containment, theory construction, and truthmaking. We highlight the philosophical differences as well as the different logics they support. We end with some (...) questions for future research. (shrink)

Relevant logics infamously have the property that they only validate a conditional when some propositional variable is shared between its antecedent and consequent. This property has been strengthened in a variety of ways over the last half-century. Two of the more famous of these strengthenings are the strong variable sharing property and the depth relevance property. In this paper I demonstrate that an appropriate class of relevant logics has a property that might naturally be characterized as the supremum of these (...) two properties. I also show how to use this fact to demonstrate that these logics seem to be constructive in previously unknown ways. (shrink)

Priest argued in Fusion and Confusion (Priest in Topoi 34(1):55–61, 2015a) for a new concept of logical consequence over the relevant logic B, one where premises my be “confused” together. This paper develops Priest’s idea. Whereas Priest uses a substructural proof calculus, this paper provides a Hilbert proof calculus for it. Using this it is shown that Priest’s consequence relation is weaker than the standard Hilbert consequence relation for B, but strictly stronger than Anderson and Belnap’s original relevant notion of (...) consequence. Unlike the latter, however, Priest’s consequence relation does not satisfy a variant of the variable sharing property. This paper shows that how it can be modified so as to do so. Priest’s consequence relation turns out to be surprisingly weak in some respects. The prospects of strengthening it is raised and discussed in a broader philosophical context. (shrink)

This paper explores early Australasian philosophy in some detail. Two approaches have dominated Western philosophy in Australia: idealism and materialism. Idealism was prevalent between the 1880s and the 1930s, but dissipated thereafter. Idealism in Australia often reflected Kantian themes, but it also reflected the revival of interest in Hegel through the work of ‘absolute idealists’ such as T. H. Green, F. H. Bradley, and Henry Jones. A number of the early New Zealand philosophers were also educated in the idealist tradition (...) and were influential in their communities, but produced relatively little. In Australia, materialism gained prominence through the work of John Anderson, who arrived in Australia in 1927, and continues to be influential. John Anderson had been a student of Henry Jones, who might therefore be said to have influenced both main strands of Australian philosophical thought. (shrink)

This paper briefly overviews some of the results and research directions. In the area of substructural logics from the last couple of decades. Substructural logics are understood here to include relevance logics, linear logic, variants of Lambek calculi and some other logics that are motivated by the idea of omitting some structural rules or making other structural changes in LK, the original sequent calculus for classical logic.

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)

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)

In some logics, anything whatsoever follows from a contradiction; call these logics explosive. Paraconsistent logics are logics that are not explosive. Paraconsistent logics have a long and fruitful history, and no doubt a long and fruitful future. To give some sense of the situation, I’ll spend Section 1 exploring exactly what it takes for a logic to be paraconsistent. It will emerge that there is considerable open texture to the idea. In Section 2, I’ll give some examples of techniques for (...) developing paraconsistent logics. In Section 3, I’ll discuss what seem to me to be some promising applications of certain paraconsistent logics. In fact, however, I don’t think there’s all that much to the concept ‘paraconsistent’ itself; the collection of paraconsistent logics is far too heterogenous to be very productively dealt with under a single label. Perhaps that will emerge as we go. (shrink)

The aim of this paper is to provide a Routley-Meyer semantics for Ackermann’s logics of “strenge Implikation” Π ′ and Π ′′ . Besides the Disjunctive Syllogism, this semantics validates the rules Necessitation and Assertion. Strong completeness theorems for Π ′ and Π ′′ are proved. A brief discussion on Π ′ , Π ′′ and paraconsistency is included.

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)

This paper defines a category of bounded distributive lattice-ordered grupoids with a left-residual operation that corresponds to a weak system in the family of relevant logics. Algebras corresponding to stronger systems are obtained by adding further postulates. A duality theoey piggy-backed on the Priestley duality theory for distributive lattices is developed for these algebras. The duality theory is then applied in providing characterizations of the dual spaces corresponding to stronger relevant logics.

Consider the set of inferences that are acceptable to use in all our theory building endeavors. Call this set of inferences the universal theory building toolkit, or just ’the toolkit’ for short. It is clear that the toolkit is tightly connected to logic in a variety of ways. Beall, for example, has argued that logic just is the toolkit. This paper avoids making a stand on that issue and instead investigates reasons for thinking that, logic or not, the toolkit is (...) substructural. It is presented as a dialogue for the simple reason that it summarizes a range of dialogues on this subject that the author has had with various folks over the past few years. The method I use to investigate the toolkit is inspired in both philosophical and technical details by Alasdair Urquhart’s work on semantics for relevance logics from the early 1970s. (shrink)

This paper defines a Sahlqvist fragment for relevant logic and establishes that each class of frames in the Routley-Meyer semantics which is definable by a Sahlqvist formula is also elementary, that is, it coincides with the class of structures satisfying a given first order property calculable by a Sahlqvist-van Benthem algorithm. Furthermore, we show that some classes of Routley-Meyer frames definable by a relevant formula are not elementary.

Łukasiewicz three-valued logic Ł3 is often understood as the set of all 3-valued valid formulas according to Łukasiewicz’s 3-valued matrices. Following Wojcicki, in addition, we shall consider two alternative interpretations of Ł3: “well-determined” Ł3a and “truth-preserving” Ł3b defined by two different consequence relations on the 3-valued matrices. The aim of this paper is to provide dual equivalent two-valued under-determined and over-determined interpretations for Ł3, Ł3a and Ł3b. The logic Ł3 is axiomatized as an extension of Routley and Meyer’s basic positive (...) logic following Brady’s strategy for axiomatizing many-valued logics by employing two-valued under-determined or over-determined interpretations. Finally, it is proved that “well determined” Łukasiewicz logics are paraconsistent. (shrink)

We present an algebraic-style of semantics, which we call a content semantics, for quantified relevant logics based on the weak system BBQ. We show soundness and completeness for all quantificational logics extending BBQ and also treat reduced modelling for all systems containing BB d Q. The key idea of content semantics is that true entailments AB are represented under interpretation I as content containments, i.e. I(A)I(B) (or, the content of A contains that of B). This is opposed to the truth-functional (...) way which represents true entailments as truth-preservations over all set-ups (or worlds), i.e. (VaK) (if I(A, a) = T then I(B, a)= T). (shrink)

We define dual and symmetric combinatory calculi (inequational and equational ones), and prove their consistency. Then, we introduce algebraic and set theoretical relational and operational - semantics, and prove soundness and completeness. We analyze the relationship between these logics, and argue that inequational dual logics are the best suited to model computation.

In this article, I consider the positive logic of Boolean groups (i.e. Abelian groups where every non-identity element has order 2), where these are taken as frames for an operational semantics à la Urquhart. I call this logic BG. It is shown that the logic over the smallest nontrivial Boolean group, taken as a frame, is identical to the positive fragment of a quasi-relevance logic that was developed by Robles and Méndez (an extension of this result where negation is included (...) is also discussed). It is proved that BG satisfies the variable sharing property and is Halldén complete, while failing to satisfy the disjunction property. Sound and complete subscripted tableaux are presented for BG. An axiomatization (in the positive language extended with fusion) is presented, which is sound with respect to BG and, with respect to a related ternary relational semantics, complete; the problem of identifying a complete axiomatization for BG itself is left open. Connections between BG and the quasi-relevance logic KR are also discussed. (shrink)

As is known, a logic S is paraconsistent if the rule ECQ (E contradictione quodlibet) is not a rule of S. Not less well known is the fact that Lewis’ modal logics are not paraconsistent. Actually, Lewis vindicates the validity of ECQ in a famous proof currently known as the “Lewis’ proof” or “Lewis’ argument.” This proof essentially leans on the Disjunctive Syllogism as a rule of inference. The aim of this paper is to define a series of paraconsistent logics (...) included in S4 where the Disjunctive Syllogism is valid only as a rule of proof. (shrink)

We prove that algebras of binary relations whose similarity type includes intersection, union, and one of the residuals of relation composition form a nonfinitely axiomatizable quasivariety and that the equational theory is not finitely based. We apply this result to the problem of the completeness of the positive fragment of relevance logic with respect to binary relations.

The results of this paper extend some of the intimate relations that are known to obtain between combinatory logic and certain substructural logics to establish a general characterization theorem that applies to a very broad family of such logics. In particular, I demonstrate that, for every combinator X, if LX is the logic that results by adding the set of types assigned to X (in an appropriate type assignment system, TAS) as axioms to the basic positive relevant logic B∘T, then (...) LX is sound and complete with respect to the class of frames in the Routley-Meyer relational semantics for relevant and substructural logics that meet a first-order condition that corresponds in a very direct way to the structure of the combinator X itself. (shrink)

We show that there are infinitely many pairwise non-equivalent formulae in one propositional variable p in the pure implication fragment of the logic T of “ticket entailment” proposed by Anderson and Belnap. This answers a question posed by R. K. Meyer.

In relevance logic it has become commonplace to associate with each logic both an algebraic counterpart and a relational counterpart. The former comes from the Lindenbaum construction; the latter, called a model structure, is designed for semantical purposes. Knowing that they are related through the logic, we may enquire after the algebraic relationship between the algebra and the model structure. This paper offers a complete solution for the relevance logic R. Namely, R-algebras and R-model structures can be obtained from each (...) other, and represented in terms of each other, by application of power constructions. (shrink)

Routley-Meyer type ternary relational semantics are defined for relevant logics including Routley and Meyer’s basic logic B plus the reductio rule and the disjunctive syllogism. Standard relevant logics such as E and R (plus γ ) and Ackermann’s logics of ‘strenge Implikation’ Π and Π ′ are among the logics considered.

The aim of this paper is to investigate a Curry-Howard interpretation of the intersection and union type inference system for Combinatory Logic. Types are interpreted as formulas of a Hilbert-style logic L, which turns out to be an extension of the intuitionistic logic with respect to provable disjunctive formulas (because of new equivalence relations on formulas), while the implicational-conjunctive fragment of L is still a fragment of intuitionistic logic. Moreover, typable terms are translated in a typed version, so that --typed (...) combinatory logic terms are proved to completely codify the associated logical proofs. (shrink)

A full separation theorem for the derivable rules of intuitionistic linear logic without bounds, 0 and exponentials is proved. Several structural consequences of this theorem for subreducts of (commutative) residuated lattices are obtained. The theorem is then extended to the logic LR+ and its proof is extended to obtain the finite embeddability property for the class of square increasing residuated lattices.

Łukasiewicz three-valued logic Ł3 is often understood as the set of all 3-valued valid formulas according to Łukasiewicz’s 3-valued matrices. Following Wojcicki, in addition, we shall consider two alternative interpretations of Ł3: “well-determined” Ł3a and “truth-preserving” Ł3b defined by two different consequence relations on the 3-valued matrices. The aim of this paper is to provide (by using Dunn semantics) dual equivalent two-valued under-determined and over-determined interpretations for Ł3, Ł3a and Ł3b. The logic Ł3 is axiomatized as an extension of Routley (...) and Meyer’s basic positive logic following Brady’s strategy for axiomatizing many-valued logics by employing two-valued under-determined or over-determined interpretations. Finally, it is proved that “well determined” Łukasiewicz logics are paraconsistent. (shrink)