Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1402.6130

Structures Associated with Real Closed Fields and the Axiom of Choice

Merlin Carl
View original source ↗Read source document ↗Export metadata ↓

Abstract

An integer part I of a real closed field K is a discretely ordered subring with minimal element 1 such that, for every x in K, I contains some i such that x is between i and i+1 in the ordering of K. Mourgues and Ressayre showed that every real closed field has an integer part. Their construction implicitely uses the axiom of choice. We show that the axiom of choice is actually necessary to obtain the result by constructing a transitive model of ZF (i.e. set theory without the axiom of choice) which contains a real closed field without an integer part. Then we analyze some cases where the axiom of choice is not necessary for obtaining an integer part. An integer part I of a real closed field K is a discretely ordered subring of K with minimal positive element 1 such that, for every x in K, I contains some i such that x is between i and i+1 in the ordering of K. Mourgues and Ressayre showed that every real closed field has an integer part. Their construction implicitly uses the axiom of choice. We show that the axiom of choice is actually necessary to obtain the result by constructing a transitive model of ZF (i.e. set theory without the axiom of choice) which contains a real closed field without an integer part. Then we analyze some cases where the axiom of choice is not necessary for obtaining an integer part. On the way, we demonstrate that a class of questions containing the question whether the axiom of choice is necessary for the proof of a certain ZFC-theorem is algorithmically undecidable. We further apply the methods to show that it is independent of ZF whether every real closed field has a value group section and a residue field section. This also sheds some light on the possibility to effectivize constructions of integer parts.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Merlin Carl. 2014-02-25. Structures Associated with Real Closed Fields and the Axiom of Choice. https://doi.org/10.36045/bbms%2F1473186514

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗