The operators of first-order logic, including negation, operate on whole formulae. This makes it unsuitable as a tool for the formal analysis of reasoning with non-sentential forms of negation such as predicate term negation. We extend its language with negation operators whose scope is more narrow than an atomic formula. Exploiting the usefulness of subatomic proof-theoretic considerations for the study of subatomic inferential structure, we define intuitionistic subatomic natural deduction systems which have several subatomic operators and an additional operator for (...) formula negation at their disposal. We establish normalization and subexpression property results for the systems. The normalization results allow us to formulate a proof-theoretic semantics for formulae composed of the subatomic operators. We illustrate the systems with applications to reasoning with combinations of sentential negation, predicate term negation, subject term negation, and antonymy. (shrink)

In this paper, Graham Priest’s understanding of dialetheism, the view that there exist true contradictions, is discussed, and various kinds of metaphysical dialetheism are distinguished between. An alternative to dialetheism is presented, namely a thesis called ‘dimathematism’. It is pointed out that dimathematism enables one to escape a slippery slope argument for dialetheism that has been put forward by Priest. Moreover, dimathematism is presented as a thesis that is helpful in rejecting the claim that logic is a normative discipline.

There are two natural ways of thinking about negation: (i) as a form of complementation and (ii) as an operation of reversal, or inversion (to deny that p is to say that things are “the other way around”). A variety of techniques exist to model conception (i), from Euler and Venn diagrams to Boolean algebras. Conception (ii), by contrast, has not been given comparable attention. In this note we outline a twofold geometric proposal, where the inversion metaphor is understoood as (...) involving a rotation o a reflection, respectively. These two options are equivalent in classical two-valued logic but they differ significantly in many-valued logics. Here we show that they correspond to two basic sorts of negation operators—Post’s and Kleene’s—and we provide a simple group-theoretic argument demonstrating their generative power. (shrink)

Frame semantics for negation on the Australian Plan accommodates many different negations, but it falls short on accommodating subminimal negation when the language contains conjunction and disjunction. In this paper, I will present a multi-relational frame semantics –multi-incompatibility frame semantics– that can accommodate subminimal negation. I will first argue that multi-incompatibility frames are in accordance with the philosophical motivations behind negation on the Australian Plan, namely its modal and exclusion-expressing nature. Then, I will prove the soundness and completeness results of (...) a subminimal logic that consists of the multi-incompatibility semantics and a proof system with operational rules that characterize subminimal negation, conjunction and disjunction. Lastly, I will prove some key correspondence theorems that relate frame conditions to certain principles that are associated with stronger negations, which will give rise to a new kite of negations that includes subminimal negation. (shrink)

There is a widely held view that visual representations (images) do not depict negation, for example, as expressed by the sentence, “the train is not coming.” The present study focuses on the real-world visual representations of photographs and comic (manga) illustrations and empirically challenges the question of whether humans and machines, that is, modern deep neural networks, can recognize visual representations as expressing negation. By collecting data on the captions humans gave to images and analyzing the occurrences of negation phrases, (...) we show some evidence that humans recognize certain images as expressing negation. Furthermore, based on this finding, we examined whether or not humans and machines can classify novel images as expressing negation. The humans were able to correctly classify images to some extent, as expected from the analysis of the image captions. On the other hand, the machine learning model of image processing was only able to perform this classification at about the chance level, not at the same level of performance as the human. Based on these results, we discuss what makes humans capable of recognizing negation in visual representations, highlighting the role of the background commonsense knowledge that humans can exploit. Comparing human and machine learning performances suggests new ways to understand human cognitive abilities and to build artificial intelligence systems with more human-like abilities to understand logical concepts. (shrink)

Ein theoretischer Begriff erhält seine Bedeutung aus einer Reihe von bedeutungskonstitutiven oder "analytischen" Sätzen der betreffenden Theorie. Die Bedeutungen der theoretischen Begriffe können sich ändern, wenn sich die Theorien ändern. Nach einer Diskussion von Kant und Frege schlage ich eine weitgehend quineanische Interpretation von Analytizität vor, ohne jedoch die Quine'sche Bedeutungsskepsis zu übernehmen. Ein Satz einer bestimmten Theorie in einer bestimmten Sprache wird analytisch genannt, wenn die Revision der Theorie, so dass dieser Satz verloren geht, die Aufgabe des gegebenen sprachlichen (...) (oder alternativ: des gegebenen theoretischen) Rahmens mit sich bringt. Diese Lösung des Problems der Definition von Analytizität gründet auf den intuitiven Urteilen der Mitglieder einer Sprachgemeinschaft über die Identität von Sprachen oder Theorien. (shrink)

We consider an example of four valued semantics partially inspired by quantum computations and negation-like operations occurred therein. In particular we consider a representation of so called square root of negation within this four valued semantics as an operation which acts like a cycling negation. We define two variants of logical matrices performing different orders over the set of truth values. Purely formal logical result of our study consists in axiomatizing the logics of defined matrices as the systems of binary (...) consequence relation and proving correctness and completeness theorems for these deductive systems. (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)

Issues about information spring up wherever one scratches the surface of logic. Here is a case that raises delicate issues of 'factual' versus 'procedural' information, or 'statics' versus 'dynamics'. What does intuitionistic logic, perhaps the earliest source of informational and procedural thinking in contemporary logic, really tell us about information? How does its view relate to its 'cousin' epistemic logic? We discuss connections between intuitionistic models and recent protocol models for dynamic-epistemic logic, as well as more general issues that emerge.