Search arXivSearch

arXiv · 2101.10313

Calibrating the negative interpretation

Abstract

The minimum classical extension S$^{+g}$ of a classically sound theory S based on intuitionistic logic, defined by adding to S the Gentzen negative interpretations of its mathematical axioms, contains a faithful translation S$^g$ of the classical version S + (--A -> A) of S. S$^g$ may be called the classical content of S. First and second order intuitionistic arithmetic contain their classical contents, but intuitionistic recursive analysis cannot prove the negative interpretation of its quantifier-free countable choice axiom. Variants of Kuroda's double negation shift principle (including the G\"odel-Dyson-Kreisel axiom equivalent to the weak completeness of intuitionistic predicate logic), and doubly negated characteristic function principles, provide neat characterizations of the minimum classical extensions of classically sound subsystems of Kleene's intuitionistic analysis I. Two-sorted basic constructive recursive mathematics contains its classical content. Bishop's constructive analysis has the same classical content as the neutral subsystem B of Kleene's I. By a result of Vafeiadou, minimum classical extensions of consistent, classically unsound theories (such as I) depend essentially on omega-models of their classically consistent subtheories.

Explore related subjects

Keep this discovery

BibTeXRIS

Joan Rand Moschovakis. 2021-01-25. Calibrating the negative interpretation. https://arxiv.org/abs/2101.10313

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