Online research in philosophy

This paper presents a neighborhood semantics for logics of entailment. It begins with a minimal system Min that expresses the most fundamental assumptions about the entailment relation, and continues by examining various extensions that reflect further assumptions that might be made about entailment. This leads first to the logic B that is the basic relevant logic, and then to more powerful systems. All of these logics are proved to be sound and strongly complete. With B the neighborhood semantics meets the Routley–Meyer relational semantics for relevant logic; these connections are examined. The minimal and basic entailment logics are shown to have the finite model property, and hence to be decidable.

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.

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).

In part I, we presented an algebraic-style of semantics, which we called “content semantics,” for quantified relevant logics based on the weak systemBBQ. We showed soundness and completeness with respect to theunreduced semantics ofBBQ. In part II, we proceed to show soundness and completeness for extensions ofBBQ with respect to this type of semantics. We introducereduced semantics which requires additional postulates for primeness and saturation. We then conclude by showing soundness and completeness forBB d Q and its extentions with respect to this reduced semantics.

A method is presented for constructing natural deduction-style systems for propositional relevant logics. The method consists in first translating formulas of relevant logics into ternary relations, and then defining deduction rules for a corresponding logic of ternary relations. Proof systems of that form are given for various relevant logics. A class of algebras of ternary relations is introduced that provides a relation-algebraic semantics for relevant logics.

This paper sets out two semantics for the relevant logic R based on Dunn's four-valued semantics for first-degree entailments. Unlike Routley's semantics for weak relevant logics, they do not use two ternary accessibility relations. Unlike Restall's semantics, they capture all of R. But there is a catch. Both of the present semantics are neighbourhood semantics, that is, they include sets of propositions in the specification of their frames.

Once the Kripke semantics for normal modal logics were introduced, a whole family of modal logics other than the Lewis systems S1 to S5 were discovered. These logics were obtained by changing the semantics in natural ways. The same can be said of the Kripke-style semantics for relevant logics: a whole range of logics other than the standard systems R, E and T were unearthed once a semantics was given (cf. Priest and Sylvan [6], Restall [7], and Routley et al. [8]). In a similar way, weakening the structural rules of the Gentzen formulation of classical logic gives rise to other ‘substructural’ logics such as linear logic (as in Girard [4]). This process of ‘strategic weakening’ is becoming popular today, with the discovery of applications of these logics to areas such as linguistics and the theory of computation (cf. van Benthem [1]). Until now no-one has (to my knowledge) examined what the process of weakening does to the Kripke-style semantics of intuitionistic logic. This paper remedies the deficiency, introducing the family of subintuitionistic logics. These systems have some appealing features. Unlike other substructural logics such as linear logic (which lack distribution of extensional disjunction over conjunction) they have a very natural Kripke-style worlds semantics. Also, the difficulties with regard to modelling quantification in these systems may be able to shed some light on the difficulties in naturally modelling quantification in relevant logics, as it must be admitted that the semantics currently available for quantified relevant logics are rather baroque (cf. Fine [3]). But most importantly, delving in the undergrowth of logics such as intuitionistic logic gives us a ‘feel’ for how such systems are put together, and what job is being done by each aspect of the modelling conditions in..

This paper continues the work of Priest and Sylvan inSimplified Semantics for Basic Relevant Logics, a paper on the simplified semantics of relevant logics, such asB + andB. We show that the simplified semantics can also be used for a large number of extensions of the positive base logicB +, and then add the dualising* operator to model negation. This semantics is then used to give conservative extension results for Boolean negation.

We provide a semantics for relevant logics with addition of Aristotle's Thesis, ∼(A→∼A) and also Boethius,(A→B)→∼(A→∼B). We adopt the Routley-Meyer affixing style of semantics but include in the model structures a regulatory structure for all interpretations of formulae, with a view to obtaining a lessad hoc semantics than those previously given for such logics. Soundness and completeness are proved, and in the completeness proof, a new corollary to the Priming Lemma is introduced (c.f.Relevant Logics and their Rivals I, Ridgeview, 1982).

This paper gives an outline of three different approaches to the four-valued semantics for relevant logics (and other non-classical logics in their vicinity). The first approach borrows from the Australian Plan semantics, which uses a unary operator for the evaluation of negation. This approach can model anything that the two-valued account can, but at the cost of relying on insights from the Australian Plan. The second approach is natural, well motivated, independent of the Australian Plan, and it provides a semantics for the contraction-free relevant logicC (orRW). Unfortunately, its approach seems to model little else. The third approach seems to capture a wide range of formal systems, but at the time of writing, lacks a completeness proof.