SearcharxivSearch

arXiv · 1110.2430

What is the theory ZFC without power set?

Abstract

We show that the theory ZFC-, consisting of the usual axioms of ZFC but with the power set axiom removed-specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every set can be well-ordered-is weaker than commonly supposed and is inadequate to establish several basic facts often desired in its context. For example, there are models of ZFC- in which $\omega_1$ is singular, in which every set of reals is countable, yet $\omega_1$ exists, in which there are sets of reals of every size $\aleph_n$, but none of size $\aleph_\omega$, and therefore, in which the collection axiom sceme fails; there are models of ZFC- for which the Los theorem fails, even when the ultrapower is well-founded and the measure exists inside the model; there are models of ZFC- for which the Gaifman theorem fails, in that there is an embedding $j:M\to N$ of ZFC- models that is $\Sigma_1$-elementary and cofinal, but not elementary; there are elementary embeddings $j:M\to N$ of ZFC- models whose cofinal restriction $j:M\to \bigcup j``M$ is not elementary. Moreover, the collection of formulas that are provably equivalent in ZFC- to a $\Sigma_1$-formula or a $\Pi_1$-formula is not closed under bounded quantification. Nevertheless, these deficits of ZFC- are completely repaired by strengthening it to the theory $ZFC^-$, obtained by using collection rather than replacement in the axiomatization above. These results extend prior work of Zarach.

Explore related subjects

Keep this discovery

BibTeXRIS

Victoria Gitman, Joel David Hamkins, Thomas A. Johnstone. 2011-10-11. What is the theory ZFC without power set?. https://arxiv.org/abs/1110.2430

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