Completions of countable non-standard models of Q

Peter Laubenheimer; Thomas Schick; Ulrich Stuhler

Home/Archive/arXiv

arXiv · math/0604466

Completions of countable non-standard models of Q

Peter Laubenheimer·Thomas Schick·Ulrich Stuhler

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this note, we study non-standard models of the rational numbers with countably many elements. These are ordered fields, and so it makes sense to complete them, using non-standard Cauchy sequences. The main result of this note shows that these completions are real closed, i.e. each positive number is a square, and each polynomial of odd degree has a root. This way, we give a direct proof of a consequence of a theorem of Hauschild. In a previous version of this note, not being aware of these results, we missed to mention this reference. We thank Matthias Aschenbrenner for pointing out this and related work. We also give some information about the set of real parts of the finite elements of such completions -about the more interesting results along this we have been informed by Matthias Aschenbrenner. The main idea to achieve the results relies on a way to describe real zeros of a polynomial in terms of first order logic. This is achieved by carefully using the sign changes of such a polynomial.

Explore related subjects

math.LO math.RA

Keep this discovery

BibTeX RIS

Peter Laubenheimer, Thomas Schick, Ulrich Stuhler. 2007-02-21. Completions of countable non-standard models of Q. https://arxiv.org/abs/math/0604466

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↗