In one of their papers, Michael De and Hitoshi Omori observed that the notion of classical negation is not uniquely determined in the context of so-called Belnap-Dunn logic, and in fact there are 16 unary operations that qualify to be called classical negation. These varieties are due to different falsity conditions one may assume for classical negation. The aim of this paper is to observe that there is an interesting way to make sense of (...) classical negation independent of falsity conditions. We discuss two equivalent semantics, and offer a Hilbert-style system that is sound and complete with respect to the semantics. (shrink)

As part of our small contribution in dialogue toward better peace development and reconciliation studies, and following Toffler & Toffler’s War and Antiwar (1993), the present article delves into a realm of logic beyond the traditional confines of negation and the excluded middle principle, exploring the nuances of "Otherness" that transcend classical and Nagatomo logics. Departing from the foundational premises of classical Aristotelian logic systems, this exploration ventures into alternative realms of reasoning, specifically examining Neutrosophic Logic and (...) Klein bottle logic (cf. Smarandache, 2005). The study challenges conventional boundaries and explores the implications of embracing paradoxes and self-reference in logic systems, aiming to redefine approaches to understanding truth and reasoning. The paper investigates how these alternative logics open avenues for philosophical inquiry, redefining entropy, and potentially influencing innovative perspectives in free energy systems. Through this exploration, it seeks to expand the discourse on logic, welcoming a broader spectrum of thought beyond established frameworks; and we also discuss shortly a number of possible implementations including in risk management and also Klein bottle entropy redefinition (Tang et al, 2018). (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.

The present contribution might be regarded as a kind of defense of the common sense in logic. It is demonstrated that if the classical negation is interpreted as the minimal negation with n = 2 truth values, then deviant logics can be conceived as extension of the classical bivalent frame. Such classical apprehension of negation is possible in non- classical logics as well, if truth value is internalized and bivalence is replaced by bipartition.

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)

I propose a comprehensive account of negation as a modal operator, vindicating a moderate logical pluralism. Negation is taken as a quantifier on worlds, restricted by an accessibility relation encoding the basic concept of compatibility. This latter captures the core meaning of the operator. While some candidate negations are then ruled out as violating plausible constraints on compatibility, different specifications of the notion of world support different logical conducts for negations. The approach unifies in a philosophically motivated picture (...) the following results: nothing can be called a negation properly if it does not satisfy Contraposition and Double Negation Introduction; the pair consisting of two split or Galois negations encodes a distinction without a difference; some paraconsistent negations also fail to count as real negations, but others may; intuitionistic negation qualifies as real negation, and classical Boolean negation does as well, to the extent that constructivist and paraconsistent doubts on it do not turn on the basic concept of compatibility but rather on the interpretation of worlds. (shrink)

Connexive logics are based on two ideas: that no statement entails or is entailed by its own negation (this is Aristotle’s thesis) and that no statement entails both something and the negation of this very thing (this is Boethius' thesis). Usually, connexive logics are contra-classical. In this note, I introduce a reading of the connexive theses that makes them compatible with classical logic. According to this reading, the theses in question do not talk about validity alone; (...) rather, they talk in part about (a property related to) the soundness of arguments. (shrink)

Negation often reinforces problematic habits of othering, but rethinking negation can make good on feminist hopes for logic as a transformative space for inclusion. As Plumwood argues in her 1993 paper, not all uses of negation in the context of social identity are inherently problematic, but the widespread implicit use of classical negation has limited our options with respect to representing difference, ultimately reinforcing dualisms that essentialize social differences in problematic ways. In response to these (...) limitations, I take inspiration from Dembroff’s recent work on the metaphysics of genderqueer identity to build models of social identity using the Heyting-Brouwer logic developed by Rauszer in her 1974 paper. Ultimately, I argue that these models demonstrate both how classical negation reinforces problematic habits of othering and how alternative forms of negation can transform our treatment of social identity altogether. (shrink)

We argue that, if taken seriously, Kripke's view that a language for science can dispense with a negation operator is to be rejected. Part of the argument is a proof that positive logic, i.e., classical propositional logic without negation, is not categorical.

This short paper has two loosely connected parts. In the first part, I discuss the difference between classical and intuitionist logic in relation to different the role of hypotheses play in each logic. Harmony is normally understood as a relation between two ways of manipulating formulas in systems of natural deduction: their introduction and elimination. I argue, however, that there is at least a third way of manipulating formulas, namely the discharge of assumption, and that the difference between (...) class='Hi'>classical and intuitionist logic can be characterised as a difference of the conditions under which discharge is allowed. Harmony, as ordinarily understood, has nothing to say about discharge. This raises the question whether the notion of harmony can be suitably extended. This requires there to be a suitable fourth way of manipulating formulas that discharge can stand in harmony to. The question is whether there is such a notion: what might it be that stands to discharge of formulas as introduction stands to elimination? One that immediately comes to mind is the making of assumptions. I leave it as an open question for further research whether the notion of harmony can be fruitfully extended in the way suggested here. In the second part, I discuss bilateralism, which proposes a wholesale revision of what it is that is assumed and manipulated by rules of inference in deductions: rules apply to speech acts – assertions and denials – rather than propositions. I point out two problems for bilateralism. First, bilaterlists cannot, contrary to what they claim to be able to do, draw a distinction between the truth and assertibility of a proposition. Secondly, it is not clear what it means to assume an expression such as '+ A' that is supposed to stand for an assertion. Worse than that, it is plausible that making an assumption is a particular speech act, as argued by Dummett (Frege: Philosophy of Language, p.309ff). Bilaterlists accept that speech acts cannot be embedded in other speech acts. But then it is meaningless to assume + A or − A. (shrink)

The recent literature on Nāgārjuna’s catuṣkoṭi centres around Jay Garfield’s (2009) and Graham Priest’s (2010) interpretation. It is an open discussion to what extent their interpretation is an adequate model of the logic for the catuskoti, and the Mūla-madhyamaka-kārikā. Priest and Garfield try to make sense of the contradictions within the catuskoti by appeal to a series of lattices – orderings of truth-values, supposed to model the path to enlightenment. They use Anderson & Belnaps's (1975) framework of First Degree Entailment. (...) Cotnoir (2015) has argued that the lattices of Priest and Garfield cannot ground the logic of the catuskoti. The concern is simple: on the one hand, FDE brings with it the failure of classical principles such as modus ponens. On the other hand, we frequently encounter Nāgārjuna using classical principles in other arguments in the MMK. There is a problem of validity. If FDE is Nāgārjuna’s logic of choice, he is facing what is commonly called the classical recapture problem: how to make sense of cases where classical principles like modus pones are valid? One cannot just add principles like modus ponens as assumptions, because in the background paraconsistent logic this does not rule out their negations. In this essay, I shall explore and critically evaluate Cotnoir’s proposal. In detail, I shall reveal that his framework suffers collapse of the kotis. Furthermore, I shall argue that the Collapse Argument has been misguided from the outset. The last chapter suggests a formulation of the catuskoti in classical Boolean Algebra, extended by the notion of an external negation as an illocutionary act. I will focus on purely formal considerations, leaving doctrinal matters to the scholarly discourse – as far as this is possible. (shrink)

There is widespread agreement that while on a Dummettian theory of meaning the justified logic is intuitionist, as its constants are governed by harmonious rules of inference, the situation is reversed on Huw Price's bilateralist account, where meanings are specified in terms of primitive speech acts assertion and denial. In bilateral logics, the rules for classical negation are in harmony. However, as it is possible to construct an intuitionist bilateral logic with harmonious rules, there is no formal argument (...) against intuitionism from the bilateralist perspective. Price gives an informal argument for classical negation based on a pragmatic notion of belief, characterised in terms of the differences they make to speakers' actions. The main part of this paper puts Price's argument under close scrutiny by regimenting it and isolating principles Price is committed to. It is shown that Price should draw a distinction between A or ¬A making a difference. According to Price, if A makes a difference to us, we treat it as decidable. This material allows the intuitionist to block Price's argument. Abandoning classical logic also brings advantages, as within intuitionist logic there is a precise meaning to what it might mean to treat A as decidable: it is to assume A ∨ ¬A. (shrink)

In The Boundary Stones of Thought, Rumfitt defends classical logic against challenges from intuitionistic mathematics and vagueness, using a semantics of pre-topologies on possibilities, and a topological semantics on predicates, respectively. These semantics are suggestive but the characterizations of negation face difficulties that may undermine their usefulness in Rumfitt’s project.

This paper considers a formalisation of classical logic using general introduction rules and general elimination rules. It proposes a definition of ‘maximal formula’, ‘segment’ and ‘maximal segment’ suitable to the system, and gives reduction procedures for them. It is then shown that deductions in the system convert into normal form, i.e. deductions that contain neither maximal formulas nor maximal segments, and that deductions in normal form satisfy the subformula property. Tarski’s Rule is treated as a general introduction rule for (...) implication. The general introduction rule for negation has a similar form. Maximal formulas with implication or negation as main operator require reduction procedures of a more intricate kind not present in normalisation for intuitionist logic. (shrink)

Bilateralists hold that the meanings of the connectives are determined by rules of inference for their use in deductive reasoning with asserted and denied formulas. This paper presents two bilateral connectives comparable to Prior's tonk, for which, unlike for tonk, there are reduction steps for the removal of maximal formulas arising from introducing and eliminating formulas with those connectives as main operators. Adding either of them to bilateral classical logic results in an incoherent system. One way around this problem (...) is to count formulas as maximal that are the conclusion of reductio and major premise of an elimination rule and to require their removability from deductions. The main part of the paper consists in a proof of a normalisation theorem for bilateral logic. The closing sections address philosophical concerns whether the proof provides a satisfactory solution to the problem at hand and confronts bilateralists with the dilemma that a bilateral notion of stability sits uneasily with the core bilateral thesis. (shrink)

Double negations are easily recognised in both the so-called “negative literature” and the original texts of some important scientific theories. Often they are not equivalent to the corresponding affirmative propositions. In the case the law of double negation fails they belong to non-classical logic, as first, intuitionist logic. Through a comparative analysis of the theories including them the main features of a new kind of theoretical organization governed by intuitionist logic are obtained. Its arguing proceeds through doubly negated (...) propositions and ad absurdum arguments. Then, the final doubly negated predicate is translated in the corresponding affirmative one, from which all the consequences are deduced in order to test them against reality. According to this model the true formalization of intuitionist logic is Kolmogorov’s 1932 paper. The above analysis also shows that modal words play an auxiliary or substitutive role to intuitionist propositions. In addition, it is shown that Vasiliev’s paraconsistent logic is represented through doubly negated propositions. By means of these three kinds of logic one can attribute a specific kind of logic to each of the three distinct steps of the process of building a scientific theory from the experimental data to its final theoretical system. It is also shown that the definition of negation is of a structural kind, rather than of an objective kind or a subjective kind: it has to be referred to the organization of the theory to which it belongs. (shrink)

Vann McGee has recently argued that Belnap’s criteria constrain the formal rules of classical natural deduction to uniquely determine the semantic values of the propositional logical connectives and quantifiers if the rules are taken to be open-ended, i.e., if they are truth-preserving within any mathematically possible extension of the original language. The main assumption of his argument is that for any class of models there is a mathematically possible language in which there is a sentence true in just those (...) models. I show that this assumption does not hold for the class of models of classical propositional logic. In particular, I show that the existence of non-normal models for negation undermines McGee’s argument. (shrink)

We examine the set of formula-to-formula valid inferences of Classical Logic, where the premise and the conclusion share at least a propositional variable in common. We review the fact, already proved in the literature, that such a system is identical to the first-degree entailment fragment of R. Epstein's Relatedness Logic, and that it is a non-transitive logic of the sort investigated by S. Frankowski and others. Furthermore, we provide a semantics and a calculus for this logic. The semantics is (...) defined in terms of a \-matrix built on top of a 5-valued extension of the 3-element weak Kleene algebra, whereas the calculus is defined in terms of a Gentzen-style sequent system where the left and right negation rules are subject to linguistic constraints. (shrink)

This article maintains that Jean-Paul Sartre’s early masterwork, Being and Nothingness, is primarily concerned with developing an original approach to the being of consciousness. Sartre’s ontology resituates the Cartesian cogito in a complete system that provides a new understanding of negation and a dynamic interpretation of human existence. The article examines the role of consciousness, temporality and the relationship between self and others in the light of Sartre’s arguments against “classical” rationalism. The conclusion suggests that Sartre’s departure from (...) modern foundationalism has “postmodern” implications that emerge in the areas of ontology, existential analytics and the ethics of human freedom. (shrink)

Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic consequence relations $st$, $ss$, $tt$, $ss\cap tt$, and $ts$, when the connectives are negation, conjunction, and disjunction. For $ts$ and $ss\cap tt$ the answer is trivial (no scheme works), and for $ss$ and $tt$ it is straightforward (they are the collapsible schemes, (...) in which the middle value acts like one of the classical values). For $st$, the schemes in question are the Boolean normal schemes that are either monotonic or collapsible. (shrink)

We present a set-theoretic model of the mental representation of classically quantified sentences (All P are Q, Some P are Q, Some P are not Q, and No P are Q). We take inclusion, exclusion, and their negations to be primitive concepts. It is shown that, although these sentences are known to have a diagrammatic expression (in the form of the Gergonne circles) which constitute a semantic representation, these concepts can also be expressed syntactically in the form of algebraic formulas. (...) It is hypothesized that the quantified sentences have an abstract underlying representation common to the formulas and their associated sets of diagrams (models). Nine predictions are derived (three semantic, two pragmatic, and four mixed) regarding people's assessment of how well each of the five diagrams expresses the meaning of each of the quantified sentences. The results from three experiments, using Gergonne's circles or an adaptation of Leibniz lines as external representations, are reported and shown to support the predictions. (shrink)

In the present paper, we prove the normalization theorem and the consistency of the first-order classical logic with disjunctive syllogism. First, we propose the natural deduction system SCD for classical propositional logic having rules for conjunction, implication, negation, and disjunction. The rules for disjunctive syllogism are regarded as the rules for disjunction. After we prove the normalization theorem and the consistency of SCD, we extend SCD to the system SPCD for the first-order classical logic with disjunctive (...) syllogism. It can be shown that SPCD is conservative extension to SCD. Then, the normalization theorem and the consistency of SPCD are given. (shrink)

*These notes were folded into the published paper "Probability and nonclassical logic*. Revising semantics and logic has consequences for the theory of mind. Standard formal treatments of rational belief and desire make classical assumptions. If we are to challenge the presuppositions, we indicate what is kind of theory is going to take their place. Consider probability theory interpreted as an account of ideal partial belief. But if some propositions are neither true nor false, or are half true, or whatever—then (...) it’s far from clear that our degrees of belief in it and its negation should sum to 1, as classical probability theory requires (?, cf.). There are extant proposals in the literature for generalizing (categorical) probability theory to a non-classical setting, and we will use these below. But subjective probabilities themselves stand in functional relations to other mental states, and we need to trace the knock-on consequences of revisionism for this interrelationship (arguably, degrees of belief only count as kinds of belief in virtue of standing in these functional relationships). (shrink)

This brief note corrects an error in one of the reduction steps in my paper 'Normalisation for Bilateral Classical Logic with some Philosophical Remarks' published in the Journal of Applied Logics 8/2 (2021): 531-556.

Could there be a single logical system that would allow us to work simultaneously with classical, paraconsistent, and paracomplete negations? These three negations were separately studied in logics whose negations bear their names. Initially we will restrict our analysis to propositional logics by analyzing classical negation, ¬c, as treated by Classical Propositional Logic (LPC); the paraconsistent negation, ¬p, as treated through the hierarchy of Paraconsistent Propositional Calculi Cn (0 ≤ n ≤ ω); and the paracomplete (...) negation, ¬q, as treated by the hierarchy of Paracomplete Propositional Calculi Pn (0 ≤ n ≤ ω). In “Logics that are both paraconsistent and paracomplete” (1989), Newton da Costa proposed a system with approximate characteristics to what we are looking for. In the hierarchy of Non-Alethical Propositional Calculi Nn (0 ≤ n ≤ ω), only one negation is introduced (as primitive), called a “non-alethic” (¬n), whose operation preserves the properties of classical, or paraconsistent or paracomplete negation -- depending on the well or ill behavior of the formula connected to it. However, as we shall see, in the hierarchy Nn we can not reiterate negations with different behaviors in a same formula (e.g., ¬p¬cα or ¬q¬c¬p α), or even analyze a formula like ¬cα → ¬pα. In view of these problems, can we really say that the hierarchy Nn allows us to understand the relationships and interactions of the three types of negations? In order to deal with this, given the initial problem, we will present four axiomatic systems (KG) in which, unlike Nn, the three negations are directly introduced -- offering a semantics and a method of proofs by analytic tableaux. Through the KG Systems we will show how the negations interact, obtaining non-demonstrable theorems in LPC, Cn, Pn, and Nn (0 ≤ n ≤ ω). Finally, we will also offer a first-order extension for the KG Systems. (shrink)

Ian Rumfitt has proposed systems of bilateral logic for primitive speech acts of assertion and denial, with the purpose of ‘exploring the possibility of specifying the classically intended senses for the connectives in terms of their deductive use’ : 810f). Rumfitt formalises two systems of bilateral logic and gives two arguments for their classical nature. I assess both arguments and conclude that only one system satisfies the meaning-theoretical requirements Rumfitt imposes in his arguments. I then formalise an intuitionist system (...) of bilateral logic which also meets those requirements. Thus Rumfitt cannot claim that only classical bilateral rules of inference succeed in imparting a coherent sense onto the connectives. My system can be extended to classical logic by adding the intuitionistically unacceptable half of a structural rule Rumfitt uses to codify the relation between assertion and denial. Thus there is a clear sense in which, in the bilateral framework, the difference between classicism and intuitionism is not one of the rules of inference governing negation, but rather one of the relation between assertion and denial. (shrink)

Val Plumwood’s 1993 paper, “The politics of reason: towards a feminist logic” (hence- forth POR) attempted to set the stage for what she hoped would begin serious feminist exploration into formal logic – not merely its historical abuses, but, more importantly, its potential uses. This work offers us: (1) a case for there being feminist logic; and (2) a sketch of what it should resemble. The former goal of Plumwood’s paper encourages feminist theorists to reject anti-logic feminist views. The paper’s (...) latter aim is even more challenging. Plumwood’s critique of classical negation (and classical logic) as a logic of domination asks us to recognize that particular logical systems are weapons of oppression. Against anti-logic feminist theorists, Plumwood argues that there are other logics besides classical logic, such as relevant logics, which are suited for feminist theorizing. Some logics may oppress while others may liberate. We provide details about the sources and context for her rejection of classical logic and motivation for promoting relevant logics as feminist. (shrink)

The aim of this paper is to explore the peculiar case of infectious logics, a group of systems obtained generalizing the semantic behavior characteristic of the -fragment of the logics of nonsense, such as the ones due to Bochvar and Halldén, among others. Here, we extend these logics with classical negations, and we furthermore show that some of these extended systems can be properly regarded as logics of formal inconsistency and logics of formal undeterminedness.

Without directly addressing the Demarcation Problem for logic—the problem of distinguishing logical vocabulary from others—we focus on distinctive aspects of logical vocabulary in pursuit of a second goal in the philosophy of logic, namely, proposing criteria for the justification of logical rules. Our preferred approach has three components. Two of these are effectively Belnap’s, but with a twist. We agree with Belnap’s response to Prior’s challenge to inferentialist characterisations of the meanings of logical constants. Belnap argued that for a logical (...) constant to exist, its rules must be conservative over a previously given consequence relation and guarantee the uniqueness of the constant. The twist is that we require logical vocabulary to be provably conservative, not over a previously given formal consequence relation, but over a previously given meaningful vocabulary of a language. Uniqueness is also a feature defined in terms of provability: if two syntactically distinguished expressions are governed by the same rules, then formulas with them as main operators are interderivable. Belnap’s criteria are not only those for the existence of a logical constant, but more: they are what distinguishes logical vocabulary from all other expressions. It is the defining mark of a logical constant that it is provably conservative over the fragment of the language which excludes it and that its rules guarantee its uniqueness. The third component is the topic neutrality of logic. The provable conservativeness of logic over a previously given vocabulary of a language is motivated, in part, by appeal to molecularism in the theory of meaning. Molecularity is a feature endorsed by the theory of meaning as a whole, so it does not distinguish logical constants from other expressions. The same is true for conservativeness. We argue that molecularity, and hence conservativeness, are implicit presuppositions of speakers’ use of language: the addition of new vocabulary to a language is presupposed to be conservative. But this presupposition is one that we should be able reflectively to endorse (such as when attempting a rational reconstruction of the use of the vocabulary). Thus, where conservativeness is found to fail, this defect should be remedied and the use of the vocabulary corrected (as in classical negation) or excised altogether (as in pejoratives). We go on to characterise a notion of topic neutrality, which we argue applies to logical vocabulary. We then note that reflective endorsement of the conservativeness of a topic neutral vocabulary requires a proof that the vocabulary is conservative relative to any base vocabulary. Thus we require that logical vocabulary be demonstrably conservative. Allying this requirement, distinctive of logic, to a general consideration about the commitments of assertion yields a mode of justification for logical constants akin to some conceptions of Harmony, i.e., to the idea that the consequences of assertion of a logical complex need to be warranted by the grounds and ought to be the strongest consequences warranted by the grounds. Intuitionistic logic acquires a somewhat familiar justification but emanating from a new motivation. (shrink)

Lee Archie argued that if any truth-values are consistently assigned to a natural language conditional, where modus ponens and modus tollens are valid argument forms, and affirming the consequent is invalid, this conditional will have the same truth-conditions as a material implication. This argument is simple and requires few and relatively uncontroversial assumptions. We show that it is possible to extend Archie’s argument to three- and five-valued logics and vindicate a slightly weaker conclusion, but one that is still important: Even (...) if you do not believe in bivalence and the classical negation operator, you would still have good reasons to accept that natural language conditionals and the material implication share truth-conditions. (shrink)

In their recent paper Bi-facial truth: a case for generalized truth values Zaitsev and Shramko [7] distinguish between an ontological and an epistemic interpretation of classical truth values. By taking the Cartesian product of the two disjoint sets of values thus obtained, they arrive at four generalized truth values and consider two “semi-classical negations” on them. The resulting semantics is used to define three novel logics which are closely related to Belnap’s well-known four valued logic. A syntactic characterization (...) of these logics is left for further work. In this paper, based on our previous work on a functionally complete extension of Belnap’s logic, we present a sound and complete tableau calculus for these logics. It crucially exploits the Cartesian nature of the four values, which is reflected in the fact that each proof consists of two tableaux. The bi-facial notion of truth of Z&S is thus augmented with a bi-facial notion of proof. We also provide translations between the logics for semi-classical negation and classical logic and show that an argument is valid in a logic for semi-classical negation just in case its translation is valid in classical logic. (shrink)

I propose an approach to liar and Curry paradoxes inspired by the work of Roger Swyneshed in his treatise on insolubles (1330-1335). The keystone of the account is the idea that liar sentences and their ilk are false (and only false) and that the so-called ''capture'' direction of the T-schema should be restricted. The proposed account retains what I take to be the attractive features of Swyneshed's approach without leading to some worrying consequences Swyneshed accepts. The approach and the resulting (...) logic (called ''Swynish Logic'') are non-classical, but are consistent and compatible with many elements of the classical picture including modus ponens, modus tollens, and double-negation elimination and introduction. It is also compatible with bivalence and contravalence. My approach to these paradoxes is also immune to an important kind of revenge challenge that plagues some of its rivals. (shrink)

Suppose Alice asserts p, and the Caterpillar wants to disagree. If the Caterpillar accepts classical logic, he has an easy way to indicate this disagreement: he can simply assert ¬p. Sometimes, though, things are not so easy. For example, suppose the Cheshire Cat is a paracompletist who thinks that p ∨ ¬p fails (in familiar (if possibly misleading) language, the Cheshire Cat thinks p is a gap). Then he surely disagrees with Alice's assertion of p, but should himself be (...) unwilling to assert ¬p. So he cannot simply use the classical solution. Dually, suppose the Mad Hatter is a dialetheist who thinks that p ∧ ¬p holds (that is, he thinks p is a glut). Then he may assert ¬p, but it should not be taken to indicate that he disagrees with Alice; he doesn't. So he too can't use the classical solution. The Cheshire Cat and the Mad Hatter, then, have a common problem, and philosophers with opinions like theirs have adopted a common solution to this problem: appeal to denial. Denial, these philosophers suppose, is a speech act like assertion, but it is not to be understood as in any way reducing to assertion. Importantly, denial is something different from the assertion of a negation; this is what allows it to work even in cases where assertion of negation does not. Just as importantly, denial must express disagreement, since this is the job it's being enlisted to do. (shrink)

At first sight the Theory of Computation i) relies on a kind of mathematics based on the notion of potential infinity; ii) its theoretical organization is irreducible to an axiomatic one; rather it is organized in order to solve a problem: “What is a computation?”; iii) it makes essential use of doubly negated propositions of non-classical logic, in particular in the word expressions of the Church-Turing’s thesis; iv) its arguments include ad absurdum proofs. Under such aspects, it is like (...) many other scientific theories, in particular the first theories of both mechanical machines and heat machines. A more accurate examination of Theory of Computation shows a difference from the above mentioned theories in its essentially including an odd notion, “thesis”, to which no theorem corresponds. On the other hand, arguments of each of the other theories conclude a doubly negative predicate which then, by applying the inverse translation of the ‘negative one’, is translated into the corresponding affirmative predicate. By also taking into account three criticisms to the current Theory of Computation a rational re-formulation of it is sketched out; to Turing-Church thesis of the usual theory corresponds a similar proposition, yet connecting physical total computation functions with constructive mathematical total computation functions. -/- . (shrink)

A formal theory of oppositions and opposites is proposed on the basis of a non- Fregean semantics, where opposites are negation-forming operators that shed some new light on the connection between opposition and negation. The paper proceeds as follows. After recalling the historical background, oppositions and opposites are compared from a mathematical perspective: the first occurs as a relation, the second as a function. Then the main point of the paper appears with a calculus of oppositions, by means (...) of a non-Fregean semantics that redefines the logical values of various sorts of sentences. A num- ber of topics are then addressed in the light of this algebraic semantics, namely: how to construct value-functional operators for any logical opposition, beyond the classical case of contradiction; Blanché's "closure problem", i.e., how to find a complete structure connecting the sixteen binary sentences with one another. All of this is meant to devise an abstract theory of opposition: it encompasses the relation of consequence as subalternation, while relying upon the use of a primary "proto- negation" that turns any relatum into an opposite. This results in sentential negations that proceed as intensional operators, while negation is broadly viewed as a difference-forming operator without special constraints on it. (shrink)

Classic expression theory identified the emotional content of works of art with the feelings of their creators or recipients. This content thus appeared to be external to the work itself. Consequently, formalism declared it to be irrelevant to a work’s value. A solution to this dilemma — one which the Polish aesthetician Henryk Elzenberg was among the first to propose — was suggested by the idea that physical, sensual objects can themselves possess emotional qualities. Thanks to Bouwsma and Beardsley, this (...) concept — of expressiveness as a quality — became common in Anglo-American aesthetics from the fifties onwards. At the same time, these authors demanded that the term “expression” be expunged from the language of aesthetics. However, the widespread tendency to conceptualise the emotional content of art in terms of the expression of a certain subject (most often the artist) still requires some explanation — interpretation, rather than negation. One interpretation construes the expressiveness of works of art in terms of the expression of a fictive subject, the “work’s persona”, conceived by Elzenberg in 1950/1960. This paper discusses his concept and explains some of its more complex aspects, before addressing the emergence of a very similar concept within Anglo-American aesthetics. This concept was gradually elaborated in the seventies and eighties, but only in the nineties did it become more fully developed and widely discussed. (shrink)

Classic expression theory identified the emotional content of works of art with the feelings of the artists and the recipients. This content thus appeared to be external to the work itself. Consequently, formalism declared it to be irrelevant to a work’s value. A way out of this predicament – one which the Polish aesthetician Henryk Elzenberg (1887–1967) was among the first to propose – was suggested by the idea that physical, sensory objects can themselves possess emotional qualities. Thanks to Bouwsma (...) and Beardsley, this concept – of expressiveness as a quality – became common in Anglo-American aesthetics from the 1950s onwards. At the same time, these authors demanded that the term ‘expression’ be expunged from the language of aesthetics. But the widespread tendency to conceptualize the emotional content of art in terms of the expression of a certain subject (most often the artist) still requires some explanation – interpretation, rather than negation. One interpretation construes the expressiveness of works of art in terms of the expression of a fictitious subject, the ‘work’s persona’, conceived by Elzenberg in the 1950s and 1960s. This article discusses his concept and explains some of its more complex aspects, before addressing the emergence of a very similar concept within Anglo-American aesthetics. This concept was gradually elaborated in the 1970s and 1980s, but only in the 1990s did it become more fully developed and widely discussed. (shrink)

For the classical Geometry, in a geometrical space, all items (concepts, axioms, theorems, etc.) are totally (100%) true. But, in the real world, many items are not totally true. The NeutroGeometry is a geometrical space that has some items that are only partially true (and partially indeterminate, and partially false), and no item that is totally false. The AntiGeometry is a geometrical space that has some item that are totally (100%) false. While the Non-Euclidean Geometries [hyperbolic and elliptic geometries] (...) resulted from the total negation of only one specific axiom (Euclid’s Fifth Postulate), the AntiGeometry results from the total negation of any axiom [and in general: theorem, concept, idea etc.] and even of more axioms [theorem, concept, idea, etc.] and in general from any geometric axiomatic system (Euclid’s five postulates, Hilbert’s 20 axioms, etc.), and the NeutroAxiom results from the partial negation of any axiom (or concept, theorem, idea, etc.). Clearly, the AntiGeometry is a generalization of Non-Euclidean Geometries. (shrink)

In this chapter, I grant Jc Beall’s assertion that the best understanding of the doctrine of the incarnation posits that Christ is a contradictory being, in the sense that it has him satisfying complementary pairs of predicates. I also argue, however, that by attending to a distinction between predicate negation and sentence negation, this view can be upheld without positing any classical logical contradictions. I argue that the resulting Christological view has several advantages over Beall’s: It is (...) more conservative about avoiding contradiction, exhibits greater logical neutrality, and comports better with Christian tradition. (shrink)

This article is about a very important metaphysical concept, macrocosm/microcosm and its appearance in Doric thought which in turn influenced Socrates and Plato. But since this concept has been gainsaid and negated in recent articles and distorted by some ancient thinkers it will be necessary to conduct reconstructive surgery to restore it to its pristine condition. Hopefully, this paper will illustrate how metaphysics is done with the use of the Mind's eye, in the reading of reality that was part and (...) parcel of the Greek mind but also in understanding the ancient Greeks themselves and their culture especially in the creation of the classical republican form of government. This account will discuss what macrocosm/microcosm is, its part in the Cosmos and hence its centrality in the Natural Law and in philosophy (wisdom). Second, it will prove the concept thru another natural law principle, righteousness. Third, point out it's provenance in Doric thought. In a corollary, it points to what the impact macrocosm/microcosm has on the true meaning "to be a lover of wisdom" and its importance in the concept of theosis. More than a research/academic article, this paper is also an exposition in which it will attempt to demonstrate the use and the mechanics of this principle by using a saying of Homer and the tripartite paradigm of the family. (shrink)

The purpose of this note is to present a strong form of the liar paradox. It is strong because the logical resources needed to generate the paradox are weak, in each of two senses. First, few expressive resources required: conjunction, negation, and identity. In particular, this form of the liar does not need to make any use of the conditional. Second, few inferential resources are required. These are: (i) conjunction introduction; (ii) substitution of identicals; and (iii) the inference: From (...) ¬(p ∧ p), infer ¬ p. It is, interestingly enough, also essential to the argument that the ‘strong’ form of the diagonal lemma be used: the one that delivers a term λ such that we can prove: λ = ¬ T(⌈λ⌉); rather than just a sentence Λ for which we can prove: Λ ≡ ¬T(⌈Λ⌉). The truth-theoretic principles used to generate the paradox are these: ¬(S ∧ T(⌈¬S⌉); and ¬(¬S ∧ ¬T(⌈¬S⌉). These are classically equivalent to the two directions of the T-scheme, but they are intuitively weaker. The lesson I would like to draw is: There can be no consistent solution to the Liar paradox that does not involve abandoning truth-theoretic principles that should be every bit as dear to our hearts as the T-scheme. So we shall have to learn to live with the Liar, one way or another. (shrink)

Boolean-valued models of set theory were independently introduced by Scott, Solovay and Vopěnka in 1965, offering a natural and rich alternative for describing forcing. The original method was adapted by Takeuti, Titani, Kozawa and Ozawa to lattice-valued models of set theory. After this, Löwe and Tarafder proposed a class of algebras based on a certain kind of implication which satisfy several axioms of ZF. From this class, they found a specific 3-valued model called PS3 which satisfies all the axioms of (...) ZF, and can be expanded with a paraconsistent negation *, thus obtaining a paraconsistent model of ZF. The logic (PS3 ,*) coincides (up to language) with da Costa and D'Ottaviano logic J3, a 3-valued paraconsistent logic that have been proposed independently in the literature by several authors and with different motivations such as CluNs, LFI1 and MPT. We propose in this paper a family of algebraic models of ZFC based on LPT0, another linguistic variant of J3 introduced by us in 2016. The semantics of LPT0, as well as of its first-order version QLPT0, is given by twist structures defined over Boolean agebras. From this, it is possible to adapt the standard Boolean-valued models of (classical) ZFC to twist-valued models of an expansion of ZFC by adding a paraconsistent negation. We argue that the implication operator of LPT0 is more suitable for a paraconsistent set theory than the implication of PS3, since it allows for genuinely inconsistent sets w such that [(w = w)] = 1/2 . This implication is not a 'reasonable implication' as defined by Löwe and Tarafder. This suggests that 'reasonable implication algebras' are just one way to define a paraconsistent set theory. Our twist-valued models are adapted to provide a class of twist-valued models for (PS3,*), thus generalizing Löwe and Tarafder result. It is shown that they are in fact models of ZFC (not only of ZF). (shrink)

I develop and defend a truthmaker semantics for the relevant logic R. The approach begins with a simple philosophical idea and develops it in various directions, so as to build a technically adequate relevant semantics. The central philosophical idea is that truths are true in virtue of specific states. Developing the idea formally results in a semantics on which truthmakers are relevant to what they make true. A very natural notion of conditionality is added, giving us relevant implication. I then (...) investigate ways to add conjunction, disjunction, and negation; and I discuss how to justify contraposition and excluded middle within a truthmaker semantics. (shrink)

Data involving epistemic modals suggest that some classically valid argument forms, such as _reductio_, are invalid in natural language reasoning as they lead to modal collapses. We adduce further data showing that the classical argument forms governing the existential quantifier are similarly defective, as they lead to a _de re–de dicto_ collapse. We observe a similar problem for disjunction. But if the classical argument forms for negation, disjunction and existential quantification are invalid, what are the correct forms (...) that govern the use of these items? Our diagnosis is that epistemic modals interfere with hypothetical reasoning. We present a modal first-order logic and model theory that characterizes hypothetical reasoning with epistemic modals in a principled manner. One upshot is a sound and complete natural deduction system for reasoning with epistemic modals in first-order logic. (shrink)

Advocates of Expressivism about basically any kind of language are best-served by abandoning a traditional content-centric approach to semantic theorizing, in favor of an update-centric or dynamic approach (or so this paper argues). The type of dynamic approach developed here — in contrast to the content-centric approach — is argued to yield canonical, if not strictly classical, "explanations" of the core semantic properties of the connectives. (The cases on which I focus most here are negation and disjunction.) I (...) end the paper by describing a distinctive sense in which mental states might play a fundamental role in the practice of semantic theorizing (as I understand it), and I connect this to a distinctive account of the pragmatic function of, e.g., a normatively laden claim in discourse. (shrink)

Philosophical dialetheism, whose main exponent is Graham Priest, claims that some contradictions hold, are true, and it is rational to accept and assert them. Such a position is naturally portrayed as a challenge to the Law of Non-Contradiction (LNC). But all the classic formulations of the LNC are, in a sense, not questioned by a typical dialetheist, since she is (cheerfully) required to accept them by her own theory. The goal of this paper is to develop a formulation of the (...) Law which appears to be unquestionable, in the sense that the Priestian dialetheist is committed to accept it without also accepting something inconsistent with it, on pain of trivialism—that is to say, on pain of lapsing into the position according to which everything is the case. This will be achieved via (a) a discussion of Priest's dialetheic treatment of the notions of rejection and denial; and (b) the characterization of a negation via the primitive intuition of content exclusion. Such a result will not constitute a cheap victory for the friends of consistency. We may just learn that different things have been historically conflated under the label of 'Law of Non-Contradiction'; that dialetheists rightly attack some formulations of the Law, and orthodox logicians and philosophers have been mistaken in assimilating them to the indisputable one. (shrink)

Quasi-Nelson logic (QNL) was recently introduced as a common generalisation of intuitionistic logic and Nelson's constructive logic with strong negation. Viewed as a substructural logic, QNL is the axiomatic extension of the Full Lambek Calculus with Exchange and Weakening by the Nelson axiom, and its algebraic counterpart is a variety of residuated lattices called quasi-Nelson algebras. Nelson's logic, in turn, may be obtained as the axiomatic extension of QNL by the double negation (or involutivity) axiom, and intuitionistic logic (...) as the extension of QNL by the contraction axiom. A recent series of papers by the author and collaborators initiated the study of fragments of QNL, which correspond to subreducts of quasi-Nelson algebras. In the present paper we focus on fragments that contain the connectives forming a residuated pair (the monoid conjunction and the so-called strong Nelson implication), these being the most interesting ones from a substructural logic perspective. We provide quasi-equational (whenever possible, equational) axiomatisations for the corresponding classes of algebras, obtain twist representations for them, study their congruence properties and take a look at a few notable subvarieties. Our results specialise to the involutive case, yielding characterisations of the corresponding fragments of Nelson's logic and their algebraic counterparts. (shrink)

Various philosophers have long since been attracted to the doctrine that future contingent propositions systematically fail to be true—what is sometimes called the doctrine of the open future. However, open futurists have always struggled to articulate how their view interacts with standard principles of classical logic—most notably, with the Law of Excluded Middle. For consider the following two claims: Trump will be impeached tomorrow; Trump will not be impeached tomorrow. According to the kind of open futurist at issue, both (...) of these claims may well fail to be true. According to many, however, the disjunction of these claims can be represented as p ∨ ~p—that is, as an instance of LEM. In this essay, however, I wish to defend the view that the disjunction these claims cannot be represented as an instance of p ∨ ~p. And this is for the following reason: the latter claim is not, in fact, the strict negation of the former. More particularly, there is an important semantic distinction between the strict negation of the first claim [~] and the latter claim. However, the viability of this approach has been denied by Thomason, and more recently by MacFarlane and Cariani and Santorio, the latter of whom call the denial of the given semantic distinction “scopelessness”. According to these authors, that is, will is “scopeless” with respect to negation; whereas there is perhaps a syntactic distinction between ‘~Will p’ and ‘Will ~p’, there is no corresponding semantic distinction. And if this is so, the approach in question fails. In this paper, then, I criticize the claim that will is “scopeless” with respect to negation. I argue that will is a so-called “neg-raising” predicate—and that, in this light, we can see that the requisite scope distinctions aren’t missing, but are simply being masked. The result: a under-appreciated solution to the problem of future contingents that sees and as contraries, not contradictories. (shrink)

This paper develops a semantic solution to the puzzle of Free Choice permission. The paper begins with a battery of impossibility results showing that Free Choice is in tension with a variety of classical principles, including Disjunction Introduction and the Law of Excluded Middle. Most interestingly, Free Choice appears incompatible with a principle concerning the behavior of Free Choice under negation, Double Prohibition, which says that Mary can’t have soup or salad implies Mary can’t have soup and Mary (...) can’t have salad. Alonso-Ovalle 2006 and others have appealed to Double Prohibition to motivate pragmatic accounts of Free Choice. Aher 2012, Aloni 2018, and others have developed semantic accounts of Free Choice that also explain Double Prohibition. -/- This paper offers a new semantic analysis of Free Choice designed to handle the full range of impossibility results involved in Free Choice. The paper develops the hypothesis that Free Choice is a homogeneity effect. The claim possibly A or B is defined only when A and B are homogenous with respect to their modal status, either both possible or both impossible. Paired with a notion of entailment that is sensitive to definedness conditions, this theory validates Free Choice while retaining a wide variety of classical principles except for the transitivity of entailment. The homogeneity hypothesis is implemented in two different ways, homogeneous alternative semantics and homogeneous dynamic semantics, with interestingly different consequences. (shrink)

The meaning of definite descriptions (like ‘the King of France’, ‘the girl’, etc.) has been a central topic in philosophy and linguistics for the past century. Indefinites (‘Something is on the floor’, ‘A child sat down’, etc.) have been relatively neglected in philosophy, under the Russellian assumption that they can be unproblematically treated as existential quantifiers. However, an important tradition, drawing from Stoic logic, has pointed to patterns which suggest that indefinites cannot be treated simply as existential quantifiers. The standard (...) dynamic semantic treatment of those phenomena, however, has well-known problems with negation and disjunction. -/- In this paper I develop a new approach to (in)definites. On my theory, truth-conditions are classical. But in addition to truth-conditions, meanings comprise a second dimension of what I call bounds. It is at the level of bounds, not truth-conditions, that I locate the characteristically dynamic coordination between indefinites and definites. The resulting system thus has a classical logic. This approach avoids dynamic semantics’ logical problems, and, more generally, yields a new perspective on the relation between truth-conditional and dynamic effects in natural language. (shrink)