This paper presents and motivates a new philosophical and logical approach to truth and semantic paradox. It begins from an inferentialist, and particularly bilateralist, theory of meaning---one which takes meaning to be constituted by assertibility and deniability conditions---and shows how the usual multiple-conclusion sequent calculus for classical logic can be given an inferentialist motivation, leaving classical model theory as of only derivative importance. The paper then uses this theory of meaning to present and motivate a logical system---ST---that conservatively extends classical (...) logic with a fully transparent truth predicate. This system is shown to allow for classical reasoning over the full (truth-involving) vocabulary, but to be non-transitive. Some special cases where transitivity does hold are outlined. ST is also shown to give rise to a familiar sort of model for non-classical logics: Kripke fixed points on the Strong Kleene valuation scheme. Finally, to give a theory of paradoxical sentences, a distinction is drawn between two varieties of assertion and two varieties of denial. On one variety, paradoxical sentences cannot be either asserted or denied; on the other, they must be both asserted and denied. The target theory is compared favourably to more familiar related systems, and some objections are considered. (shrink)

As is known, a logic S is paraconsistent if the rule ECQ (E contradictione quodlibet) is not a rule of S. Not less well known is the fact that Lewis’ modal logics are not paraconsistent. Actually, Lewis vindicates the validity of ECQ in a famous proof currently known as the “Lewis’ proof” or “Lewis’ argument.” This proof essentially leans on the Disjunctive Syllogism as a rule of inference. The aim of this paper is to define a series of paraconsistent logics (...) included in S4 where the Disjunctive Syllogism is valid only as a rule of proof. (shrink)

A logic is called 'paraconsistent' if it rejects the rule called 'ex contradictione quodlibet', according to which any conclusion follows from inconsistent premises. While logicians have proposed many technically developed paraconsistent logical systems and contemporary philosophers like Graham Priest have advanced the view that some contradictions can be true, and advocated a paraconsistent logic to deal with them, until recent times these systems have been little understood by philosophers. This book presents a comprehensive overview on paraconsistent logical systems to change (...) this situation. The book includes almost every major author currently working in the field. The papers are on the cutting edge of the literature some of which discuss current debates and others present important new ideas. The editors have avoided papers about technical details of paraconsistent logic, but instead concentrated upon works that discuss more 'big picture' ideas. Different treatments of paradoxes takes centre stage in many of the papers, but also there are several papers on how to interpret paraconistent logic and some on how it can be applied to philosophy of mathematics, the philosophy of language, and metaphysics. (shrink)

An Adequate theory of meaning and truth is semantically important. Such a theory necessarily includes in its analysis nonentities, items that do not exist. So what is semantically, and hence logically, important is bound to include nonentities. In virtue of the modifier ‘semantically“, the first premiss is analytic, and it is comparatively uncontroversial. By contrast the second premise of the syllogism, which we want to stick to, is decidedly controversial. So too is the thesis – which implies the inadequacy of (...) classical logical theories – that there are a great many natural language statements, statements an adequate theory should be able to treat of, which cannot be analysed logically, and semantically, without the equivalent of an appeal to nonentities. Defence of the thesis has been somewhat piecemeal, taking the form that all the theories so far offered which try to dispense with nonentities break down or run into insuperable difficulties, difficulties which are readily surmounted given appropriate talk about nonentities. In what follows we shall outline more general sorts of argument for the thesis, designed to show that no theory which dispenses with nonentities as objects of discourse can do justice to the data. (shrink)

Richard Sylvan (né Routley) was one of Australasia's most prolific and systematic philosophers. Though known for his innovative work in logic and metaphysics, the astonishing breadth of his philosophical endeavours included almost all reaches of philosophy. Taking the view that very basic assumptions of mainstream philosophy were fundamentally mistaken, he sought radical change across a wide range of theories. However, his view of the centrality of logic and recognition of the possibilities opened up by logical innovation in the fundamental areas (...) of metaphysics resulted in his working primarily in these two, closely connected fields. It is this work in logic and metaphysics that is the main focus of what follows. (shrink)

Free Semantics is based on normalized natural deduction for the weak relevant logic DW and its near neighbours. This is motivated by the fact that in the determination of validity in truth-functional semantics, natural deduction is normally used. Due to normalization, the logic is decidable and hence the semantics can also be used to construct counter-models for invalid formulae. The logic DW is motivated as an entailment logic just weaker than the logic MC of meaning containment. DW is the logic (...) focussed upon, but the results extend to MC. The semantics is called 'free semantics' since it is disjunctively and existentially free in that no disjunctive or existential witnesses are produced, unlike in truth-functional semantics. Such 'witnesses' are only assumed in generality and are not necessarily actual. The paper sets up the free semantics in a truth-functional style and gives a natural deduction interpetation of the meta-logical connectives. We then set out a familiar tableau-style system, but based on natural deduction proof rather than truth-functional semantics. A proof of soundness and completeness is given for a reductio system, which is a transform of the tableau system. The reductio system has positive and negative rules in place of the elimination and introduction rules of Brady's normalized natural deduction system for DW. The elimination-introduction turning points become closures of threads of proof, which are at the points of contradiction for the reductio system. (shrink)

Sound and complete semantics for classical propositional logic can be obtained by interpreting sentences as sets. Replacing sets with commuting dense binary relations produces an interpretation that turns out to be sound but not complete for R. Adding transitivity yields sound and complete semantics for RM, because all normal Sugihara matrices are representable as algebras of binary relations.

Relevance logics are known to be sound and complete for relational semantics with a ternary accessibility relation. This paper investigates the problem of adequacy with respect to special kinds of dynamic semantics (i.e., proper relation algebras and relevant families of relations). We prove several soundness results here. We also prove the completeness of a certain positive fragment of R as well as of the first-degree fragment of relevance logics. These results show that some core ideas are shared between relevance logics (...) and relation algebras. Some details of certain incompleteness results, however, pinpoint where relevance logics and relation algebras diverge. To carry out these semantic investigations, we define a new tableaux formalization and new sequent calculi (with the single cut rule admissible) for various relevance logics. (shrink)

In a standard sense, consistency and paraconsistency are understood as the absence of any contradiction and as the absence of the ECQ (‘E contradictione quodlibet’) rule, respectively. The concepts of weak consistency (in two different senses) as well as that of F -consistency have been defined by the authors. The aim of this paper is (a) to define alternative (to the standard one) concepts of paraconsistency in respect of the aforementioned notions of weak consistency and F -consistency; (b) to define (...) the concept of strong paraconsistency; (c) to build up a series of strongly paraconsistent logics; (d) to define the basic constructive logic adequate to a rather weak sense of consistency. All logics treated in this paper are strongly paraconsistent. All of them are sound and complete in respect a modification of Routley and Meyer’s ternary relational semantics for relevant logics (no logic in this paper is relevant). (shrink)

This chapter focuses on alternative logics. It discusses a hierarchy of logical reform. It presents case studies that illustrate particular aspects of the logical revisionism discussed in the chapter. The first case study is of intuitionistic logic. The second case study turns to quantum logic, a system proposed on empirical grounds as a resolution of the antinomies of quantum mechanics. The third case study is concerned with systems of relevance logic, which have been the subject of an especially detailed reform (...) program. Finally, the fourth case study is paraconsistent logic, perhaps the most controversial of serious proposals. (shrink)

A polemical account of Australian philosophy up to 2003, emphasising its unique aspects (such as commitment to realism) and the connections between philosophers' views and their lives. Topics include early idealism, the dominance of John Anderson in Sydney, the Orr case, Catholic scholasticism, Melbourne Wittgensteinianism, philosophy of science, the Sydney disturbances of the 1970s, Francofeminism, environmental philosophy, the philosophy of law and Mabo, ethics and Peter Singer. Realist theories especially praised are David Armstrong's on universals, David Stove's on logical probability (...) and the ethical realism of Rai Gaita and Catholic philosophers. In addition to strict philosophy, the book treats non-religious moral traditions to train virtue, such as Freemasonry, civics education and the Greek and Roman classics. (shrink)

In 1880, when Oliver Wendell Holmes (later to be a Justice of the U.S. Supreme Court) criticized the logical theology of law articulated by Christopher Columbus Langdell (the first Dean of Harvard Law School), neither Holmes nor Langdell was aware of the revolution in logic that had begun, the year before, with Frege's Begriffsschrift. But there is an important element of truth in Holmes's insistence that a legal system cannot be adequately understood as a system of axioms and corollaries; and (...) this element of truth is not obviated by the more powerful logical techniques that are now available. (shrink)

Kniha, jako je tato, nemůže být tak docela dílem jediného člověka. Dovést ji do podoby koherentního celku bych nedokázal bez pomoci svých kolegů, kteří po mně text četli a upozornili mě na spoustu chyb a nedůsledností, které se v něm vyskytovaly. Můj dík v tomto směru patří zejména Vojtěchu Kolmanovi, Liboru Běhounkovi a Martě Bílkové. Za připomínky k různým částem rukopisu jsem vděčen i Pavlu Maternovi, Milanu Matouškovi, Prokopu Sousedíkovi, Vladimíru Svobodovi, Petru Hájkovi a Grahamu Priestovi. Kniha vznikla v rámci (...) projektu podpořeného grantem AV ČR číslo A0009001/00. (shrink)

This paper criticises necessitarianism, the thesis that there is at least one necessary truth; and defends possibilism, the thesis that all propositions are contingent, or that anything is possible. The second section maintains that no good conventionalist account of necessity is available, while the third section criticises model theoretic necessitarianism. The fourth section sketches some recent technical work on nonclassical logic, with the aim of weakening necessitarian intuitions and strengthening possibilist intuitions. The fifth section considers several a prioristic attempts at (...) demonstrating that there is at least one necessary proposition and finds them inadequate. The final section emphasises the epistemic aspect of possibilism. (shrink)

In this article, extracted from his book Exploring Meinong's Jungle and Beyond, Sylvan argues that, contrary to widespread opinion, mathematics is not an extensional discipline and cannot be extensionalized without considerable damage. He argues that some of the insights of Meinong's theory of objects, and its modern development, item theory, should be applied to mathematics and that mathematical objects and structures should be treated as mind-independent, non-existent objects.

In this paper, consistency is understood as the absence of the negation of a theorem, and not, in general, as the absence of any contradiction. We define the basic constructive logic BKc1 adequate to this sense of consistency in the ternary relational semantics without a set of designated points. Then we show how to define a series of logics extending BKc1 within the spectrum delimited by contractionless minimal intuitionistic logic. All logics defined in the paper are paraconsistent logics.

This paper gives an outline of three different approaches to the four-valued semantics for relevant logics (and other non-classical logics in their vicinity). The first approach borrows from the 'Australian Plan' semantics, which uses a unary operator '⋆' for the evaluation of negation. This approach can model anything that the two-valued account can, but at the cost of relying on insights from the Australian Plan. The second approach is natural, well motivated, independent of the Australian Plan, and it provides a (...) semantics for the contraction-free relevant logic C (or RW). Unfortunately, its approach seems to model little else. The third approach seems to capture a wide range of formal systems, but at the time of writing, lacks a completeness proof. (shrink)

My first paper on the Is/Ought issue. The young Arthur Prior endorsed the Autonomy of Ethics, in the form of Hume’s No-Ought-From-Is (NOFI) but the later Prior developed a seemingly devastating counter-argument. I defend Prior's earlier logical thesis (albeit in a modified form) against his later self. However it is important to distinguish between three versions of the Autonomy of Ethics: Ontological, Semantic and Ontological. Ontological Autonomy is the thesis that moral judgments, to be true, must answer to a realm (...) of sui generis non-natural PROPERTIES. Semantic autonomy insists on a realm of sui generis non-natural PREDICATES which do not mean the same as any natural counterparts. Logical Autonomy maintains that moral conclusions cannot be derived from non-moral premises.-moral premises with the aid of logic alone. Logical Autonomy does not entail Semantic Autonomy and Semantic Autonomy does not entail Ontological Autonomy. But, given some plausible assumptions Ontological Autonomy entails Semantic Autonomy and given the conservativeness of logic – the idea that in a valid argument you don’t get out what you haven’t put in – Semantic Autonomy entails Logical Autonomy. So if Logical Autonomy is false – as Prior appears to prove – then Semantic and Ontological Autonomy would appear to be false too! I develop a version of Logical Autonomy (or NOFI) and vindicate it against Prior’s counterexamples, which are also counterexamples to the conservativeness of logic as traditionally conceived. The key concept here is an idea derived in part from Quine - that of INFERENCE-RELATIVE VACUITY. I prove that you cannot derive conclusions in which the moral terms appear non-vacuously from premises from which they are absent. But this is because you cannot derive conclusions in which ANY (non-logical) terms appear non-vacuously from premises from which they are absent Thus NOFI or Logical Autonomy comes out as an instance of the conservativeness of logic. This means that the reverse entailment that I have suggested turns out to be a mistake. The falsehood of Logical Autonomy would not entail either the falsehood Semantic Autonomy or the falsehood of Ontological Autonomy, since Semantic Autonomy only entails Logical Autonomy with the aid of the conservativeness of logic of which Logical Autonomy is simply an instance. Thus NOFI or Logical Autonomy is vindicated, but it turns out to be a less world-shattering thesis than some have supposed. It provides no support for either non-cognitivism or non-naturalism. (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)

A prepositional logic S has the Converse Ackermann Property (CAP) if (AB)C is unprovable in S when C does not contain . In A Routley-Meyer semantics for Converse Ackermann Property (Journal of Philosophical Logic, 16 (1987), pp. 65–76) I showed how to derive positive logical systems with the CAP. There I conjectured that each of these positive systems were compatible with a so-called semiclassical negation. In the present paper I prove that this conjecture was right. Relational Routley-Meyer type semantics are (...) provided for each one of the resulting systems (the positive systems plus the semiclassical negation). (shrink)

Models are constructed for a variety of systems of quantified relevance logic with identity. Models are given for systems with different principles governing the transitivity of identity and substitution, and the relative merits of these principles are discussed. The models in this paper are all extensions of the semantics of Fine's Semantics for Quantified Relevance Logic (Journal of Philosophical Logic 17 (1988)).

In this paper we set out a semantics for relevant (counterfactual) conditionals. We combine the Routley-Meyer semantics for relevant logic with a semantics for conditionals based on selection functions. The resulting models characterize a family of conditional logics free from fallacies of relevance, in particular counternecessities and conditionals with necessary consequents receive a non-trivial treatment.

The relevant modal logic G is a simple extension of the logic RT, the relevant counterpart of the familiar classically based system T. Using the Routley-Meyer semantics for relevant modal logics, this paper proves three main results regarding G: (i) G is semantically complete, but only with a non-standard interpretation of necessity. From this, however, other nice properties follow. (ii) With a standard interpretation of necessity, G is semantically incomplete; there is no class of frames that characterizes G. (iii) The (...) class of frames for G characterizes the classically based logic T. (shrink)

This paper presents a neighborhood semantics for logics of entailment. It begins with a minimal system Min that expresses the most fundamental assumptions about the entailment relation, and continues by examining various extensions that reflect further assumptions that might be made about entailment. This leads first to the logic B that is the basic relevant logic, and then to more powerful systems. All of these logics are proved to be sound and strongly complete. With B the neighborhood semantics meets the (...) Routley-Meyer relational semantics for relevant logic; these connections are examined. The minimal and basic entailment logics are shown to have the finite model property, and hence to be decidable. (shrink)

This paper presents completeness and conservative extension results for the boolean extensions of the relevant logic T of Ticket Entailment, and for the contractionless relevant logics TW and RW. Some surprising results are shown for adding the sentential constant t to these boolean relevant logics; specifically, the boolean extensions with t are conservative of the boolean extensions without t, but not of the original logics with t. The special treatment required for the semantic normality of T is also shown along (...) the way. (shrink)

The paper essentially shows that the paraconsistent logicDR satisfies the depth relevance condition. The systemDR is an extension of the systemDK of [7] and the non-triviality of a dialectical set theory based onDR has been shown in [3]. The depth relevance condition is a strengthened relevance condition, taking the form: If DR- AB thenA andB share a variable at the same depth, where the depth of an occurrence of a subformulaB in a formulaA is roughly the number of nested ''s (...) required to reach the occurrence ofB inA. The method of proof is to show that a model structureM consisting of {M 0 , M1, ..., M}, where theM i s are all characterized by Meyer''s 6-valued matrices (c. f, [2]), satisfies the depth relevance condition. Then, it is shown thatM is a model structure for the systemDR. (shrink)

We present an algebraic-style of semantics, which we call a content semantics, for quantified relevant logics based on the weak system BBQ. We show soundness and completeness for all quantificational logics extending BBQ and also treat reduced modelling for all systems containing BB d Q. The key idea of content semantics is that true entailments AB are represented under interpretation I as content containments, i.e. I(A)I(B) (or, the content of A contains that of B). This is opposed to the truth-functional (...) way which represents true entailments as truth-preservations over all set-ups (or worlds), i.e. (VaK) (if I(A, a) = T then I(B, a)= T). (shrink)

In part I, we presented an algebraic-style of semantics, which we called “content semantics,” for quantified relevant logics based on the weak systemBBQ. We showed soundness and completeness with respect to theunreduced semantics ofBBQ. In part II, we proceed to show soundness and completeness for extensions ofBBQ with respect to this type of semantics. We introducereduced semantics which requires additional postulates for primeness and saturation. We then conclude by showing soundness and completeness forBB d Q and its extentions with respect (...) to this reduced semantics. (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)

Seen from the point of view of evaluation conditions, a usual way to obtain a connexive logic is to take a well-known negation, for example, Boolean negation or de Morgan negation, and then assign special properties to the conditional to validate Aristotle’s and Boethius’ Theses. Nonetheless, another theoretical possibility is to have the extensional or the material conditional and then assign special properties to the negation to validate the theses. In this paper we examine that possibility, not sufficiently explored in (...) the connexive literature yet.We offer a characterization of connexive negation disentangled from the cancellation account of negation, a previous attempt to define connexivity on top of a distinctive negation. We also discuss an ancient view on connexive logics, according to which a valid implication is one where the negation of the consequent is incompatible with the antecedent, and discuss the role of our idea of connexive negation for this kind of view. (shrink)

The paper is about the connection between logic and discrimination, with special focus on Plumwood’s ideas in her groundbreaking article ‘The Politics of Reason. Towards a Feminist Logic’ (1993). Although Plumwood’s paper is not focused on the notion of discrimination, what she writes is useful for illuminating some basic mechanisms of thought that are at the basis of discriminatory practices. After an introductory section about the concepts of logic and discrimination and their possible interconnections, I present Plumwood’s ideas in 1993 (...) with a special focus on their relevance for understanding the nature of discrimination. More specifically, I use examples of discriminatory practices that make the connection between logical operations and oppression envisaged by Plumwood clear. I focus especially on two questions: Can logic produce discrimination? Can logic contribute to the fight against discrimination? If so, how? (shrink)

We present a logic of evidence that reduces agents’ epistemic idealisations by combining classical propositional logic with substructural modal logic for formulas in the scope of epistemic modalities. To this aim, we provide a neighborhood semantics of evidence, which provides a modal extension of Fine’s semantics for relevant propositional logic. Possible worlds semantics for classical propositional logic is then obtained by defining the set of possible worlds as a special subset of information states in Fine’s semantics. Finally, we prove that (...) evidence is a hyperintensional and non-prime notion in our logic, and provide a sound and complete axiomatisation of our evidence logic. (shrink)

Abstractionism in the philosophy of mathematics aims at deriving large fragments of mathematics by combining abstraction principles (i.e. the abstract objects $\S e_1, \S e_2$, are identical if, and only if, an equivalence relation $Eq_\S$ holds between the entities $e_1, e_2$) with logic. Still, as highlighted in work on the semantics for relevant logics, there are different ways theories might be combined. In exactly what ways must logic and abstraction be combined in order to get interesting mathematics? In this paper, (...) we investigate the matter by deriving the axioms of second-order Peano Arithmetic from Frege's Basic Law V (the extension of $F$ is identical with the extension of $G$ if, and only if, $F$ and $G$ are extensionally equivalent) in the presence of a relevant higher-order logic. The results are interesting. Not only must we take on logic as true, and not only must we apply our logic to abstraction principles, but also we have to apply our theory of abstraction back to the logic in order to arrive at arithmetic. Thus, what Abstractionism gives us is not simply what we get from abstraction via logic, but also what we get from logic via abstraction. (shrink)

In this paper, we examine a number of relevant logics’ variable sharing properties from the perspective of theories of topic or subject-matter. We take cues from Franz Berto’s recent work on topic to show an alignment between families of variable sharing properties and responses to the topic transparency of relevant implication and negation. We then introduce and defend novel variable sharing properties stronger than strong depth relevance—which we call cn-relevance and lossless cn-relevance—showing that the properties are satisfied by the weak (...) relevant logics and , respectively. We argue that such properties address a sort of semantic lossiness of strong depth relevance. (shrink)

Jc Beall has made several contributions to the theory of restricted quantification in relevant logics. This paper examines these contributions and proposes an alternative account of restricted universals. The alternative is not, however, a theory of relevant restricted universals in any real sense. It is, however, a theory of restricted universals phrased in the most plausible general quantificational theory for relevant logics—Kit Fine’s stratified semantics. The motivation both for choosing this semantic framework and for choosing the particular theory of restricted (...) quantification we use is because they are the best way of dealing with these topics from Beall’s theory-building theory picture of logic, establishing a second point of contact with Beall’s work. (shrink)

Logical analyses of scientific representations of the world have usually focused on axiomatized or axiomatizable theories. As practiced, science seldom employs such theories. Rather, we find aggregations of claims, the logical relations of which are not as neat as philosophers of science might like them to be. Indeed, a common feature of such aggregations is the presence of certain “theoretical anomalies,” statements that are in some way incompatible with the remainder of the corpus. Huygens’ description of light as exhibiting an (...) asymmetry with respect to its direction of propagation in polarization phenomena was such an anomaly because of its inconsistency with his account of light as longitudinal waves in a medium. (See Sabra 1981, pp. 226-227.) Although the occurrence of these anomalies is indicative of a problem that must be dealt with, inconsistent representations of the world are not without significant heuristic value. (shrink)

Logical frameworks that are sensitive to features of sentences’ subject-matter—like Berto’s topic-sensitive intentional modals (TSIMs)—demand a maximally faithful model of the topics of sentences. This is an especially difficult task in the case in which topics are assigned to intensional formulae. In two previous papers, a framework was developed whose model of intensional subject-matter could accommodate a wider range of intuitions about particular intensional conditionals. Although resolving a number of counterintuitive features, the work made an implicit assumption that the subject-matter (...) of an intensional conditional is a function of the subject-matters of its subformulae. This assumption—which I will call a principle of topic sufficiency—runs counter to some natural intuitions concerning topic. In this paper, we will investigate topic sufficiency and offer a semantic account that is state-sensitive, providing an implementation through the introduction of topic-sensitive logics related to William Parry’s prototypical $\mathsf {PAI}$. (shrink)

I this paper, I discuss Plumwood’s feminist logic program. I argue both in favor of her general stance in feminist philosophy of logic and her more specific feminist critique of classical logic. Plumwood’s general position is in opposition with (I think it’s safe to say) the prevailing view in analytic philosophy about the relation between formal logic and feminist theory, according to which feminist theory cannot say anything about or against logic proper, since the issues of oppression are external to (...) logic as a (formal) discipline. Connected to this externalism is a non-Plumwoodian view that “feminist logic” either doesn’t mean anything, or that it has some figurative meaning. Concerning Plumwood’s (I think it’s safe to say) not widely accepted feminist critique of classical logic, I propose an interpretation according to which classical logic is oppressive only when it’s used to describe a particular, “dualized” or “dualizable”, kind of notions. In accordance with this understanding, I consider five features of oppressive differentiations as proposed by Plumwood, arguing that two of them don’t concern negation, the feminist critique of which operator Plumwood is mostly (in)famous for. (shrink)