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

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)

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

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

The paper is devoted to the contributions of Helena Rasiowa to the theory of non-classical negation. The main results of Rasiowa in this area concerns–constructive logic with strong (Nelson) negation.

Typical applications of Hintikka’s game-theoretical semantics give rise to semantic attributes—truth, falsity—expressible in the $\Sigma^{1}_{1}$-fragment of second-order logic. Actually a much more general notion of semantic attribute is motivated by strategic considerations. When identifying such a generalization, the notion of classical negation plays a crucial role. We study two languages, $L_{1}$ and $L_{2}$, in both of which two negation signs are available: $\rightharpoondown $ and $\sim$. The latter is the usual GTS negation which transposes the players’ (...) roles, while the former will be interpreted via the notion of mode. Logic $L_{1}$ extends independence-friendly logic; $\rightharpoondown $ behaves as classical negation in $L_{1}$. Logic $L_{2}$ extends $L_{1}$, and it is shown to capture the $\Sigma^{2}_{1}$-fragment of third-order logic. Consequently the classical negation remains inexpressible in $L_{2}$. (shrink)

Dialetheism is the view that some true sentences have a true negation as well. Defending dialetheism, Graham Priest argues that the correct account of negation should allow for true contradictions and \) without entailing triviality. A negation doing precisely that is said to have ‘surplus content’. Now, to defend that the correct account of negation does have surplus content, Priest advances arguments to hold that classical Boolean negation does not even make sense without begging (...) the question against the dialetheist. We shall argue that Priest’s arguments may be turned upon themselves, and that he may also be accused of begging the question against the classical logician. We then advance an argument to the effect that Priest’s account of negation falls short of satisfying his own desiderata on a correct account of a negation: a theory of negation that attempts to represent contradictions cannot coherently allow surplus content, and vice-versa, a negation allowing for surplus content bans contradiction. (shrink)

The focus of this paper are Dummett's meaning-theoretical arguments against classical logic based on consideration about the meaning of negation. Using Dummettian principles, I shall outline three such arguments, of increasing strength, and show that they are unsuccessful by giving responses to each argument on behalf of the classical logician. What is crucial is that in responding to these arguments a classicist need not challenge any of the basic assumptions of Dummett's outlook on the theory of meaning. (...) In particular, I shall grant Dummett his general bias towards verificationism, encapsulated in the slogan 'meaning is use'. The second general assumption I see no need to question is Dummett's particular breed of molecularism. Some of Dummett's assumptions will have to be given up, if classical logic is to be vindicated in his meaning-theoretical framework. A major result of this paper will be that the meaning of negation cannot be defined by rules of inference in the Dummettian framework. (shrink)

The present paper provides novel results on the model theory of Independence friendly modal logic. We concentrate on its particularly well-behaved fragment that was introduced in Tulenheimo and Sevenster (Advances in Modal Logic, 2006). Here we refer to this fragment as ‘Simple IF modal logic’ (IFML s ). A model-theoretic criterion is presented which serves to tell when a formula of IFML s is not equivalent to any formula of basic modal logic (ML). We generalize the notion of bisimulation familiar (...) from ML; the resulting asymmetric simulation concept is used to prove that IFML s is not closed under complementation. In fact we obtain a much stronger result: the only IFML s formulas admitting their classical negation to be expressed in IFML s itself are those whose truth-condition is in fact expressible in ML. (shrink)

In this study, we introduce Gentzen-type sequent calculi BDm and BDi for a modal extension and an intuitionistic modification, respectively, of De and Omori’s extended Belnap–Dunn logic BD+ with classical negation. We prove theorems for syntactically and semantically embedding BDm and BDi into Gentzen-type sequent calculi S4 and LJ for normal modal logic and intuitionistic logic, respectively. The cut-elimination, decidability, and completeness theorems for BDm and BDi are obtained using these embedding theorems. Moreover, we prove the Glivenko theorem (...) for embedding BD+ into BDi and the McKinsey–Tarski theorem for embedding BDi into BDm. (shrink)

Gentzen-type sequent calculi GBD+, GBDe, GBD1, and GBD2 are respectively introduced for De and Omori’s axiomatic extensions BD+, BDe, BD1, and BD2 of Belnap–Dunn logic by adding classical negation. These calculi are constructed based on a small modification of the original characteristic axiom scheme for negated implication. Theorems for syntactically and semantically embedding these calculi into a Gentzen-type sequent calculus LK for classical logic are proved. The cut-elimination, decidability, and completeness theorems for these calculi are obtained using (...) these embedding theorems. Similar results excluding cut-elimination results are also obtained for alternative Gentzen-type sequent calculi gBD+, gBDe, gBD1, and gBD2 for BD+, BDe, BD1, and BD2, respectively. These alternative calculi are constructed based on the original characteristic axiom scheme for negated implication. (shrink)

We investigate two large families of logics, differing from each other by the treatment of negation. The logics in one of them are obtained from the positive fragment of classical logic (with or without a propositional constant ff for “the false”) by adding various standard Gentzen-type rules for negation. The logics in the other family are similarly obtained from LJ+, the positive fragment of intuitionistic logic (again, with or without ff). For all the systems, we provide simple (...) semantics which is based on non-deterministic four-valued or three-valued structures, and prove soundness and completeness for all of them. We show that the role of each rule is to reduce the degree of non-determinism in the corresponding systems. We also show that all the systems considered are decidable, and our semantics can be used for the corresponding decision procedures. Most of the extensions of LJ+ (with or without ff) are shown to be conservative over the underlying logic, and it is determined which of them are not. (shrink)

In this study, an extended paradefinite logic with classical negation (EPLC), which has the connectives of conflation, paraconsistent negation, classical negation, and classical implication, is introduced as a Gentzen-type sequent calculus. The logic EPLC is regarded as a modification of Arieli, Avron, and Zamansky’s ideal four-valued paradefinite logic (4CC) and as an extension of De and Omori’s extended Belnap–Dunn logic with classical negation (BD+) and Avron’s self-extensional four-valued paradefinite logic (SE4). The completeness, (...) cut-elimination, and decidability theorems for EPLC are proved and EPLC is shown to be embeddable into classical logic. The strong equivalence substitution property and the admissibilities of the rules of negative symmetry, contraposition, and involution are shown for EPLC. Some alternative simple Gentzen-type sequent calculi, which are theorem-equivalent to EPLC, are obtained via these characteristic properties. (shrink)

We present an axiomatization of the non-associative Lambek calculus extended with classical negation for which the frame semantics with the classical interpretation of negation is sound and complete.

Subintuitionistic (propositional) logics are those in a standard intuitionistic language that result by weakening the frame conditions of the Kripke semantics for intuitionistic logic. In this paper we consider two negation expansions of subintuitionistic logic, one by classical negation and the other by what has been dubbed “empirical” negation. We provide an axiomatization of each expansion and show them sound and strongly complete. We conclude with some final remarks, including avenues for future research.

A number of different kinds of negation and negation of negation are developed in Indian thought, from ancient religious texts to classical philosophy. The paper explores the Mīmāṃsā, Nyāya, Jaina and Buddhist theorizing on the various forms and permutations of negation, denial, nullity, nothing and nothingness, or emptiness. The main thesis argued for is that in the broad Indic tradition, negation cannot be viewed as a mere classical operator turning the true into the (...) false, nor reduced to the mainstream Boolean dichotomy: 1 versus 0. Special attention is given to how contradiction is handled in Jaina and Buddhist logic. (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)

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

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)

It is usually accepted in the literature that negation is a contradictory-forming operator and that two statements are contradictories if and only if it is logically impossible for both to be true and logically impossible for both to be false. These two premises have been used by Hartley Slater [Slater, 1995] to argue that paraconsistent negation is not a “real” negation because a sentence and its paraconsistent negation can be true together. In this paper we claim (...) that a counterpart of Slater´s argument can be directed against the negation operator of classical logic. Carnap’s discovery that there are models of classical propositional logic with non-standard or non-normal interpretations of the connectives will be used to build such an argument. One such non-normal valuation which can be added to the set of classically admissible valuations without altering the set of theorems or the set of valid consequences assigns true to every well-formed formula and, therefore, assigns a designated value to every formula and its negation. We ponder the consequences of these arguments for the claims that paraconsistent negations are not genuine negations and that the negation of classical logic is a contradictory-forming operator. (shrink)

We investigate mathematical structures that provide natural semantics for families of (quantified) non-classical logics featuring special unary connectives, known as recovery operators, that allow us to ‘recover’ the properties of classical logic in a controlled manner. These structures are known as topological Boolean algebras, which are Boolean algebras extended with additional operations subject to specific conditions of a topological nature. In this study, we focus on the paradigmatic case of negation. We demonstrate how these algebras are well-suited (...) to provide a semantics for some families of paraconsistent Logics of Formal Inconsistency and paracomplete Logics of Formal Undeterminedness. These logics feature recovery operators used to earmark propositions that behave ‘classically’ when interacting with non-classical negations. Unlike traditional semantical investigations, which are carried out in natural language (extended with mathematical shorthand), our formal meta-language is a system of higher-order logic (HOL) for which automated reasoning tools exist. In our approach, topological Boolean algebras are encoded as algebras of sets via their Stone-type representation. We use our higher-order meta-logic to define and interrelate several transformations on unary set operations, which naturally give rise to a topological cube of opposition. Additionally, our approach enables a uniform characterization of propositional, first-order and higher-order quantification, including restrictions to constant and varying domains. With this work, we aim to make a case for the utilization of automated theorem proving technology for conducting computer-supported research in non-classical logics. All the results presented in this paper have been formally verified, and in many cases obtained, using the Isabelle/HOL proof assistant. (shrink)

Here is one argument against realism. (1) Realists are committed to the classical rules for negation. But (2) legitimate rules of inference must conserve evidence. And (3) the classical rules for negation do not conserve evidence. So (4) realism is wrong. Most realists reject 2. But it has recently been argued that if we allow denied sentences as premisses and conclusions in inferences we will be able to reject 3. And this new argument against 3 generates (...) a new response to the antirealist argument: keep 1 and 2, avoiding 4 by rejecting 3. My aim in this paper is to see how much work in the fight against anti-realism this new response can really do. I argue that there is a powerful objection to the response: 2 is in tension with the claim that denied sentences can be premisses and conclusions in inferences. But I show that, even given this objection, the new response has an important role to play. (shrink)

New propositional and first-order paraconsistent logics (called L ω and FL ω , respectively) are introduced as Gentzen-type sequent calculi with classical and paraconsistent negations. The embedding theorems of L ω and FL ω into propositional (first-order, respectively) classical logic are shown, and the completeness theorems with respect to simple semantics for L ω and FL ω are proved. The cut-elimination theorems for L ω and FL ω are shown using both syntactical ways via the embedding theorems and (...) semantical ways via the completeness theorems. (shrink)

The general aim of this article is to study the negation fragment of classical logic within the framework of contemporary (Abstract) Algebraic Logic. More precisely, we shall find the three classes of algebras that are canonically associated with a logic in Algebraic Logic, i.e. we find the classes |$\textrm{Alg}^*$|⁠, |$\textrm{Alg}$| and the intrinsic variety of the negation fragment of classical logic. In order to achieve this, firstly, we propose a Hilbert-style axiomatization for this fragment. Then, we (...) characterize the reduced matrix models and the full generalized matrix models of this logic. Also, we classify the negation fragment in the Leibniz and Frege hierarchies. (shrink)

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)

An extension of intuitionism to empirical discourse, a project most seriously taken up by Dummett and Tennant, requires an empirical negation whose strength lies somewhere between classical negation (‘It is unwarranted that. . . ’) and intuitionistic negation (‘It is refutable that. . . ’). I put forward one plausible candidate that compares favorably to some others that have been propounded in the literature. A tableau calculus is presented and shown to be strongly complete.

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 problems of the meaning and function of negation are disentangled from ontological issues with which they have been long entangled. The question of the function of negation is the crucial issue separating relevant and paraconsistent logics from classical theories. The function is illuminated by considering the inferential role of contradictions, contradiction being parasitic on negation. Three basic modelings emerge: a cancellation model, which leads towards connexivism, an explosion model, appropriate to classical and intuitionistic theories, (...) and a constraint model, which includes relevant theories. These three modelings have been seriously confused in the modern literature: untangling them helps motivate the main themes advanced concerning traditional negation and natural negation. Firstly, the dominant traditional view, except around scholastic times when the explosion view was in ascendency, has been the cancellation view, so that the mainstream negation of much of traditional logic is distinctively nonclassical. Secondly, the primary negation determinable of natural negation is ·relevant negation. In order to picture relevant negation the traditional idea of negation as otherthanness is progressive) refined, to nonexclusive restricted otherthanness. Several pictures result, a reversal picture, a debate model, a record cabinet (or files of the universe) model which help explain relevant negation. Two appendices are attached, one on negation in Hegel and the Marxist tradition, the other on Wittgenstein's treatment of negation and contradiction. (shrink)

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

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.

Michael Dummett and Dag Prawitz have argued that a constructivist theory of meaning depends on explicating the meaning of logical constants in terms of the theory of valid inference, imposing a constraint of harmony on acceptable connectives. They argue further that classical logic, in particular, classical negation, breaks these constraints, so that classical negation, if a cogent notion at all, has a meaning going beyond what can be exhibited in its inferential use. I argue that (...) Dummett gives a mistaken elaboration of the notion of harmony, an idea stemming from a remark of Gerhard Gentzen's. The introduction-rules are autonomous if they are taken fully to specify the meaning of the logical constants, and the rules are harmonious if the elimination-rule draws its conclusion from just the grounds stated in the introduction-rule. The key to harmony in classical logic then lies in strengthening the theory of the conditional so that the positive logic contains the full classical theory of the conditional. This is achieved by allowing parametric formulae in the natural deduction proofs, a form of multiple-conclusion logic. (shrink)

Of the various accounts of negation that have been offered by logicians in the history of Western logic, that of negation as cancellation is a very distinctive one, quite different from the explosive accounts of modern "classical" and intuitionist logics, and from the accounts offered in standard relevant and paraconsistent logics. Despite its ancient origin, however, a precise understanding of the notion is still wanting. The first half of this paper offers one. Both conceptually and historically, the (...) account of negation as cancellation is intimately connected with connexivist principles such as ¬( ¬). Despite this, standard connexivist logics incorporate quite different accounts of negation. The second half of the paper shows how the cancellation account of negation of the first part gives rise to a semantics for a simple connexivist logic. (shrink)

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

Four weak positional calculi are constructed and examined. They refer to the use of the connective of negation within the scope of the positional connective “R” of realization. The connective of negation may be fully classical, partially analogical or independent from the classical, truth-functional negation. It has been also proved that the strongest system, containing fully classical connective of negation, is deductively equivalent to the system MR from Jarmużek and Pietruszczak.

Last year (2005) marked the 100th anniversary of the publication of Russell’s classic ‘On denoting’. It should not cast any shadow on that great work to note that the problems it provided solutions to are still the subject of controversy. Two of those problems involved noun phrases (NPs) which fail to denote. Russell’s examples (1a) and (1b) (1) a. The king of France is bald. b. The king of France is not bald. are puzzling because they have the form of (...) simple contradictories, and yet we are not inclined to say either one is true. Example (2) (2) Pegasus does not exist. is even more problematic; the lack of denotation for Pegasus, which makes the sentence true, also seems to rob it of a meaningful constituent. Once the king of France is unpacked according to Russell’s analysis, (1b) is revealed to be ambiguous. It’s logical forms are given in (3). (3) a. ∃x[Kx ∧ ∀y[Ky ↔ y=x] ∧ ¬Bx] b. ¬∃x[Kx ∧ ∀y[Ky ↔ y=x] ∧ Bx] (3a) says that there is a unique (French) king who is not bald (obviously false), but (3b), the logical contradictory of (1a) says that it is not the case that there is a unique king who is bald (which is true). We can apply the analysis to sentence (2) once we recognize Pegasus as a concealed definite description, e.g. the winged horse of Greek mythology. (2) can then be unpacked as (4) (4) ¬∃x[Wx ∧ ∀y[Wy ↔ y=x]] which seems both meaningful and true, as required. Problems solved. Well, not quite. Strawson (1950) challenged the first solution above, arguing that neither (1a) nor (1b) could be used to assert the existence of a king of France. Rather, use of such sentences presupposes the existence of a king of France, and failing that existence, neither of (1a) or (1b) could be used to make either a true or a false statement – in Strawson’s words, “the question of whether it’s true or false simply doesn’t arise” (Strawson 1950, 330).1 In an extended series of essays, and one book, Jay Atlas (1977, 1978, 1979, 1989, 2004) has taken issue with the work of both Russell and Strawson.. (shrink)

This paper is devoted to a consequence relation combining the negation of Classical Logic ) and a paraconsistent negation based on Graham Priest’s Logic of Paradox ). We give a number of natural desiderata for a logic \ that combines both negations. They are motivated by a particular property-theoretic perspective on paraconsistency and are all about warranting that the combining logic has the same characteristics as the combined logics, without giving up on the radically paraconsistent nature of (...) the paraconsistent negation. We devise the logic \ by means of an axiomatization and three equivalent semantical characterizations. By showing that this logic is maximally paraconsistent, we prove that \ is the only logic satisfying all postulated desiderata. Finally we show how the logic’s infinite-valued semantics permits defining different types of entailment relations. (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)

The present essay includes six thematically connected papers on negation in the areas of the philosophy of logic, philosophical logic and metaphysics. Each of the chapters besides the first, which puts each the chapters to follow into context, highlights a central problem negation poses to a certain area of philosophy. Chapter 2 discusses the problem of logical revisionism and whether there is any room for genuine disagreement, and hence shared meaning, between the classicist and deviant's respective uses of (...) 'not'. If there is not, revision is impossible. I argue that revision is indeed possible and provide an account of negation as contradictoriness according to which a number of alleged negations are declared genuine. Among them are the negations of FDE and a wide family of other relevant logics, LP, Kleene weak and strong 3-valued logics with either "exclusion" or "choice" negation, and intuitionistic logic. Chapter 3 discusses the problem of furnishing intuitionistic logic with an empirical negation for adequately expressing claims of the form 'A is undecided at present' or 'A may never be decided' the latter of which has been argued to be intuitionistically inconsistent. Chapter 4 highlights the importance of various notions of consequence-as-s-preservation where s may be falsity, indeterminacy or some other semantic value, in formulating rationality constraints on speech acts and propositional attitudes such as rejection, denial and dubitability. Chapter 5 provides an account of the nature of truth values regarded as objects. It is argued that only truth exists as the maximal truthmaker. The consequences this has for semantics representationally construed are considered and it is argued that every logic, from classical to non-classical, is gappy. Moreover, a truthmaker theory is developed whereby only positive truths, an account of which is also developed therein, have truthmakers. Chapter 6 investigates the definability of negation as "absolute" impossibility, i.e. where the notion of necessity or possibility in question corresponds to the global modality. The modality is not readily definable in the usual Kripkean languages and so neither is impossibility taken in the broadest sense. The languages considered here include one with counterfactual operators and propositional quantification and another bimodal language with a modality and its complementary. Among the definability results we give some preservation and translation results as well. (shrink)

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

In this paper, a family of paraconsistent propositional logics with constructive negation, constructive implication, and constructive co-implication is introduced. Although some fragments of these logics are known from the literature and although these logics emerge quite naturally, it seems that none of them has been considered so far. A relational possible worlds semantics as well as sound and complete display sequent calculi for the logics under consideration are presented.