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

In this paper a formalized logic of propositions, PA1, is presented. It is proven consistent and its relationships to traditional logic, to PM ([15]), to subjunctive (including contrary-to-fact) implication and to the “paradoxes” of material and strict implication are developed. Apart from any intrinsic merit it possesses, its chief significance lies in demonstrating the feasibility of a general logic containing theprinciple of subjunctive contrariety, i.e., the principle that ‘Ifpwere true thenqwould be true’ and ‘Ifpwere true thenqwould be false’ are incompatible.

A version of strong negation is introduced into Categorial Grammar. The resulting syntactic calculi turn out to be systems of connexive logic.

Many of the discussions about conditionals can best be put as follows:can those conditionals that involve an entailment relation be formulatedwithin a formal system? The reasons for the failure of the classical approachto entailment have usually been that they ignore the meaning connectionbetween antecedent and consequent in a valid entailment. One of the firsttheories in the history of logic about meaning connection resulted from thestoic discussions on tightening the relation between the If- and the Then-parts of conditionals, which in this (...) context was called. This theory gave a justification for the validity of what we todayexpress through the formulae ¬ and ¬. Hugh MacColl and, more recently, Storrs McCall searched for a formal system in which the validity ofthese formulae could be expressed. Unfortunately neither of the resulting systems is very satisfactory. In this paper we introduce dialogical games with the help of a new connexive If-Then (), the structural rules of which allow the Proponent to develop winning strategies not only for the above-mentioned connexive theses but also for ¬ and ¬. Further on, we developthe corresponding tableau systems and conclude with some remarks on possibleperspectives and consequences of the dialogical approach to connexivity including the loss of uniform substitution leading to a new concept of logical form. (shrink)

Many of the discussions about conditionals can best be put as follows:can those conditionals that involve an entailment relation be formulatedwithin a formal system? The reasons for the failure of the classical approachto entailment have usually been that they ignore the meaning connectionbetween antecedent and consequent in a valid entailment. One of the firsttheories in the history of logic about meaning connection resulted from thestoic discussions on tightening the relation between the If- and the Then-parts of conditionals, which in this (...) context was called συναρτησις(connection). This theory gave a justification for the validity of what we todayexpress through the formulae ¬(a → ¬ a) and ¬(¬ a → a). Hugh MacColl and, more recently, Storrs McCall (from 1877 to 1906 and from1963 to 1975 respectively) searched for a formal system in which the validity ofthese formulae could be expressed. Unfortunately neither of the resulting systems is very satisfactory. In this paper we introduce dialogical games with the help of a new connexive If-Then (“→”), the structural rules of which allow the Proponent to develop (formal) winning strategies not only for the above-mentioned connexive theses but also for (a → b) → ¬(a → ¬ b) and (a → b) → ¬(¬ a → b). Further on, we developthe corresponding tableau systems and conclude with some remarks on possibleperspectives and consequences of the dialogical approach to connexivity including the loss of uniform substitution leading to a new concept of logical form. (shrink)

Of the various accounts of negation that have been offered by logicians in the history of Western logic, that of negation as cancellation is a very distinctive one, quite different from the explosive accounts of modern "classical" and intuitionist logics, and from the accounts offered in standard relevant and paraconsistent logics. Despite its ancient origin, however, a precise understanding of the notion is still wanting. The first half of this paper offers one. Both conceptually and historically, the account of negation (...) as cancellation is intimately connected with connexivist principles such as ¬( ¬). Despite this, standard connexivist logics incorporate quite different accounts of negation. The second half of the paper shows how the cancellation account of negation of the first part gives rise to a semantics for a simple connexivist logic. (shrink)

Two experiments (N1 = 141, N2 = 40) investigate two versions of Aristotle’s Thesis for the first time. Aristotle’s Thesis is a negated conditional, which consists of one propositional variable with a negation either in the antecedent (version 1) or in the consequent (version 2). This task allows us to infer if people interpret indicative conditionals as material conditionals or as conditional events. In the first experiment I investigate between-participants the two versions of Aristotle’s Thesis crossed with abstract versus concrete (...) task material. The modal response for all four groups is consistent with the conditional event and inconsistentwith the material conditional interpretation. This observation is replicated in the second experiment. Moreover, the second experiment rules out scope ambiguities of the negation of conditionals. Both experiments provide new evidence against thematerial conditional interpretation of conditionals and support the conditional event interpretation. Finally, I discuss implications formodeling indicative conditionals and the relevance of this work for experimental philosophy. (shrink)

In this introduction to the special issue “40 years of FDE”, we offer an overview of the field and put the papers included in the special issue into perspective. More specifically, we first present various semantics and proof systems for FDE, and then survey some expansions of FDE by adding various operators starting with constants. We then turn to unary and binary connectives, which are classified in a systematic manner. First-order FDE is also briefly revisited, and we conclude by listing (...) some open problems for future research. (shrink)

One of the problems we face in many-valued logic is the difficulty of capturing the intuitive meaning of the connectives introduced through truth tables. At the same time, however, some logics have nice ways to capture the intended meaning of connectives easily, such as four-valued logic studied by Belnap and Dunn. Inspired by Dunn’s discovery, we first describe a mechanical procedure, in expansions of Belnap-Dunn logic, to obtain truth conditions in terms of the behavior of the Truth and the False, (...) which gives us intuitive readings of connectives, out of truth tables. Then, we revisit the notion of functional completeness, which is one of the key notions in many-valued logic, in view of Dunn’s idea. More concretely, we introduce a generalized notion of functional completeness which naturally arises in the spirit of Dunn’s idea, and prove some fundamental results corresponding to the classical results proved by Post and Słupecki. (shrink)

A typical theorem of conaexive logics is Aristotle''s Thesis(A), (AA).A cannot be added to classical logic without producing a trivial (Post-inconsistent) logic, so connexive logics typically give up one or more of the classical properties of conjunction, e.g.(A & B)A, and are thereby able to achieve not only nontriviality, but also (negation) consistency. To date, semantical modellings forA have been unintuitive. One task of this paper is to give a more intuitive modelling forA in consistent logics. In addition, while inconsistent (...) but nontrivial theories, and inconsistent nontrivial logics employing prepositional constants (for which the rule of uniform substitution US fails), have both been studied extensively within the paraconsistent programme, inconsistent nontrivial logics (closed under US) do not seem to have been. This paper gives sufficient conditions for a logic containingA to be inconsistent, and then shows that there is a class of inconsistent nontrivial logics all containingA. A second semantical modelling forA in such logics is given. Finally, some informal remarks about the kind of modellingA seems to require are made. (shrink)

Connexive logics aim to capture important logical intuitions, intuitions that can be traced back to antiquity. However, the requirements that are imposed on connexive logic are actually not enough to do justice to these intuitions, as I will argue. I will suggest how these demands should be strengthened.

Only propositional logics are at issue here. Such a logic is contra-classical in a superficial sense if it is not a sublogic of classical logic, and in a deeper sense, if there is no way of translating its connectives, the result of which translation gives a sublogic of classical logic. After some motivating examples, we investigate the incidence of contra-classicality (in the deeper sense) in various logical frameworks. In Sections 3 and 4 we will encounter, originally as an example of (...) what (in Section 2) we call a contra-classical modal logic, an unusual logic boasting a connective (" demi-negation" ) whose double application is equivalent to a single application of the negation connective. Pondering the example points the way to a general characterization of contra-classicality (Theorems 3.3 and 4.6). In an Appendix (Section 5), we look at one alternative to classical logic as the target for such translational assimilation, intuitionistic logic, calling logics which resist the assimilation, in this case, contra- intuitionistic. We will show that one such logic is classical logic itself, thereby strengthening a result of Wojcicki's to the effect that the consequence relation of classical logic cannot be faithfully embedded by any connective-by-connective translation into that of intuitionistic logic. (What the "faithfully" means here is that not only is the translation of anything provable in the 'source' logic.. (shrink)

The problems of the meaning and function of negation are disentangled from ontological issues with which they have been long entangled. The question of the function of negation is the crucial issue separating relevant and paraconsistent logics from classical theories. The function is illuminated by considering the inferential role of contradictions, contradiction being parasitic on negation. Three basic modelings emerge: a cancellation model, which leads towards connexivism, an explosion model, appropriate to classical and intuitionistic theories, and a constraint model, which (...) includes relevant theories. These three modelings have been seriously confused in the modern literature: untangling them helps motivate the main themes advanced concerning traditional negation and natural negation. Firstly, the dominant traditional view, except around scholastic times when the explosion view was in ascendency, has been the cancellation view, so that the mainstream negation of much of traditional logic is distinctively nonclassical. Secondly, the primary negation determinable of natural negation is ·relevant negation. In order to picture relevant negation the traditional idea of negation as otherthanness is progressive) refined, to nonexclusive restricted otherthanness. Several pictures result, a reversal picture, a debate model, a record cabinet (or files of the universe) model which help explain relevant negation. Two appendices are attached, one on negation in Hegel and the Marxist tradition, the other on Wittgenstein's treatment of negation and contradiction. (shrink)