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)

Based on the relevant logic R, the system R# was proposed as a relevant Peano arithmetic. R# has many nice properties: the most conspicuous theorems of classical Peano arithmetic PA are readily provable therein; it is readily and effectively shown to be nontrivial; it incorporates both intuitionist and classical proof methods. But it is shown here that R# is properly weaker than PA, in the sense that there is a strictly positive theorem QRF of PA which is unprovable in R#. (...) The reason is interesting: if PA is slightly weakened to a subtheory P+, it admits the complex ring C as a model; thus QRF is chosen to be a theorem of PA but false in C. Inasmuch as all strictly positive theorems of R# are already theorems of P+, this nonconservativity result shows that QRF is also a nontheorem of R#. As a consequence, Ackermann's rule γ is inadmissible in R#. Accordingly, an extension of R# which retains its good features is desired. The system R##, got by adding an omega-rule, is such an extension. Central question: is there an effectively axiomatizable system intermediate between R# and R##, which does formalize arithmetic on relevant principles, but also admits γ in a natural way? (shrink)

A major question for the relevant logics has been, “Under what conditions is Ackermann's ruleγ from -A ∨B andA to inferB, admissible for one of these logics?” For a large number of logics and theories, the question has led to an affirmative answer to theγ problem itself, so that such an answer has almost come to be expected for relevant logics worth taking seriously. We exhibit here, however, another large and interesting class of logics-roughly, the Boolean extensions of theW — (...) free relevant logics (and, precisely, the well-behaved subsystems of the 4-valued logicBN4) — for which γ fails. (shrink)

Philosophers of modern logic have cherished no project more dearly than that of extensional reduction. Despite occasional protests that this project was ill-conceived from the start, or that it fails to account for important areas of experience and thought, the extensionalist mills have been grinding away anyhow. Their grinding has brought with it a number of important technical successes, replete with philosophical claims that light has finally been shed on areas hitherto buried in incomprehensible darkness.

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)

In this paper, we shall confine ourselves to the study of sentential constants in the system R of relevant implication.In dealing with the behaviour of the sentential constants in R, we shall think of R itself as presented in three stages, depending on the level of truth-functional involvement.

The Logic R4 is obtained by adding the axiom □ → to the modal relevant logic NR. We produce a model theory for this logic and show completeness. We also show that there is a natural embedding of a Kripke model for S4 in each R4 model structure.

Modus ponens provides the central theme. There are laws, of the form A→C. A logic L collects such laws. Any datum A provides input to the laws of L. The central ternary relation R relates theories L,T and U, where U consists of all of the outputs C got by applying modus ponens to major premises from L and minor premises from T. Underlying this relation is a modus ponens product operation on theories L and T, whence RLTU iff LTU. (...) These ideas have been expressed, especially with Routley, as worlds semantics for relevant and other substructural logics.Worlds are best demythologized as theories, subject to truth-functional and other constraints. The chief constraint is that theories are taken as closed under logical entailment, which clearly begs the question if we are using the semantics to determine which theory L is Logic itself. Instead we draw the modal logicians’ conclusion—there are many substructural logics, each with its appropriate ternary relational postulates.Each logic L gives rise to a Calculus of L-theories, on which particular candidate logical axioms have the combinatorial properties expected from the well-known Curry–Howard isomorphism . We apply their bubbling lemma, updating the Fools Model of Combinatory Logic at the pure → level for the system BT. We make fusion an explicit connective, proving a combinator correspondence theorem. Having taken relevant → as a left residual for , we explore its right residual mate →r. Finally we concentrate on and prove a finite model property for the classical minimal relevant logic CB, a conservative extension of the minimal positive relevant logic B+. (shrink)

The Logic R4 is obtained by adding the axiom □(A v B) → (◇A v □B) to the modal relevant logic NR. We produce a model theory for this logic and show completeness. We also show that there is a natural embedding of a Kripke model for S4 in each R4 model structure.

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)