Some Concerns Regarding Ternary-relation Semantics and Truth-theoretic Semantics in General

This paper deals with a collection of concerns that, over a period of time, led the author away from the Routley–Meyer semantics, and towards proof- theoretic approaches to relevant logics, and indeed to the weak relevant logic MC of meaning containment

Some False Laws of Logic

This paper argues that some widely used laws of implication are false, and arguments based upon them invalid. These laws are Exportation, Commutation, (as well as various restricted forms of these), Exported Syllogism and Disjunctive Syllogism. All these laws are false for the same reason – that they license the suppression or replacement in some position of some class of propositions which cannot legitimately be suppressed or replaced. These laws fail to preserve the property of sufficiency of premiss set for conclusion. They are false, and can be seen to be false, independently of their respon- sibility for the paradoxes. Hence the main ‘independent’ argument for the paradoxes – that they follow from an allegedly immaculate set of laws – is undermined. Counterexamples to all these laws are produced

Non-Boolean classical relevant logics I

Under embargo until: 2020-12-13Relevant logics have traditionally been viewed as paraconsistent. This paper shows that this view of relevant logics is wrong. It does so by showing forth a logic which extends classical logic, yet satisfies the Entailment Theorem as well as the variable sharing property. In addition it has the same S4-type modal feature as the original relevant logic E as well as the same enthymematical deduction theorem. The variable sharing property was only ever regarded as a necessary property for a logic to have in order for it to not validate the so-called paradoxes of implication. The Entailment Theorem on the other hand was regarded as both necessary and sufficient. This paper shows that the latter theorem also holds for classical logic, and so cannot be regarded as a sufficient property for blocking the paradoxes. The concept of suppression is taken up, but shown to be properly weaker than that of variable sharing.acceptedVersio

In Support of Valerie Plumwood

This paper offers general support for what Valerie Plumwood’s paper is trying to achieve by supporting the rejection of each of her four “false laws of logic”: exportation, illegitimate replacement, commutation (aka. permutation) and disjunctive syllogism. We start by considering her general characterizations of entailment, beginning with her stated definition of entailment as the converse of deducibility. However, this applies to a wide range of relevant logics and so is not able to be used as a criterion for deciding what laws to include in a logic. In this context, we examine the two key differences between deduction from premises to conclusion and entailment from antecedent to consequent. We also consider her use of sufficiency as a general characterizing feature. We then discuss Plumwood’s syntactic criteria used to reject the first three of her false laws of logic and add the Relevance Condition in this context. We next consider semantic characterizing criteria for a logic. After making a case against using truth, we introduce Brady’s logic MC of meaning containment. We then examine the content semantics for MC and use it to reject all of Plumwood’s false laws of logic together with some others. We follow with the related Depth Relevance Condition, which is a syntactic cri- terion satisfied by MC. This clearly rejects the first three of these laws and many others, but not the fourth law. We conclude by giving our overall support for her general enterprise

Propositional logic extended with a pedagogically useful relevant implication

First and foremost, this paper concerns the combination of classical propositional logic with a relevant implication. The proposed combination is simple and transparent from a proof theoretic point of view and at the same time extremely useful for relating formal logic to natural language sentences. A specific system will be presented and studied, also from a semantic point of view. The last sections of the paper contain more general considerations on combining classical propositional logic with a relevant logic that has all classical theorems as theorems

Relevance and Verification

A. J. Ayer’s empiricist criterion of meaning was supposed to have sorted all statements into nonsense on the one hand, and tautologies or genuinely factual statements on the other. Unfortunately for Ayer, it follows from classical logic that his criterion is trivial—it classifies all statements as either tautologies or genuinely factual, but none as nonsense. However, in this paper, I argue that Ayer’s criterion of meaning can be defended from classical proofs of its triviality by the adoption of a relevant logic—an idea which is motivated because, according to Ayer, the genuinely factual statements are those which observation is relevant to

Solving Practical Reasoning Poblems with Extended Disjunctive Logic Programming

We present a definition of stable generated models for extended generalized logic programs (EGLP) which a) subsumes the definition of the answer set semantics for extended normal logic programs [GL91]; and b) does not refer to negation-as-failure by allowing for arbitrary quantifier free formulas in the body and in the head of as rule (i.e. does not depend on the presence of any specific connective, nor any specific syntax of rules). We show how to solve classical ATP problems in the framework of extended disjunctive logic programming (EDLP) where neither Contraposition nor the Law of the Excluded Middle are admitted principles of inference. Besides being able to solve classical ATP problems in a monotonic reasoning mode, EDLP can as well treat commonsense reasoning problems by employing its intrinsic nonmonotonic inference capabilities based on stable generated models. EDLP thus proves itself as a general-purpose AI reasoning system

Recent Work in Relevant Logic

This paper surveys important work done in relevant logic in the past 10 years