We collect together some misgivings about the logic R of relevant inplication, and then give support to a weak entailment logic $DJ^{d}$ . The misgivings centre on some recent negative results concerning R, the conceptual vacuousness of relevant implication, and the treatment of classical logic. We then rectify this situation by introducing an entailment logic based on meaning containment, rather than meaning connection, which has a better relationship with classical logic. Soundness and completeness results are proved for (...) $DJ^{d}$ with respect to a content semantics, which embraces the concept of meaning containment. (shrink)

This paper spells out a dynamic proof format for the pure logic of relevant implication. (A proof is dynamic if a formula derived at some stage need not be derived at a later stage.) The paper illustrates three interesting points. (i) A set of properties that characterizes an inference relation on the (very natural) dynamic proof interpretation, need not characterize the same inference relation (or even any inference relation) on the usual settheoretical interpretation. (ii) A proof format may (...) display an internal dynamics (defeasible conclusions) in the absence of an external dynamics (non-monotonicity). (iii) A monotonic logic may have a non-monotonic characterization. (shrink)

In this paper we first develop a logic independent account of relevant implication. We propose a stipulative denition of what it means for a multiset of premises to relevantly L-imply a multiset of conclusions, where L is a Tarskian consequence relation: the premises relevantly imply the conclusions iff there is an abstraction of the pair such that the abstracted premises L-imply the abstracted conclusions and none of the abstracted premises or the abstracted conclusions can be omitted while still (...) maintaining valid L-consequence. Subsequently we apply this denition to the classical logic consequence relation to obtain NTR-consequence, i.e. the relevant CL-consequence relation in our sense, and develop a sequent calculus that is sound and complete with regard to relevant CL-consequence. We present a sound and complete sequent calculus for NTR. In a next step we add rules for an object language relevant implication to the sequent calculus. The object language implication reflects exactly the NTR-consequence relation. One can see the resulting logic NTR-> as a relevant logic in the traditional sense of the word. By means of a translation to the relevant logic R, we show that the presented logic NTR is very close to relevance logics in the Anderson-Belnap-Dunn-Routley-Meyer tradition. However, unlike usual relevant logics, NTR is decidable for the full language, Disjunctive Syllogism and Adjunction are valid, and neither Modus Ponens nor the Cut rule are admissible. (shrink)

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

R. K. Meyer once gave precise form to the question of whether relevant implication can be defined in any modal system, and his answer was `no'. In the present paper, we extend S4, first with propositional quantifiers, to the system S4π+; and then with definite propositional descriptions, to the system S4π+ lp . We show that relevant implication can in some sense be defined in the modal system S4π+ lp , although it cannot be defined in (...) S4π+. (shrink)

In Poggiolesi [. Grounding principles for implication. Synthese, 1–28], a definition of the notion of grounding in the background of a relevant framework has been introduced; this...

This paper shows that model structures for R+, the system of positive relevant implication, can be constructed from ordered geometries. This extends earlier results building such model structures from projective spaces. A final section shows how such models can be extended to models for the full system R.

Sentential constants have been part of the R environment since Church [1]. They have had diverse uses in explicating relevant ideas and in sim- plifying them technically. Of most interest have been the Ackermann pair of constants t; f, functioning conceptually as a least truth, and as a greatest , under the ordering of propositions under true impli- cation. Also interesting have been the Church constants F; T, functioning similarly as least greatest propositions.

Relevant logics provide an alternative to classical implication that is capable of accounting for the relationship between the antecedent and the consequence of a valid implication. Relevant implication is usually explained in terms of information required to assess a proposition. By doing so, relevant implication introduces a number of cognitively relevant aspects in the de nition of logical operators. In this paper, we aim to take a closer look at the cognitive feature (...) of relevant implication. For this purpose, we develop a cognitively-oriented interpretation of the semantics of relevant logics. In particular, we provide an interpretation of Routley-Meyer semantics in terms of conceptual spaces and we show that it meets the constraints of the algebraic semantics of relevant logic. (shrink)

Most of the logics of grounding that have so far been proposed contain grounding axioms, or grounding rules, for the connectives of conjunction, disjunction and negation, but little attention has been dedicated to the implication connective. The present paper aims at repairing this situation by proposing adequate grounding principles for relevant implication. Because of the interaction between negation and implication, new grounding principles concerning negation will also arise.

It is shown that the implicational fragment of Anderson and Belnap's R, i.e. Church's weak implicational calculus, is not uniquely characterized by MP (modus ponens), US (uniform substitution), and WDT (Church's weak deduction theorem). It is also shown that no unique logic is characterized by these, but that the addition of further rules results in the implicational fragment of R. A similar result for E is mentioned.

This note extends earlier results on geometrical interpretations of the logic KR to prove some additional results, including a simple undecidability proof for the four-variable fragment of KR.

In this paper, we aim to devise a logic that can deal with both the paradoxes that motivate dialetheism and the paradoxes related to the irrelevance of material implication. We propose the semantics and the sequent calculus of a relevant logic inspired by difference-making accounts of causation and arguably true to Graham Priest’s Logic of Paradox \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {LP}$$\end{document}: a relevant logic that validates those and only those \documentclass[12pt]{minimal} \usepackage{amsmath} (...) \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {LP}$$\end{document}-consequences that are not irrelevant. The new logic’s relevant implication is then added to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {LP}$$\end{document} to obtain a logic with the logical vocabulary required to cope with the mentioned paradoxes. (shrink)

A transcription of Richard Routley's manuscript, "Semantic Analysis of Entailment and Relevant Implication: I".

We introduce several restricted versions of the structural rules in the implicational fragment of Gentzen's sequent calculus LJ. For example, we permit the applications of a structural rule only if its principal formula is an implication. We investigate cut-eliminability and theorem-equivalence among various combinations of them. The results include new cut-elimination theorems for the implicational fragments of the following logics: relevant logic E, strict implication S4, and their neighbors (e.g., E-W and S4-W); BCI-logic, BCK-logic, relevant logic (...) R, and the intuitionistic logic. (shrink)

We show that provability in the implicational fragment of relevance logic is complete for doubly exponential time, using reductions to and from coverability in branching vector addition systems.

We describe a method for obtaining classical logic from intuitionistic logic which does not depend on any proof system, and show that by applying it to the most important implicational relevance logics we get relevance logics with nice semantical and proof-theoretical properties. Semantically all these logics are sound and strongly complete relative to classes of structures in which all elements except one are designated. Proof-theoretically they correspond to cut-free hypersequential Gentzen-type calculi. Another major property of all these logic is that (...) the classical implication can faithfully be translated into them. (shrink)

Connexive expansions of relevant logics tend to prove every negated implication formula. In this paper I discuss why they tend to satisfy this unsavoury property, and discuss avenues by which it can be avoided, providing logics which stand as proofs of concept that these avenues can be made to work.

The goal of this paper is to analyse Implicational Relevance Logic from the point of view of refutability. We also correct an inaccuracy in our paper “The RM paraconsistent refutation system”.

In this paper Grice's requirements for assertability are imposed on the disjunction of Classical Logic. Defining material implication in terms of negation and disjunction supplemented by assertability conditions, results in the disappearance of the most important paradoxes of material implication. The resulting consequence relation displays a very strong resemblance to Schurz's conclusion-relevant consequence relation.

A star-free relational semantics for relevant logic is presented together with a sound and complete sequent proof theory. It is an extension of the dualist approach to negation regarded as modality, according to which de Morgan negation in relevant logic is better understood as the confusion of two negative modalities. The present work shows a way to define them in terms of implication and a new connective, co-implication, which is modeled by respective ternary relations. The defined (...) negations are confused by a special constraint on ternary relation, called the generalized star postulate, which implies definability of the Routley star in the frame. The resultant logic is shown to be equivalent to the well-known relevant logic R. Thus it can be seen as a reconstruction of R in the dualist framework. (shrink)

This paper overviews the role of tradition in the structure, processes and behaviour of Chinese work organ izations. The traditional value frameworks combining Confucian, Taoist and Buddhist principles and prac tices had long been the surrogate of a well-defined legal structure in China. Social interaction based on the strong guanxi bonds dominates the managerial culture and such vehicles of social capital development are prerequisites of any substantive partnership building with China. The analysis presented in this overview attempts to explore the (...) reasons for relative underdevelopment of managerial autonomy and innovation, and the predominance of collective face and networking. It is suggested that there are a number of strengths in the Chinese traditions that may be helpful in the emerging managerial transitions, while pointing out areas where breaking with the past may be necessary. This paper signals the importance of more research in Asian management to alleviate the ethnocentric basis of Western-oriented mainstream management. (shrink)

It is known that propositional relevant logics can be conservatively extended by the addition of a Heyting (intuitionistic) implication connective. We show that this same conservativity holds for a range of first-order relevant logics with strong identity axioms, using an adaptation of Fine’s stratified model theory. For systems without identity, the question of conservatively adding Heyting implication is thereby reduced to the question of conservatively adding the axioms for identity. Some results in this direction are also (...) obtained. The conservative presence of Heyting implication allows the development of an alternative model theory for quantified relevant logics. (shrink)

It is widely accepted that there is a distinction to be made between the explicit content and the implicit import of an utterance. There is much less agreement about the precise nature of this distinction, how it is to be drawn, and whether any such two-way distinction can do justice to the levels and kinds of meaning involved in utterance interpretation. Grice’s distinction between what is said by an utterance and what is implicated is probably the best known instantiation of (...) the explicit/implicit distinction. His distinction, along with many of its post-Gricean heirs, is closely entwined with another distinction: that between semantics and pragmatics. Indeed, on some construals they are seen as essentially one and the same; “what is said” is equated with the truthconditional content of the utterance which in turn is equated with (context-relative) sentence meaning, leaving implicatures (conventional and conversational) as the sole domain of pragmatics. (shrink)

Tableau formulations are given for the relevance logics E (Entailment), R (Relevant implication) and RM (Mingle). Proofs of equivalence to modus-ponens-based formulations are vialeft-handed Gentzen sequenzen-kalküle. The tableau formulations depend on a detailed analysis of the structure of tableau rules, leading to certain global requirements. Relevance is caught by the requirement that each node must be used; modality is caught by the requirement that only certain rules can cross a barrier. Open problems are discussed.

In this paper we present a logic that determines when implications in a classical logic context express a relevant connection between antecedent and consequent. In contrast with logics in the relevance logic literature, we leave classical negation intact—in the sense that the law of non-contradiction can be used to obtain relevant implications, as long as there is a connection between antecedent and consequent. On the other hand, we give up the requirement that our theory of relevance should be (...) able to define a new standard of deduction. We present and argue for a list of requirements such a logical theory of classical relevance needs to meet and go on to formulate a system that respects each of these requirements. The presented system is a Tarski logic that extends the relevance logic R with a new relevant implication which allows for Disjunctive Syllogism and similar rules. This is achieved by interpreting the logical symbols in the antecedents in a stronger way than the logical symbols in consequents. A proof theory and an algebraic semantics are formulated and interesting metatheorems are proven. Finally we give a philosophical motivation for our non-standard relevant implication and the asymmetric interpretation of antecedents and consequents. (shrink)

A Relevance-Theoretic Classification of Jokes Relevance Theory pictures communication as an inferential activity that adjusts, in parallel, the explicit content of utterances, the implicated premises and conclusions that can be derived, and the right amount of contextual information needed to obtain them. When applied to jokes, a relevance-theoretic classification may be proposed depending on whether the humorist plays with the audience's inferential activity aimed at an explicit interpretation, with the audience's inference devoted to deriving implications or with their access to (...) the right amount and quality of contextual information needed to obtain relevant interpretations. In this paper three types of jokes are proposed which focus on these aspects. A fourth type is also added, but this time referred to broad contextual assumptions on social or cultural values of society that are targeted by humorists. (shrink)

In their book, Relevance, Sperber and Wilson make an important contribution towards constructing a credible theory of this unforthcoming notion. All is not clear sailing, however. If it is accepted as a condition on the adequacy of any account of relevance that it not be derivable either that nothing is relevant to anything or that everything is relevant to everything, it can be shown that Sperber and Wilson come close to violating the condition.

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 has two aims. First, it sets out an interpretation of the relevant logic E of relevant entailment based on the theory of situated inference. Second, it uses this interpretation, together with Anderson and Belnap’s natural deduc- tion system for E, to generalise E to a range of other systems of strict relevant implication. Routley–Meyer ternary relation semantics for these systems are produced and completeness theorems are proven. -/- .

In this paper, we investigate neighbourhood semantics for modal extensions of relevant logics. In particular, we combine the neighbourhood interpretation of the relevant implication (and related connectives) with a neighbourhood interpretation of modal operators. We prove completeness for a range of systems and investigate the relations between neighbourhood models and relational models, setting out a range of augmentation conditions for the various relations and operations.

Once upon a time, modal logic was castigated because it ‘had no semantics.’ Kripke, Hintikka, Kanger, and others changed all that. In a similar way, when Relevant Logic was introduced by Anderson and Belnap, it too was castigated for ‘having no semantics.’ The present overview marks a culmination of that effort. The semantic approach described here brings together a number of hitherto disparate efforts to set out formal systems for logics of relevant implication and entailment. It also (...) makes clear (despite some of our hopes and utterances) that the One True Logic does not exist. This is as true for relevant logics as Kripke et al., showed it to be for modal logics. In both cases, subtle (and not so subtle) variations on semantical postulates produce different logics in the same family. The question of which semantical postulates are correct makes no sense without further context, i.e., the questioner needs to answer the question: Correct for what? The question that does remain is: What motivates the relevant family of logics? And this is the question that is the main job for this chapter to investigate. (shrink)

This paper reformulates and decides a certain conjecture in Dunn's 'Relevant Predication 1: The Formal Theory' (Journal of Philosophical Logic 16, 347-381, 1987). This conjecture of Dunn's relates his object-language characterisation of a property's being relevant in a variable x to certain grammatical characterisations of relevance, analogous to some given by Helman, in 'Relevant Implication and Relevant Functions' (to appear in Entailment: The Logic of Relevance and Necessity, vol. 2, by Alan Ross Anderson, Nuel Belnap, (...) and J. Michael Dunn et al.) In the course of the investigation this paper also investigates Kit Fine's semantics for quantified relevance logics, which appears in his appropriately titled 'Semantics for Quantified Relevance Logics'. (shrink)