Das Konzept der Negation ist der zentrale Operator bei der Unterscheidung zwischen historischem Wandel und natürlicher Evolution, welche grundlegend für das moderne Denken ist. Die Krise dieser Abgrenzung ist somit auch eine »Krise der Negation« (AlainBadiou). Der vorliegende Text untersucht die Krise, indem er zuerst Hegels Konzept der »bestimmten Negation« und deren Auswirkungen auf das moderne Verständnis von Revolution beleuchtet und erörtert im Anschluss zwei mögliche Alternativen, wie Negation noch verstanden werden kann: als abstrakte Negation (...) (Luhmann) und als endlose Negation (Agamben). The concept of negation is the central operator in distinguishing between historical change and natural evolution, which is constitutive of modern thinking. The crisis of this distinction is therefore the »crisis of negation « (Alain Badiou). The text examines this crisis by first considering Hegel’s concept of »determinate negation« and its impact on the modern understanding of revolution and then discusses two possible alternative understandings of negation: abstract negation (Luhmann) and infinite negation (Agamben). (shrink)

This book is the first in the field of paraconsistency to offer a comprehensive overview of the subject, including connections to other logics and applications in information processing, linguistics, reasoning and argumentation, and philosophy of science. It is recommended reading for anyone interested in the question of reasoning and argumentation in the presence of contradictions, in semantics, in the paradoxes of set theory and in the puzzling properties of negation in logic programming. Paraconsistent logic comprises a major (...) logical theory and offers the broadest possible perspective on the debate of negation in logic and philosophy. It is a powerful tool for reasoning under contradictoriness as it investigates logic systems in which contradictory information does not lead to arbitrary conclusions. Reasoning under contradictions constitutes one of most important and creative achievements in contemporary logic, with deep roots in philosophical questions involving negation and consistency This book offers an invaluable introduction to a topic of central importance in logic and philosophy. It discusses the history of paraconsistent logic; language, negation, contradiction, consistency and inconsistency; logics of formal inconsistency and the main paraconsistent propositional systems; many-valued companions, possible-translations semantics and non-deterministic semantics; paraconsistent modal logics; first-order paraconsistent logics; applications to information processing, databases and quantum computation; and applications to deontic paradoxes, connections to Eastern thought and to dialogical reasoning. (shrink)

I try to explain the difference between three kinds of negation: external negation, negation of the predicate and privation. Further I use polygons of opposition as heuristic devices to show that a logic which contains all three mentioned kinds of negation must be a fragment of a Łukasiewicz-four-valued predicate logic. I show, further, that, this analysis can be elaborated so as to comprise additional kinds of privation. This would increase the truth-values in question and (...) bring fragments of (more generally speaking) Łukasiewicz-n-valued predicate logics into the scene. (shrink)

Many relevant logics can be conservatively extended by Boolean negation. Mares showed, however, that E is a notable exception. Mares’ proof is by and large a rather involved model-theoretic one. This paper presents a much easier proof-theoretic proof which not only covers E but also generalizes so as to also cover relevant logics with a primitive modal operator added. It is shown that from even very weak relevant logics augmented by a weak K-ish modal operator, and up to the (...) strong relevant logic R with a S5 modal operator, all fail to be conservatively extended by Boolean negation. The proof, therefore, also covers Meyer and Mares’ proof that NR—R with a primitive S4-modality added—also fails to be conservatively extended by Boolean negation. (shrink)

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)

It is argued that the "inner" negation $\mathord{\sim}$ familiar from 3-valued logic can be interpreted as a form of "conditional" negation: $\mathord{\sim}$ is read '$A$ is false if it has a truth value'. It is argued that this reading squares well with a particular 3-valued interpretation of a conditional that in the literature has been seen as a serious candidate for capturing the truth conditions of the natural language indicative conditional (e.g., "If Jim went to the party (...) he had a good time"). It is shown that the logic induced by the semantics shares many familiar properties with classical negation, but is orthogonal to both intuitionistic and classical negation: it differs from both in validating the inference from $A \rightarrow \nega B$ to $\nega(A\rightarrow B)$ to. (shrink)

We investigate the notion of classical negation from a non-classical perspective. In particular, one aim is to determine what classical negation amounts to in a paracomplete and paraconsistent four-valued setting. We first give a general semantic characterization of classical negation and then consider an axiomatic expansion BD+ of four-valued Belnap–Dunn logic by classical negation. We show the expansion complete and maximal. Finally, we compare BD+ to some related systems found in the literature, specifically a four-valued (...) modal logic of Béziau and the logic of classical implication and a paraconsistent de Morgan negation of Zaitsev. (shrink)

No detailed description available for "Negation".

We present and defend the Australian Plan semantics for negation. This is a comprehensive account, suitable for a variety of different logics. It is based on two ideas. The first is that negation is an exclusion-expressing device: we utter negations to express incompatibilities. The second is that, because incompatibility is modal, negation is a modal operator as well. It can, then, be modelled as a quantifier over points in frames, restricted by accessibility relations representing compatibilities and incompatibilities (...) between such points. We defuse a number of objections to this Plan, raised by supporters of the American Plan for negation, in which negation is handled via a many-valued semantics. We show that the Australian Plan has substantial advantages over the American Plan. (shrink)

Here are considered the conditions under which the method of diagrams is liable to include non-classical logics, among which the spatial representation of non-bivalent negation. This will be done with two intended purposes, namely: a review of the main concepts involved in the definition of logical negation; an explanation of the epistemological obstacles against the introduction of non-classical negations within diagrammatic logic.

Review of the book "Paraconsistent Logic: Consistency, Contradiction, and Negation by Water Carnielli and Marcelo Coniglio.

Does there exist any equivalence between the notions of inconsistency and consequence in paraconsistent logics as is present in the classical two valued logic? This is the key issue of this paper. Starting with a language where negation ( ${\neg}$ ) is the only connective, two sets of axioms for consequence and inconsistency of paraconsistent logics are presented. During this study two points have come out. The first one is that the notion of inconsistency of paraconsistent logics turns (...) out to be a formula-dependent notion and the second one is that the characterization (i.e. equivalence) appears to be pertinent to a class of paraconsistent logics which have double negation property. (shrink)

. A paraconsistent logic is a logical system that attempts to deal with contradictions in a discriminating way. In an earlier paper [Notre Dame J. Form. Log. 49, 401–424], we developed the systems of weakening of intuitionistic negation logic, called and, in the spirit of da Costa's approach by preserving, differently from da Costa, the fundamental properties of negation: antitonicity, inversion and additivity for distributive lattices. Taking into account these results, we make some observations on the (...) modified systems of and, and their paraconsistent properties. (shrink)

This chapter contains sections titled: Negation and Nonexistence Designation and Existence Logical Truth, Modality, and Ontology.

In this paper, we shall consider the so-called cancellation view of negation and the inferential role of contradictions. We will discuss some of the problematic aspects of negation as cancellation, such as its original presentation by Richard and Valery Routley and its role in motivating connexive logic. Furthermore, we will show that the idea of inferential ineffectiveness of contradictions can be conceptually separated from the cancellation model of negation by developing a system we call qLPm, a (...) combination of Graham Priest’s minimally inconsistent Logic of Paradox with q-entailment as introduced by Grzegorz Malinowski. (shrink)

Negation, denial and falsity lie at the heart of debates about logic. We set out the classical account of the relationship between negation and denial, owing to Frege and Geach. We then challenge this on the basis that it does not permit an adequate account of falsity. A dialetheic alternative is minuted and criticised before a novel rejectivist account is proposed according to which falsity is the aim of the speech‐act of denial, whilst negation embeds deniability (...) into assertoric contexts. (shrink)

Many relevant logics are conservatively extended by Boolean negation. Not all, however. This paper shows an acute form of non-conservativeness, namely that the Boolean-free fragment of the Boolean extension of a relevant logic need not always satisfy the variable-sharing property. In fact, it is shown that such an extension can in fact yield classical logic. For a vast range of relevant logic, however, it is shown that the variable-sharing property, restricted to the Boolean-free fragment, still holds (...) for the Boolean extended logic. (shrink)

This paper is a reaction to the following remark by grzegorczyk: "the compound sentences are not a product of experiment. they arise from reasoning. this concerns also negations; we see that the lemon is yellow, we do not see that it is not blue." generally, in science the truth is ascertained as indirectly as falsehood. an example: a litmus-paper is used to verify the sentence "the solution is acid." this approach gives rise to a (very intuitionistic indeed) conservative extension of (...) the heyting logic satisfying natural duality laws. (shrink)

This paper examines the relationships between the many-valued logics G~ and Gn~ of Esteva, Godo, Hajek, and Navara, i.e., Godel logic G enriched with Łukasiewicz negation, and neighbors of intuitionistic logic. The popular fragments of Rauszer's Heyting-Brouwer logic HB admit many-valued extensions similar to G which may likewise be enriched with Łukasiewicz negation; the fuzzy extensions of these logics, including HB, are equivalent to G ~, as are their n-valued extensions equivalent to Gn~ for any (...) n ≥ 2. These enriched systems extend Wansing's logic I4C4, showing that Łukasiewicz negation is a species of Nelson's negation of constructible falsity and yielding a Kripke-style semantics for G~ and Gn~ to complement the many-valued semantics. (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)

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 two-part series of papers is to show that constructive logic with strong negation N is definitionally equivalent to a certain axiomatic extension NFL ew of the substructural logic FL ew . In this paper, it is shown that the equivalent variety semantics of N (namely, the variety of Nelson algebras) and the equivalent variety semantics of NFL ew (namely, a certain variety of FL ew -algebras) are term equivalent. This answers a longstanding question (...) of Nelson [30]. Extensive use is made of the automated theorem-prover Prover9 in order to establish the result. The main result of this paper is exploited in Part II of this series [40] to show that the deductive systems N and NFL ew are definitionally equivalent, and hence that constructive logic with strong negation is a substructural logic over FL ew. (shrink)

This paper uses the strengthened liar paradox as a springboard to illuminate two more general topics: i) the negation operator and the speech act of denial among speakers of English and ii) some ways the potential for acceptable language change is constrained by linguistic meaning. The general and special problems interact in reciprocally illuminating ways. The ultimate objective of the paper is, however, less to solve certain problems than to create others, by illustrating how the issues that form the (...) topic of this paper are more intricate than previously realised, and that they are related in delicate and somewhat surprising ways. (shrink)

In general, there is only one fuzzy logic in which the standard interpretation of the strong conjunction is a strict triangular norm, namely, the product logic. We study several equations which are satisfied by some strict t-norms and their dual t-conorms. Adding an involutive negation, these equations allow us to generate countably many logics based on strict t-norms which are different from the product logic.

Infinity and negation are in various relations and interdependencies one to another. The analysis of negation and infinity aims to better understanding them. Semantical, syntactical, and pragmatic issues will be considered.

Intuitionistic propositional logic with Galois negations ( $\mathsf {IGN}$ ) is introduced. Heyting algebras with Galois negations are obtained from Heyting algebras by adding the Galois pair $(\lnot,{\sim })$ and dual Galois pair $(\dot{\lnot },\dot{\sim })$ of negations. Discrete duality between GN-frames and algebras as well as the relational semantics for $\mathsf {IGN}$ are developed. A Hilbert-style axiomatic system $\mathsf {HN}$ is given for $\mathsf {IGN}$, and Galois negation logics are defined as extensions of $\mathsf {IGN}$. We give (...) the bi-tense logic $\mathsf {S4N}_t$ which is obtained from the minimal tense extension of the modal logic $\mathsf {S4}$ by adding tense operators. We give a new extended Gödel translation $\tau$ and prove that $\mathsf {IGN}$ is embedded into $\mathsf {S4N}_t$ by $\tau$. Moreover, every Kripke-complete Galois negation logic _L_ is embedded into its tense companion $\tau (L)$. (shrink)

The goal of this two-part series of papers is to show that constructive logic with strong negation N is definitionally equivalent to a certain axiomatic extension NFL ew of the substructural logic FL ew. The main result of Part I of this series [41] shows that the equivalent variety semantics of N and the equivalent variety semantics of NFL ew are term equivalent. In this paper, the term equivalence result of Part I [41] is lifted to the (...) setting of deductive systems to establish the definitional equivalence of the logics N and NFL ew. It follows from the definitional equivalence of these systems that constructive logic with strong negation is a substructural logic. (shrink)

A difficulty is exposed in Allan Gibbard's solution to the embedding/Frege-Geach problem, namely that the difference between refusing to accept a normative judgement and accepting its negation is ignored. This is shown to undermine the whole solution.

In this paper, we axiomatize the negatable consequences in dependence and independence logic by extending the systems of natural deduction of the logics given in [22] and [11]. We prove a characterization theorem for negatable formulas in independence logic and negatable sentences in dependence logic, and identify an interesting class of formulas that are negatable in independence logic. Dependence and independence atoms, first-order formulas belong to this class. We also demonstrate our extended system of independence (...) class='Hi'>logic by giving explicit derivations for Armstrong's Axioms and the Geiger-Paz-Pearl axioms of dependence and independence atoms. (shrink)

Minimal Negation is defined within the basic positive relevance logic in the relational ternary semantics: B+. Thus, by defining a number of subminimal negations in the B+ context, principles of weak negation are shown to be isolable. Complete ternary semantics are offered for minimal negation in B+. Certain forms of reductio are conjectured to be undefinable (in ternary frames) without extending the positive logic. Complete semantics for such kinds of reductio in a properly extended positive (...) logic are offered. (shrink)

We present the logic K/2 which is a logic with classical implication and only the left part of classical negation.We show that it is possible to define a classical negation into K/2 and that the classical proposition logic K can be translated into this apparently weaker logic.We use concepts from model-theory in order to characterized rigorously this translation and to understand this paradox. Finally we point out that K/2 appears, following Haack's distinction, both as (...) a deviation and an extension of K. (shrink)

The negation constitutes one of the main troubles for attempts to naturalise the semantics of the logical vocabulary, as shown by the problems related to the interpretation of disjunction in the treatment of error (Fodor) or to the definition of contraries in the analysis of reidentification abilities (Millikan). There seems to be no way out between “no (naturalized) negation, no grip of logic on the world” and “no (truth-functional) negation, no logic”. Unexpected help may come (...) from the cognitive phenomenology of negation. For three reasons: • Firstly, because it allows a distinction to be made between semantic analysis, identification of the possession conditions and psychology of the acquisition of the notion of negation, a distinction whose absence produces many misunderstandings between those who support a naturalization of semantics and those who oppose it. • Then because it places negation at the level of the contrast between beliefs, a terrain that is hostile to some naturalizers. • Finally, because it makes it possible to define a peculiar type of liberalised naturalization of semantics and, consequently, to present a hypothesis for the naturalization of cognitive phenomenology. (shrink)

It is known that many relevant logics can be conservatively extended by the truth constant known as the Ackermann constant. It is also known that many relevant logics can be conservatively extended by Boolean negation. This essay, however, shows that a range of relevant logics with the Ackermann constant cannot be conservatively extended by a Boolean negation.

In [1] J.-Y. Bèziau formulated a logic called Z. Bèziau’s idea was generalized independently in [6] and [7]. A family of logics to which Z belongs is denoted in [7] by K. In particular; it has been shown in [6] and [7] that there is a correspondence between normal modal logics and logics from the class K. Similar; but only partial results has been obtained also for regular logics. In a logic N has been investigated in the language (...) with negation; implication; conjunction and disjunction by axioms of positive intuitionistic logic; the right-to-left part of the second de Morgan law; and the rules of modus ponens and contraposition. From the semantical point of view the negation used by Došen is the modal operator of impossibility. It is known this operator is a characteristic of the modal interpretation of intuitionistic negation. In the present paper we consider an extension of N denoted by N+. We will prove that every extension of N+ that is closed under the same rules as N+; corresponds to a regular logic being an extension of the regular deontic logic D21. The proved correspondence allows to obtain from soundnesscompleteness result for any given regular logic containing D2, similar adequacy theorem for the respective extension of the logic N+. (shrink)

A theory of substructural negations as impossibility and as unnecessity based on bi-intuitionistic logic, also known as Heyting-Brouwer logic, has been developed by Takuro Onishi. He notes two problems for that theory and offers the identification of the two negations as a solution to both problems. The first problem is the lack of a structural rule corresponding with double negation elimination for negation as impossibility, DNE, and the second problem is a lack of correspondence between certain (...) sequents and a characterizing frame property. While the identification of negation as impossibility and negation as unnecessity does solve Onishi’s problems, in general it nevertheless seems desirable to keep the two notions separate. The present paper addresses the first problem by introducing a reformulation of Onishi’s display sequent calculus in a language of sequents that incorporates Boolean negation. Instead of identifying negation as impossibility and negation as unnecessity, a notion of weak frame correspondence is defined. It is observed that DNE weakly corresponds with a certain frame property, and two structural sequent rules are presented that together also weakly correspond with that frame property and allow one to derive DNE. Moreover, the reformulated display calculus has an independent motivation by considerations on proof-theoretic semantics. (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)

The logic B+ is Routley and Meyer's basic positive logic. We show how to introduce a minimal intuitionistic negation and an intuitionistic negation in B+. The two types of negation are introduced in a wide spectrum of relevance logics built up from B+. It is proved that although all these logics have the characteristic paradoxes of consistency, they lack the K rule (and so, the K axioms).

A general framework for translating various logical systems is presented, including a set of partial unary operators of affirmation and negation. Despite its usual reading, affirmation is not redundant in any domain of values and whenever it does not behave like a full mapping. After depicting the process of partial functions, a number of logics are translated through a variety of affirmations and a unique pair of negations. This relies upon two preconditions: a deconstruction of truth-values as ordered and (...) structured objects, unlike its mainstream presentation as a simple object; a redefinition of the Principle of Bivalence as a set of four independent properties, such that its definition does not equate with normality. (shrink)