In his paper 'Generalised Ortho Negation' [2] J.Michael Dunn mentions a claim of mine to the effect that there is no condition on 'perp frames' equivalent to the holding of double negation elimination ∼∼A ⊩ A. That claim is wrong. In this paper I correct my error and analyse the behaviour of conditions on frames for negations which verify a number of different theses.

This article answers two questions (posed in the literature), each concerning the guaranteed existence of proofs free of double negation. A proof is free of double negation if none of its deduced steps contains a term of the formn(n(t)) for some term t, where n denotes negation. The first question asks for conditions on the hypotheses that, if satisfied, guarantee the existence of a double-negation-free proof when the conclusion is free of double (...) negation. The second question asks about the existence of an axiom system for classical propositional calculus whose use, for theorems with a conclusion free of double negation, guarantees the existence of a double-negation-free proof. After giving conditions that answer the first question, we answer the second question by focusing on the Lukasiewicz three-axiom system. We then extend our studies to infinite-valued sentential calculus and to intuitionistic logic and generalize the notion of being double-negation free. The double-negation proofs of interest rely exclusively on the inference rule condensed detachment, a rule that combines modus ponens with an appropriately general rule of substitution. The automated reasoning program Otter played an indispensable role in this study. (shrink)

A classical paraconsistent logic, which is regarded as a modified extension of first-degree entailment logic, is introduced as a Gentzen-type sequent calculus. This logic can simulate the classical negation in classical logic by paraconsistent double negation in CP. Theorems for syntactically and semantically embedding CP into a Gentzen-type sequent calculus LK for classical logic and vice versa are proved. The cut-elimination and completeness theorems for CP are also shown using these embedding theorems. Similar results are also (...) obtained for an intuitionistic paraconsistent logic, and several versions of Glivenko and Gödel-Gentzen translation theorems are proved for CP and IP. (shrink)

In this paper, a way of constructing many-valued paraconsistent logics with weak double negation axioms is proposed. A hierarchy of weak double negation axioms is addressed in this way. The many-valued paraconsistent logics constructed are defined as Gentzen-type sequent calculi. The completeness and cut-elimination theorems for these logics are proved in a uniform way. The logics constructed are also shown to be decidable.

We present a meta-analytic review on the processing of negations in conditional reasoning about affirmation problems (Modus Ponens: "MP", Affirmation of the Consequent "AC") and denial problems (Denial of the Antecedent "DA", and Modus Tollens "MT"). Findings correct previous generalisations about the phenomena. First, the effects of negation in the part of the conditional about which an inference is made, are not constrained to denial problems. These inferential-negation effects are also observed on AC. Second, there generally are reliable (...) effects of a negation in the clause referred to by the categorical premise, and these referred-negation effects are constrained to the logically fallacious AC and DA inferences. All findings are presented and discussed in relation to contemporary mental model (MM) and mental logic (ML) theories. It is argued that a double-negation elimination hypothesis provides a sufficient explanation of inferential-negation effects within both MM theory and ML theory, if the latter is extended by a validating search for counter examples. Both MM and ML theories adhere to a processing scheme that allows them to incorporate an account of referred-negation effects based on the thesis that counter-example frequency is modulated by the scope of a contrast class delineated by a false affirmative. We conclude that MM and ML theories provide adequate processing schemes to accommodate for the explanatory hypotheses, at least in principle. In practice, both approaches remain equivocal as regards the connectivity and interactivity with long-term memory knowledge invoked in generating, manipulating, and testing the mental representations of negative state of affairs. (shrink)

We present a meta-analytic review on the processing of negations in conditional reasoning about affirmation problems (Modus Ponens: “MP”, Affirmation of the Consequent “AC”) and denial problems (Denial of the Antecedent “DA”, and Modus Tollens “MT”). Findings correct previous generalisations about the phenomena. First, the effects of negation in the part of the conditional about which an inference is made, are not constrained to denial problems. These inferential-negation effects are also observed on AC. Second, there generally are reliable (...) effects of a negation in the clause referred to by the categorical premise, and these referred-negation effects are constrained to the logically fallacious AC and DA inferences. All findings are presented and discussed in relation to contemporary mental model (MM) and mental logic (ML) theories. It is argued that a double-negation elimination hypothesis provides a sufficient explanation of inferential-negation effects within both MM theory and ML theory, if the latter is extended by a validating search for counter examples. Both MM and ML theories adhere to a processing scheme that allows them to incorporate an account of referred-negation effects based on the thesis that counter-example frequency is modulated by the scope of a contrast class delineated by a false affirmative. We conclude that MM and ML theories provide adequate processing schemes to accommodate for the explanatory hypotheses, at least in principle. In practice, both approaches remain equivocal as regards the connectivity and interactivity with long-term memory knowledge invoked in generating, manipulating, and testing the mental representations of negative state of affairs. (shrink)

Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presented, and are used to show how one can sometimes extract a constructive proof and an algorithm from a proof that is nonconstructive. A variation of the double-negation translation is also discussed: if ϕ is provable classically, then ¬(¬ϕ)nf is provable in minimal logic, where θnf denotes the negation-normal form of θ. The translation is used to show that cut-elimination theorems for classical logic (...) can be viewed as special cases of the cut-elimination theorems for intuitionistic logic. (shrink)

It is often said that in a purely formal perspective, intuitionistic logic has no obvious advantage to deal with the liar-type paradoxes. In this paper, we will argue that the standard intuitionistic natural deduction systems are vulnerable to the liar-type paradoxes in the sense that the acceptance of the liar-type sentences results in inference to absurdity (⊥). The result shows that the restriction of the Double Negation Elimination (DNE) fails to block the inference to ⊥. It is, (...) however, not the problem of the intuitionistic approaches to the liar-type paradoxes but the lack of expressive power of the standard intuitionistic natural deduction system. We introduce a meta-level negation for a given system and a meta-level absurdity, ⋏, to the intuitionistic system. We shall show that in the system, the inference to ⊥ is not given without the assumption that the system is complete. Moreover, we consider the Double Meta-Level Negation Elimination rules (DMNE) which implicitly assume the completeness of the system. Then, the restriction of DMNE can rule out the inference to ⊥. (shrink)

We show that in elementary analysis (EL) the contrapositive of countable choice is equivalent to double negation elimination for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma_{2}^{0}}$$\end{document}-formulas. By also proving a recursive adaptation of this equivalence in Heyting arithmetic (HA), we give an instance of the conservativity of EL over HA with respect to recursive functions and predicates. As a complement, we prove in HA enriched with the (extended) Church thesis that every decidable predicate is (...) recursive. (shrink)

N. Kamide introduced a pair of classical and constructive logics, each with a peculiar type of negation: its double negation behaves as classical and intuitionistic negation, respectively. A consequence of this is that the systems prove contradictions but are non-trivial. The present paper aims at giving insights into this phenomenon by investigating subsystems of Kamide’s logics, with a focus on a system in which the double negation behaves as the negation of minimal logic. (...) We establish the negation inconsistency of the system and embeddability of contradictions from other systems. In addition, we attempt at an informational interpretation of the negation using the dimathematical framework of H. Wansing. (shrink)

In the context of intuitionistic analysis, we consider the set consisting of all continuous functions from [0,1] to such that =0 and =1, and the set consisting of ’s in where there exists x[0,1] such that . It is well-known that there are weak counterexamples to the intermediate value theorem, and with Brouwer’s continuity principle we have . However, there exists no satisfying answer to . We try to answer to this question by reducing it to a schema about intuitionistic (...) decidability that asserts “there exists an intuitionistically enumerable set that is not intuitionistically decidable”. We also introduce the notion of strong Specker double sequence, and prove that the existence of such a double sequence is equivalent to the existence of a function where. (shrink)

This paper presents an algebraic framework for investigating proposed translations of classical logic into intuitionistic logic, such as the four negative translations introduced by Kolmogorov, Gödel, Gentzen and Glivenko. We view these asvariant semanticsand present a semantic formulation of Troelstra’s syntactic criteria for a satisfactory negative translation. We consider how each of the above-mentioned translation schemes behaves on two generalisations of Heyting algebras: bounded pocrims and bounded hoops. When a translation fails for a particular class of algebras, we demonstrate that (...) failure via specific finite examples. Using these, we prove that the syntactic version of these translations will fail to satisfy Troelstra’s criteria in the corresponding substructural logical setting. (shrink)

Moerdijk has introduced a topos of sheaves on a category of filters. Following his suggestion, we prove that its double negation subtopos is the topos of sheaves on the subcategory of ultrafilters - the ultrasheaves. We then use this result to establish a double negation translation of results between the topos of ultrasheaves and the topos on filters.

We propose an extension of minimal intuitionistic predicate logic, based on delimited control operators, that can derive the predicate-logic version of the double-negation shift schema, while preserving the disjunction and existence properties.

An efficient variant of the double-negation translation explains the relationship between Shoenfield’s and G¨odel’s versions of the Dialectica interpretation.

We investigate intuitionistic propositional modal logics in which a modal operator is equivalent to intuitionistic double negation. Whereas ¬¬ is divisible into two negations, is a single indivisible operator. We shall first consider an axiomatization of the Heyting propositional calculus H, with the connectives →,∧,∨ and ¬, extended with . This system will be called Hdn . Next, we shall consider an axiomatization of the fragment of H without ¬ extended with . This system will be called Hdn (...) + . We shall show that these systems are sound and complete with respect to specific classes of Kripke-style models with two accessibility relations, one intuitionistic and the other modal. This type of models is investigated in [2] and [3], and here we try to apply the techniques of these papers to an intuitionistic modal operator with a natural interpretation. The full results of our investigation will be published in [4] and [1]. (shrink)

Prawitz conjectured that proof-theoretic validity offers a semantics for intuitionistic logic. This conjecture has recently been proven false by Piecha and Schroeder-Heister. This article resolves one of the questions left open by this recent result by showing the extensional alignment of proof-theoretic validity and general inquisitive logic. General inquisitive logic is a generalisation of inquisitive semantics, a uniform semantics for questions and assertions. The paper further defines a notion of quasi-proof-theoretic validity by restricting proof-theoretic validity to allow double (...) class='Hi'>negation elimination for atomic formulas and proves the extensional alignment of quasi-proof-theoretic validity and inquisitive logic. (shrink)

We refine the arithmetical hierarchy of various classical principles by finely investigating the derivability relations between these principles over Heyting arithmetic. We mainly investigate some restricted versions of the law of excluded middle, De Morgan's law, the double negation elimination, the collection principle and the constant domain axiom.

I shall present in this article a double negation account of the distinction between causes and background conditions. Such an account will be based on the idea that, unlike causes, background conditions allow for certain effects by way of double prevention. In Section 1 I shall introduce objective and non-objective theories of the causes-background conditions distinction and I shall discuss and reject some non-objective theories. In Section 2 I shall examine some existing objective theories and argue that (...) they need to be supplemented in two relevant respects. In Section 3 I shall present my double negation account. Background conditions will be taken to allow for their effects by acting as early double preventers, late double preventers or effect double preventers. In Section 4 I shall deal with two main problems, i.e., the possibility of interpreting background conditions as purely indirect causes and the introduction of negative entities in my account, and with further issues. (shrink)

This paper revisits some views about negation I defended in two early papers. Some of the themes of those papers have been developed sympathetically in recent work by Tim Smiley, Lloyd Humberstone and Ian Rumfitt. However, Rumfitt and Peter Gibbard have both criticised arguments I offered in defence of Double Negation Elimination (DNE), against a Dummettian intuitionist. I reconsider those arguments, arguing that although they survive Rumfitt’s and Gibbard’s attacks, the case against Dummett is for other (...) reasons less straightforward than I took it to be. With reference to Rumfitt’s own defence of DNE, I call attention to the attractions of the view defended in my second paper that negation has dialectical origins. I also point out some difficulties for this view which seem to have been overlooked by previous writers, including me. (shrink)

The interplay of philosophical ambitions and technical reality have given birth to rich and interesting approaches to explain the oft-claimed special character of mathematical and logical knowledge. Two projects stand out both for their audacity and their innovativeness. These are logicism and proof-theoretic semantics. This dissertation contains three chapters exploring the limits of these two projects. In both cases I find the formal results offer a mixed blessing to the philosophical projects. Chapter 1. Is a logicist bound to the claim (...) that as a matter of analytic truth there is an actual infinity of objects? If Hume’s Principle is analytic then in the standard setting the answer appears to be yes. Hodes’s work pointed to a way out by offering a modal picture in which only a potential infinity was posited. However, this project was abandoned due to apparent failures of cross-world predication. I re-explore this idea and discover that in the setting of the potential infinite one can interpret first-order Peano arithmetic, but not second-order Peano arithmetic. I conclude that in order for the logicist to weaken the metaphysically loaded claim of necessary actual infinities, they must also weaken the mathematics they recover. Chapter 2. There have been several recent results bringing into focus the super-intuitionistic nature of most notions of proof-theoretic validity. But there has been very little work evaluating the consequences of these results. In this chapter, I explore the question of whether these results undermine the claim that proof-theoretic validity shows us which inferences follow from the meaning of the connectives when defined by their introduction rules. It is argued that the super-intuitionistic inferences are valid due to the correspondence between the treatment of the atomic formulas and more complex formulas. And so the goals of proof-theoretic validity are not undermined. Chapter 3. Prawitz (1971) conjectured that proof-theoretic validity offers a semantics for intuitionistic logic. This conjecture has recently been proven false by Piecha and Schroeder-Heister (2019). This chapter resolves one of the questions left open by this recent result by showing the extensional alignment of proof-theoretic validity and general inquisitive logic. General inquisitive logic is a generalisation of inquisitive semantics, a uniform semantics for questions and assertions. The chapter further defines a notion of quasi-proof-theoretic validity by restricting proof-theoretic validity to allow double negation elimination for atomic formulas and proves the extensional alignment of quasi-proof-theoretic validity and inquisitive logic.Abstract prepared by Will Stafford extracted partially from the dissertation. (shrink)

The double negation has always been considered by the logical systems from ancient times to the present. In fact, that is an issue that the current syntactic theories studying human reasoning, for example, the mental logic theory, address today. However, in this paper, I claim that, in the case of some languages such as Spanish, the double negation causes problems for the cognitive theories mainly based on formal schemata and supporting the idea of a universal syntax (...) of thought in the human mind. Thus, I propose that, given those problems, semantic frameworks such as that of the mental models theory seem to be more appropriate for explaining the human inferential activity. (shrink)

The aim of the paper is to clarify the theoretical core of Solger's thought, the foundation for his aesthetics. I first analyze Solger's dialectic of double negation. Secondly I focus on Solger's gnoseology, which is orientated toward grasping the equilibrium between the Infinite (God) and the finite (world) consisting in this double negation. Lastly I investigate the notion of sacrifice, connecting it with Solger's ironic dialectic and showing its relevance to a complete understanding of his thought.

The aim of the paper is to clarify the theoretical core of Solger's thought, the foundation for his aesthetics. I first analyze Solger's dialectic of double negation. Secondly I focus on Solger's gnoseology, which is orientated toward grasping the equilibrium between the Infinite (God) and the finite (world) consisting in this double negation. Lastly I investigate the notion of sacrifice, connecting it with Solger's ironic dialectic and showing its relevance to a complete understanding of his thought.

It is often said that a correct logical system should have no counterexample to its logical rules and the system must be revised if its rules have a counterexample. If a logical system (or theory) has a counterexample to its logical rules, do we have to revise the system? In this paper, focussing on the role of counterexamples to logical rules, we deal with the question. -/- We investigate two mutually exclusive theories of arithmetic - intuitionistic and paraconsistent theories. The (...) paraconsistent theory provides a (strong) counterexample to Ex Contradiction Quodlibet (ECQ). On the other hand, the intuitionistic theory gives a (weak) counterexample to the Double Negation Elimination (DNE) of the paraconsistent theory. If any counterexample undermines the legitimate use of logical rules, both theories must be revised. -/- After we investigate a paraconsistent counterexample to ECQ and the intuitionist’s answer against it, we arrive at the unwelcome conclusion that ECQ has both a justification and a counterexample. Moreover, we argue that if a logical rule were abolished whenever it has a counterexample, a promising conclusion would be logical nihilism which is the view that there is no valid logical inference, and so a correct logical system does not exist. Provided that the logical revisionist is not a logical nihilist, we claim that not every counterexample is the ground for logical revision. While logical rules of a given system have a justification, the existence of a counterexample loses its role for logical revision unless the rules and the counterexample share the same structure. (shrink)

In this paper, we deal with a relationship among the law of excluded middle, the double negation elimination and the independence of premiss rule ) for intuitionistic predicate logic. After giving a general machinery, we give, as corollaries, several examples of extensions of \ and \ which are closed under \ but do not derive the independence of premiss axiom.

The aim of this paper is to reconstruct Brouwer’s justification for the intuitionistic revision of logic and mathematics. It is attempted to show that pivotal premisses of his argument are supplied by his philosophy. To this end, the basic tenets of his philosophical doctrine are discussed: the concepts of mind, causal attention, intuition of two-ity and his repudiation of realism.The restriction of intuitionistically allowable objects to spreads and species is traced back to Brouwer’s concept of intuition that is a defining (...) feature of his notion of mind. On the other hand, it is argued that his objections to some laws of classical logic result from the rejection of the rule of double negation elimination, which in turn follows from both, the claim that rules of logic should preserve evidence for assertions rather than truth, and too restrictive a concept of evidence. (shrink)

The classical theory of types in question is essentially the theory of Martin-Löf [1] but with the law of double negation elimination. I am ultimately interested in the theory of types as a framework for the foundations of mathematics and, for this purpose, we need to consider extensions of the theory obtained by adding ‘well-ordered types,’ for example the type N of the finite ordinals; but the unextended theory will suffice to illustrate the treatment of extensional equality.

In natural deduction classical logic is commonly formulated by adding a rule such as Double Negation Elimination (DNE) or Classical Reductio ad Absurdum (CRA) to a set of introduction and elimination rules sufficient for intuitionist first-order logic with conjunction, disjunction, implication, negation and the universal and existential quantifiers all taken as primitive. The natural deduction formulation of intuitionist logic, coming from Gentzen, has nice properties:— (i) the separation property: an intuitionistically valid inference is derivable using (...) only the introduction and elimination rules governing the connectives and/or quantifiers that occur in the premises (if any) and conclusion; (ii) the (strict) subformula property: more narrowly, there is a derivation of any intuitionistically valid inference that employs only subformulas of the formulas occurring in premises (if any) and conclusion. (Every formula is, of course, a subformula of itself.). (shrink)

n this paper, a non-classical axiomatic system was introduced to classify all moods of Aristotelian syllogisms, in addition to the axiom "Every a is an a" and the bilateral rules of obversion of E and O propositions. This system consists of only 2 definitions, 2 axioms, 1 rule of a premise, and moods of Barbara and Datisi. By adding first-degree propositional negation to this system, we prove that the square of opposition holds without using many of the other rules (...) of classical logic (including double negation elimination). We then show that the Propositional Substructural Logic SLe is the best logic to study Aristotelian Syllogisms. Also, based on the IFLe square of opposition, the rules of conversation and the rules of negation are completely proved in Muzaffar's logic. For this purpose, we used the monadic first-order logic with the same standard deductive apparatus of quantifiers in classical logic, plus the axioms of "some a is an a" and "some not-a is a not-a". Finally, to show that there is no existential commitment to general terms in categorical logic, the Strong Four-Valued Relevant-classical Logic KR4 was used. With the same existential interpretation of the quantifiers and the standard translation of the quarter quantified. (shrink)

The so-called paradoxes of material implication have motivated the development of many non-classical logics over the years, such as relevance logics, paraconsistent logics, fuzzy logics and so on. In this note, we investigate some of these paradoxes and classify them, over minimal logic. We provide proofs of equivalence and semantic models separating the paradoxes where appropriate. A number of equivalent groups arise, all of which collapse with unrestricted use of double negation elimination. Interestingly, the principle ex falso (...) quodlibet, and several weaker principles, turn out to be distinguishable, giving perhaps supporting motivation for adopting minimal logic as the ambient logic for reasoning in the possible presence of inconsistency. (shrink)

We prove that the (non-intuitionistic) law of the double negation shift has a bounded functional interpretation with bar recursive functionals of finite type. As an application. we show that full numerical comprehension is compatible with the uniformities introduced by the characteristic principles of the bounded functional interpretation for the classical case.

I prove that the three basic propositions of Vasiliev's paraconsistent logic have a semantic interpretation by means of the intuitionist logic. The interpèretation is confirmed by amens of the da Costa's model of Vasiliev's paraconsistent logic.

We present a cut-free sequent calculus for a class of first-order theories in negation normal form which include coherent and co-coherent theories alike. All structural rules, including cut, are admissible.

The idea is that, in a wide range of contexts, utterances of the sentences in (a) in each case will communicate the assumption in (b) in each case (or something closely akin to it, there being a certain amount of contextually governed variation in the speaker's propositional attitude and so the scope of the negation). These scalar inferences are taken to be one kind of (generalized) conversational implicature. As is the case with pragmatic inference quite generally, these inferences are (...) defeasible (cancellable), which distinguishes them from entailments, and they are nondetachable, which distinguishes them from conventional implicatures. The core idea is that the choice of a weaker element from a scale of elements ordered in terms of semantic strength (that is, numbers of entailments) tends to implicate that, as far as the speaker knows, none of the stronger elements in the scale holds in this instance. The pattern is quite clear in (1) and (2), where the weak/strong alternatives are some/all and five/six respectively. In the case of (3), the stronger expression must be intelligent and good-hearted which entails intelligent; what Y's utterance implicates is that Mary does not have the two properties: intelligence and good-heartedness, so that, given the proposition expressed (Mary is intelligent) it follows, deductively, that she is not good-hearted, in Y's opinion. The example in (4) involves a scale inversion due to the negation, so that the weak/strong alternatives are not necessarily/not possibly; the negation which the scalar inference generates creates a double negation, which is eliminated giving possibly. (shrink)

In [5] we study Nonassociative Lambek Calculus augmented with De Morgan negation, satisfying the double negation and contraposition laws. This logic, introduced by de Grooté and Lamarche [10], is called Classical Non-Associative Lambek Calculus. Here we study a weaker logic InNL, i.e. NL with two involutive negations. We present a one-sided sequent system for InNL, admitting cut elimination. We also prove that InNL is PTIME.

Substructural logics are logics obtained from a sequent formulation of intuitionistic or classical logic by rejecting some structural rules. The substructural logics considered here are linear logic, relevant logic and BCK logic. It is proved that first-order variants of these logics with an intuitionistic negation can be embedded by modal translations into S4-type extensions of these logics with a classical, involutive, negation. Related embeddings via translations like the double-negation translation are also considered. Embeddings into analogues of (...) S4 are obtained with the help of cut elimination for sequent formulations of our substructural logics and their modal extensions. These results are proved for systems with equality too. (shrink)

Monoidal logics were introduced as a foundational framework to analyse the proof theory of deontic logic. Building on Lambek’s work in categorical logic, logical systems are defined as deductive systems, that is, as collections of equivalence classes of proofs satisfying specific rules and axiom schemata. This approach enables the classification of deductive systems with respect to their categorical structure. When looking at their proof theory, however, one can see that there are similarities between monoidal and substructural logics. The purpose of (...) the present paper is to address this issue and highlight the differences between these two approaches. We argue that monoidal logics provide a more flexible foundational framework that enables a finer analysis of the relationship between negation and other logical connectives. We show that the elimination of double negation is independent from the de Morgan dualities, that monoidal deductive systems are not necessarily weakly distributive and that deduc... (shrink)

In order to explicate Gentzen’s famous remark that the introduction-rules for logical constants give their meaning, the elimination-rules being simply consequences of the meaning so given, we develop natural deduction rules for Sheffer’s stroke, alternative denial. The first system turns out to lack Double Negation. Strengthening the introduction-rules by allowing the introduction of Sheffer’s stroke into a disjunctive context produces a complete system of classical logic, one which preserves the harmony between the rules which Gentzen wanted: all (...) indirect proof reduces to direct proof. (shrink)

This paper shows that the inhabitation problem in the lambda calculus with negation, product, polymorphic, and existential types is decidable, where the inhabitation problem asks whether there exists some term that belongs to a given type. In order to do that, this paper proves the decidability of the provability in the logical system defined from the second-order natural deduction by removing implication and disjunction. This is proved by showing the quantifier elimination theorem and reducing the problem to the (...) provability in propositional logic. The magic formulas are used for quantifier elimination such that they replace quantifiers. As a byproduct, this paper also shows the second-order witness theorem which states that a quantifier followed by negation can be replaced by a witness obtained only from the formula. As a corollary of the main results, this paper also shows Glivenko’s theorem, Double Negation Shift, and conservativity for antecedent-empty sequents between the logical system and its classical version. (shrink)

Plato’s work offers insights into the corrosive impact of eros, insights central for contemporary politics. The article combines an in-depth reading of Plato with a case study, arguing for the relevance of communism. This is because love also establishes a relationship of subordination to the object of desire, which can subjugate and entrap the lover in his or her feelings. Such instrumentalization of eros in communism was promoted by adherents being supposed to love the sufferers. The obligation that to understand (...) and help the sufferers one must become a sufferer turned suffering into an autopoietic system. The acceptance of such instrumentalization of love was rendered possible first by a sense of guilt due to the system of passionate interests (Tarde and Latour), connected to the rise of capitalism as a solution for the period of civil wars, and then by the liminal conditions that emerged, especially in eastern Europe, after two world wars; conditions that were purposefully perpetuated through staging a sacrificial system, paralysing social life. The character of such liminal leaders can be analysed through the figure of the trickster, developed by anthropologists, complementing Weber’s notion of charisma. While communism disappeared as a force, contemporary political life is increasingly reduced to a politics of victimhood and suffering, where the search for the good life is replaced by the double negation of eliminating all suffering from the world – an effort that only produces the opposite result, while public reality becomes torn apart by sex scandals, confirming Foucault’s insight about the investment of desire and enslavement to sexuality. (shrink)

Kalrnaric. We set out a system T, consisting of normal proofs constructed by means of elegantly symmetrical introduction and elimination rules. In the system T there are two requirements, called ( ) and ()), on applications of discharge rules. T is sound and complete for Kalmaric arguments. ( ) requires nonvacuous discharge of assumptions; ()) requires that the assumption discharged be the sole one available of highest degree. We then consider a 'Duhemian' extension T*, obtained simply by dropping the (...) requirement ()). T* is a proper subsystem of intuitionistic relevant logic. Our main result is that T* is a double negation consistency companion to classical logic. Thus all one needs to add to T* to obtain classical logic is the (intuitionistic) absurdity rule, and the (classical) rule of double nega-. (shrink)