Many logics in the relevant family can be given a proof theory in the style of Belnap's display logic. However, as originally given, the proof theory is essentially more expressive than the logics they seek to model. In this paper, we consider a modified proof theory which more closely models relevant logics. In addition, we use this proof theory to show decidability for a large range of substructural logics.

We prove the Finite Model Property (FMP) for Distributive Full Lambek Calculus ( DFL ) whose algebraic semantics is the class of distributive residuated lattices ( DRL ). The problem was left open in [8, 5]. We use the method of nuclei and quasi–embedding in the style of [10, 1].

This paper presents a sequent calculus for the positive relevant logic with necessity and a proof that it admits the elimination of cut.

In Ilić and Boričić, the right-handed cut-free sequent calculus $GRW$ for the contraction-less relevant logic $RW$ is defined. In this paper, we show that the enlargement of the system $GRW$ with the structural rule of intensional contraction presents the sequent system for the principal relevant logic $R$ but the rule of cut cannot be eliminated in $GRW+$.

In our paper [3], a sequent system for the contraction‐less positive relevant logic with co‐tenability,, is considered. Its sequent system with the rule of cut, which does not involve the truth constant t, is presented, and the proof that it admits the elimination of cut is given. However, in the proof of the cut‐elimination theorem some forms of proofs, which may cause difficulties for the cut‐elimination argument, are not considered. The purpose of this paper is to present them and to (...) re‐prove that admits the elimination of cut. (shrink)

This paper is a study of four subscripted Gentzen systems G u R +, G u T +, G u RW + and G u TW +. [16] shows that the first three are equivalent to the semilattice relevant logics u R +, u T + and u RW + and conjectures that G u TW + is, equivalent to u TW +. Here we prove Cut Theorems for these systems, and then show that modus ponens is admissible — which (...) is not so trivial as one normally expects. Finally, we give decision procedures for the contractionless systems, G u TW + and G u RW +. (shrink)

This paper presents completeness and conservative extension results for the boolean extensions of the relevant logic T of Ticket Entailment, and for the contractionless relevant logics TW and RW. Some surprising results are shown for adding the sentential constant t to these boolean relevant logics; specifically, the boolean extensions with t are conservative of the boolean extensions without t, but not of the original logics with t. The special treatment required for the semantic normality of T is also shown along (...) the way. (shrink)

Substructural logics are logics obtained from a sequent formulation of intuitionistic or classical logic by rejecting some structural rules. The substructural logics considered here are linear logic, relevant logic and BCK logic. It is proved that first-order variants of these logics with an intuitionistic negation can be embedded by modal translations into S4-type extensions of these logics with a classical, involutive, negation. Related embeddings via translations like the double-negation translation are also considered. Embeddings into analogues of S4 are obtained with (...) the help of cut elimination for sequent formulations of our substructural logics and their modal extensions. These results are proved for systems with equality too. (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 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 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)