SearcharxivSearch

arXiv · 1911.08027

The independence of premise rule in intuitionistic set theories

Abstract

Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the corresponding independence of premise rule for finite types over $\mathbb{N}$. It is also shown that the existence property (or existential definability property) holds for statements of the form $\neg A\to \exists x^{\sigma} F(x^{\sigma})$, where the variable $x^{\sigma}$ ranges over a finite type $\sigma$. This applies in particular to Constructive Zermelo-Fraenkel Set Theory (CZF) and Intuitionistic Zermelo-Fraenkel Set Theory (IZF), two systems known not to have the general existence property. On the technical side, the paper uses the method of realizability with truth from [21] and [8] with the underlying partial combinatory algebra (pca) chosen among the total ones. A particular instance of the latter is provided by the substructure of the graph model formed by the semi computable subsets of $\mathbb{N}$, which has the advantage that it forms a set pca even in proof-theoretically weak set theories such as CZF.

Explore related subjects

Keep this discovery

BibTeXRIS

Takako Nemoto, Michael Rathjen. 2019-11-19. The independence of premise rule in intuitionistic set theories. https://arxiv.org/abs/1911.08027

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