Nelson's Negation on the Base of Weaker Versions of Intuitionistic Negation

Constructive logic with Nelson negation is an extension of the intuitionistic logic with a special type of negation expressing some features of constructive falsity and refutation by counterexample. In this paper we generalize this logic weakening maximally the underlying intuitionistic negation. The resulting system, called subminimal logic with Nelson negation, is studied by means of a kind of algebras called generalized N-lattices. We show that generalized N-lattices admit representation formalizing the intuitive idea of refutation by means of counterexamples giving in this way a counterexample semantics of the logic in question and some of its natural extensions. Among the extensions which are near to the intuitionistic logic are the minimal logic with Nelson negation which is an extension of the Johansson's minimal logic with Nelson negation and its in a sense dual version — the co-minimal logic with Nelson negation. Among the extensions near to the classical logic are the well known 3-valued logic of Lukasiewicz, two 12-valued logics and one 48-valued logic. Standard questions for all these logics — decidability, Kripke-style semantics, complete axiomatizability, conservativeness are studied. At the end of the paper extensions based on a new connective of self-dual conjunction and an analog of the Lukasiewicz middle value ½ have also been considered.     

Combining Possibilities and Negations

Combining non-classical (or sub-classical) logics is not easy, but it is very interesting. In this paper, we combine nonclassical logics of negation and possibility (in the presence of conjunction and disjunction), and then we combine the resulting systems with intuitionistic logic. We will find that Kracht's results on the undecidability of classical modal logics generalise to a non-classical setting. We will also see conditions under which intuitionistic logic can be combined with a non-intuitionistic negation without corrupting the intuitionistic fragment of the logic.     

On Negation for Non-classical Set Theories

We present a case study for the debate between the American and the Australian plans, analyzing a crucial aspect of negation: expressivity within a theory. We discuss the case of non-classical set theories, presenting three different negations and testing their expressivity within algebra-valued structures for ZF-like set theories. We end by proposing a minimal definitional account of negation, inspired by the algebraic framework discussed.

     

Negation in the Context of Gaggle Theory

We study an application of gaggle theory to unary negative modal operators. First we treat negation as impossibility and get a minimal logic system Ki that has a perp semantics. Dunn's kite of different negations can be dealt with in the extensions of this basic logic K_i. Next we treat negation as “unnecessity” and use a characteristic semantics for different negations in a kite which is dual to Dunn's original one. K_u is the minimal logic that has a characteristic semantics. We also show that Shramko's falsification logic FL can be incorporated into some extension of this basic logic K_u. Finally, we unite the two basic logics K_i and K_u together to get a negative modal logic K_-, which is dual to the positive modal logic K₊ in [7]. Shramko has suggested an extension of Dunn's kite and also a dual version in [12]. He also suggested combining them into a “united” kite. We give a united semantics for this united kite of negations.     

Gentzen-Type Methods for Bilattice Negation

A general Gentzen-style framework for handling both bilattice (or strong) negation and usual negation is introduced based on the characterization of negation by a modal-like operator. This framework is regarded as an extension, generalization or re- finement of not only bilattice logics and logics with strong negation, but also traditional logics including classical logic LK, classical modal logic S4 and classical linear logic CL. Cut-elimination theorems are proved for a variety of proposed sequent calculi including CLS (a conservative extension of CL) and CLS_cw (a conservative extension of some bilattice logics, LK and S4). Completeness theorems are given for these calculi with respect to phase semantics, for SLK (a conservative extension and fragment of LK and CLS_cw, respectively) with respect to a classical-like semantics, and for SS4 (a conservative extension and fragment of S4 and CLScw, respectively) with respect to a Kripke-type semantics. The proposed framework allows for an embedding of the proposed calculi into LK, S4 and CL.     

On Extensions of Intermediate Logics by Strong Negation

In this paper we will study the properties of the least extension n() of a given intermediate logic by a strong negation. It is shown that the mapping from to n() is a homomorphism of complete lattices, preserving and reflecting finite model property, frame-completeness, interpolation and decidability. A general characterization of those constructive logics is given which are of the form n (). This summarizes results that can be found already in [13,14] and [4]. Furthermore, we determine the structure of the lattice of extensions of n(LC).     

Canonical Extensions and Relational Representations of Lattices with Negation

This work is part of a wider investigation into lattice-structured algebras and associated dual representations obtained via the methodology of canonical extensions. To this end, here we study lattices, not necessarily distributive, with negation operations.We consider equational classes of lattices equipped with a negation operation ¬ which is dually self-adjoint (the pair (¬,¬) is a Galois connection) and other axioms are added so as to give classes of lattices in which the negation is De Morgan, orthonegation, antilogism, pseudocomplementation or weak pseudocomplementation. These classes are shown to be canonical and dual relational structures are given in a generalized Kripke-style. The fact that the negation is dually self-adjoint plays an important role here, as it implies that it sends arbitrary joins to meets and that will allow us to define the dual structures in a uniform way.Among these classes, all but one—that of lattices with a negation which is an antilogism—were previously studied by W. Dzik, E. Or?owska and C. van Alten using Urquhart duality.In some cases in which a given axiom does not imply that negation is dually self-adjoint, canonicity is proven with the weaker assumption of antitonicity of the negation.     

A Note on Negation in Categorial Grammar

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

Constructive Logic with Strong Negation is a Substructural Logic. I

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 . Presented by Heinrich Wansing     

There is More to Negation than Modality

There is a relatively recent trend in treating negation as a modal operator. One such reason is that doing so provides a uniform semantics for the negations of a wide variety of logics and arguably speaks to a longstanding challenge of Quine put to non-classical logics. One might be tempted to draw the conclusion that negation is a modal operator, a claim Francesco Berto (Mind, 124(495), 761–793, 2015) defends at length in a recent paper. According to one such modal account, the negation of a sentence is true at a world x just in case all the worlds at which the sentence is true are incompatible with x. Incompatibility is taken to be the key notion in the account, and what minimal properties a negation has comes down to which minimal conditions incompatibility satisfies. Our aims in this paper are twofold. First, we wish to point out problems for the modal account that make us question its tenability on a fundamental level. Second, in its place we propose an alternative, non-modal, account of negation as a contradictory-forming operator that we argue is superior to, and more natural than, the modal account.     

Definability and Interpolation in Non-Classical Logics

Algebraic approach to study of classical and non-classical logical calculi was developed and systematically presented by Helena Rasiowa in [48], [47]. It is very fruitful in investigation of non-classical logics because it makes possible to study large families of logics in an uniform way. In such research one can replace logics with suitable classes of algebras and apply powerful machinery of universal algebra. In this paper we present an overview of results on interpolation and definability in modal and positive logics,and also in extensions of Johansson's minimal logic. All these logics are strongly complete under algebraic semantics. It allows to combine syntactic methods with studying varieties of algebras and to flnd algebraic equivalents for interpolation and related properties. Moreover, we give exhaustive solution to interpolation and some related problems for many families of propositional logics and calculi. This paper is a version of the invited talk given by the author at the conference Trends in Logic III, dedicated to the memory of A. MOSTOWSKI, H. RASIOWA and C. RAUSZER, and held in Warsaw and Ruciane-Nida from 23rd to 25th September 2005. Presented by Jacek Malinowski     

Normal Modal Substructural Logics with Strong Negation

We introduce modal propositional substructural logics with strong negation, and prove the completeness theorems (with respect to Kripke models) for these logics.     

The Role of Negation in Conditional Inference

This paper addresses the issue of how negative components affect people's ability to draw conditional inferences. The study was motivated by an attempt to resolve a difficulty for the mental models theory of Johnson-Laird and Byrne, whose account of matching bias in the selection task is apparently inconsistent with Johnson-Laird's explanation of the double negation effects in conditional inference reported by Evans, Clibbens, and Rood (1995). Two experiments are reported, which investigate frequencies of conditional inferences with task presentation similar to that of the selection task in two respects: the presence of a picture of four cards and the use of implicit negations in the premises. The latter variable was shown to be critical and demonstrated a new phenomenon: Conditional inferences of all kinds are substantially suppressed when based on implicitly negative premises. This phenomenon was shown to operate independently of and in addition to the double negation effect. A third experiment showed that the implicit negation effect could be extended to the paradigm in which people are asked to produce their own conclusions. It is argued that these two effects can be explained within either the mental models theory or the inference rule theory, of propositional reasoning, but that each will require some revision in order to offer a convincing account.     

Quantized Linear Logic,Involutive Quantales and Strong Negation

A new logic, quantized intuitionistic linear logic (QILL), is introduced, and is closely related to the logic which corresponds to Mulvey and Pelletier's (commutative) involutive quantales. Some cut-free sequent calculi with a new property quantization principle and some complete semantics such as an involutive quantale model and a quantale model are obtained for QILL. The relationship between QILL and Wansing's extended intuitionistic linear logic with strong negation is also observed using such syntactical and semantical frameworks.     

Notes on Constructive Negation

We put together several observations on constructive negation. First, Russell anticipated intuitionistic logic by clearly distinguishing propositional principles implying the law of the excluded middle from remaining valid principles. He stated what was later called Peirce’s law. This is important in connection with the method used later by Heyting for developing his axiomatization of intuitionistic logic. Second, a work by Dragalin and his students provides easy embeddings of classical arithmetic and analysis into intuitionistic negationless systems. In the last section, we present in some detail a stepwise construction of negation which essentially concluded the formation of the logical base of the Russian constructivist school. Markov’s own proof of Markov’s principle (different from later proofs by Friedman and Dragalin) is described.     

Solger and Hegel: Negation and Privation

Abstract

This paper has two related goals. Firstly, after briefly clarifying the theoretical core of Solger’s thought, it will analyse his metaphysics from Hegel’s point of view, emphasizing that sacrifice is, for Solger, the fundamental structure of the relationship between the finite and the Infinite. Secondly, it will investigate the main reasons behind Hegel’s criticism of Solger, showing that they have different conceptions of privation and negation and concluding that Solger and Hegel have different aims. Hegel’s aim consists in recomposing the unity of finite and infinite, whereas Solger’s thought is structured on the rupture between these two.     

Hegel's Glutty Negation

Some authors have claimed that Hegel's ‘determinate negation’ should be distinguished from ‘logical’ or ‘formal’ negation, that is, from a view of negation as a contradictory forming operator. In contrast, I argue that dialectical determinate negation involves a view of negation as a contradictory forming operator, and can therefore count as formal negation in every respect. However, as it is clear in contemporary glutty semantics of negation, one may distinguish between different accounts of the relationship between negation, contradiction and content. I suggest that, differently from classical negation, and as glutty negation, dialectical negation has partial content.     

Schopenhauer on Christ,Suffering and the Negation of the Will

ABSTRACT

This paper seeks to illuminate Schopenhauer’s notion of the negation or denial of the will by investigating the figure of the saint within his philosophy. We argue that various discussions in Schopenhauer’s works of the possible role of Christ as exemplar reveals an underlying Christological understanding of self-denial as a model for the saint. The connection between Schopenhauer’s approach to Christ and Kant’s Christology in Religion within the Bounds of Mere Reason is also explored. We note how Schopenhauer builds on the Kantian demythologization of the Incarnated Christ in order to uncover the moral and existential spirit that underlies Christianity. In addition, we outline how a recognition of the symbolic importance of Christ for Schopenhauer suggests features of the denial of the will that have been overlooked in the literature, involving the intellectual transcendence of suffering through the cultivation of a state of emotional unresponsiveness. It is argued that this reflects a deeper connection between Schopenhauer’s philosophy and Christian thought than is often recognised.     

Negation: A theory of its meaning,representation, and use

This article presents a model-based theory of what negation means, how it is mentally represented, and how it is understood. The theory postulates that negation takes a single argument that refers to a set of possibilities and returns the complement of that set. Individuals therefore tend to assign a small scope to negation in order to minimize the number of models of possibilities that they have to consider. Individuals untrained in logic do not know the possibilities corresponding to the negation of compound assertions formed with if, or, and and, and have to infer the possibilities one by one. It follows that negations are easier to understand, and to formulate, when individuals already have in mind the possibilities to be negated. The paper shows that the evidence, including the results of recent studies, corroborates the theory.