Search arXivSearch

arXiv · 1104.3077

Projective sets, intuitionistically

Abstract

We study `definable' subsets of Baire space $\mathcal{N}$. The logic of our arguments is intuitionistic and we use L.E.J.~Brouwer's Thesis on bars in $\mathcal{N}$ and his continuity axioms. We avoid the operation of taking the complement of a subset of $\mathcal{N}$. A subset of $\mathcal{N}$ is $\mathbf{\Sigma}^1_1$ or: analytic if it is the projection of a closed subset of $\mathcal{N}$. Important $\mathbf{\Sigma}^1_1$ set are the set of the codes of all closed and located subsets of $\mathcal{N}$ that are positively uncountable and the set of the codes of all located and closed subsets of $\mathcal{N}$ containing at least one member coding a (positively) infinite subset of $\mathbb{N}$. A subset of $\mathcal{N}$ is strictly analytic if it is the projection of a closed and located subset of $\mathcal{N}$. Brouwer's Thesis on bars in $\mathcal{N}$ proves separation and boundedness theorems for strictly analytic subsets of $\mathcal{N}$. A subset of $\mathcal{N}$ is $\mathbf{\Pi}^1_1$ or: co-analytic if it is the co-projection of an open subset of $\mathcal{N} \times \mathcal{N}=\mathcal{N}$. There is no symmetry between analytic and co-analytic sets like in classical descriptive set theory. An important $\mathbf{\Pi}^1_1$ set is the set of the codes of all closed and located subsets of $\mathcal{N}$ all of whose members code an almost-finite subset of $\mathbb{N}$. The set of the codes of closed and located subsets of $\mathcal{N}$ that are almost-countable, or, equivalently, \{reducible in Cantor's sense, is treated at some length. This set is probably not $\mathbf{\Pi}^1_1$. The projective hierarchy collapses: every (positively) projective set is $\mathbf{\Sigma}^1_2$: the projection of a co-analytic subset of $\mathcal{N}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Wim Veldman. 2011-04-15. Projective sets, intuitionistically. https://doi.org/10.13140/rg.2.2.21225.80484

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