SearcharxivSearch

arXiv · 2101.01166

Aletheia, double negation and negation

Abstract

The definition of negation has to be referred to the totality of a theory and at last to what is defined as the organization of a scientific theory; in other words, the definition of negation is of a structural kind, rather than of an objective kind or a subjective kind. The paper starts by remarking that the ancient Greek word for truth was aletheia, which is a double negation, i.e. unveiling. Not before the 1968 the double negation law was re-evaluated, since it was recognized that its failure represents more appropriately than the failure of of excluded middle law the borderline between classical logic and almost all non-classical kinds of logic. Moreover, the failure of this law is easily recognized within a scientific text; this fact allows a new kind of logical analysis of a text. As an example, the analysis of Kolmogorov 1932 paper shows that he reasoned according to arguments of non-classical logic about the foundations of the intuitionist logic. The negation is defined as a unary operation which, under the problem of deciding whether a doubly negated proposition is equal to the corresponding affirmative proposition or not, leads to a subdivision into classical logic and intuitionist logic.

Explore related subjects

Keep this discovery

BibTeXRIS

Antonino Drago. 2021-01-04. Aletheia, double negation and negation. https://arxiv.org/abs/2101.01166

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO