12 The Complete, Ordered Field of Real Numbers

2015 ◽  
pp. 111-120
Keyword(s):  
Real Numbers ◽  
Ordered Field

The ordered field of real numbers and logics with Malitz quantifiers

1985 ◽  
Vol 50 (2) ◽  
pp. 380-389 ◽  
Author(s):  
Andreas Rapp
Keyword(s):  
Real Numbers ◽  
Ordered Field

AbstractLet ℜ = (R, + R,…) be the ordered field of real numbers. It will be shown that the -theory of ℜ is decidable, where denotes the Malitz quantifier of order n in the ℵ1-interpretation.

Generalization of Hölder's Theorem to Ordered Modules

1969 ◽  
Vol 21 ◽  
pp. 149-157 ◽  
Author(s):  
T. M. Viswanathan
Keyword(s):  
Sufficient Conditions ◽  
Open Interval ◽  
Order Structure ◽  
Real Numbers ◽  
Ordered Group ◽  
Quotient Field ◽  
Interval Topology ◽  
Ordered Field ◽  
Topological Completion ◽  
Necessary And Sufficient

Hölder's theorem on archimedean groups states:An ordered (abelian) group G is order isomorphic to an ordered subgroup of the ordered group R of real numbers if and only if it is archimedean.We comprehend this theorem in the following setting: G is a Z-module and Ris the completion with respect to the open interval topology of the ordered field Q; Qitself is the ordered quotient field of the ordered domain Z.Rephrasing the situation, we raise the following question: We start with a fully ordered domain A,let Kbe its ordered quotient field. We endow Kwith the open interval topology and consider , the topological completion of K. Is it possible to impose a compatible order structure on and if this can be done, when can we say that an ordered A-module Mis order isomorphic to an ordered A-submodule of ? In Theorem 3.1, we obtain a set of necessary and sufficient conditions for this isomorphism to hold.

Set-theoretical basis for real numbers

1950 ◽  
Vol 15 (4) ◽  
pp. 241-247
Author(s):  
Hao Wang
Keyword(s):  
Upper Bound ◽  
Theoretical Basis ◽  
The Other ◽  
Real Numbers ◽  
Full Generality ◽  
Ordered Field ◽  
Other Hand

In [1] we have considered a certain system L and shown that although its axioms are considerably weaker than those of [2], it suffices for purposes of the topics covered in [2]. The purpose of the present paper is to consider the system L more carefully and to show that with suitably chosen definitions for numbers, the ordinary theory of real numbers is also obtainable in it. For this purpose, we shall indicate that we can prove in L a certain set of twenty axioms used by Tarski which are sufficient for the arithmetic of real numbers and are to the effect that real numbers form a complete ordered field. Indeed, we cannot prove in L all Tarski's twenty axioms in their full generality. One of them, stating in effect that every bounded class of real numbers possesses a least upper bound, can only be proved as a metatheorem which states that every bounded nameable class of real numbers possesses a least upper bound. However, all the other nineteen axioms can be proved in L without any modification.This result may be of some interest because the axioms of L are considerably weaker than those commonly employed for the same purpose. In L variables need to take as values only classes each of whose members has no more than two members. In other words, only classes each with no more than two members are to be elements. On the other hand, it is usual to assume for the purpose of natural arithmetic that all finite classes are elements, and, for the purpose of real arithmetic, that all enumerable classes are elements.

COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS

2017 ◽  
Vol 82 (1) ◽  
pp. 137-150 ◽  
Author(s):  
GREGORY IGUSA ◽  
JULIA F. KNIGHT ◽  
NOAH DAVID SCHWEBER
Keyword(s):  
Analytic Function ◽  
Real Numbers ◽  
Computing Power ◽  
The Real ◽  
The Third ◽  
Ordered Field ◽  
Image Position

AbstractIn [8], the third author defined a reducibility $\le _w^{\rm{*}}$ that lets us compare the computing power of structures of any cardinality. In [6], the first two authors showed that the ordered field of reals ${\cal R}$ lies strictly above certain related structures. In the present paper, we show that $\left( {{\cal R},exp} \right) \equiv _w^{\rm{*}}{\cal R}$. More generally, for the weak-looking structure ${\cal R}$ℚ consisting of the real numbers with just the ordering and constants naming the rationals, all o-minimal expansions of ${\cal R}$ℚ are equivalent to ${\cal R}$. Using this, we show that for any analytic function f, $\left( {{\cal R},f} \right) \equiv _w^{\rm{*}}{\cal R}$. (This is so even if $\left( {{\cal R},f} \right)$ is not o-minimal.)

scholarly journals ABSTRACT REAL NUMBERS

2019 ◽  
Vol 1 (1) ◽  
Author(s):  
Soeparna Darmawijaya
Keyword(s):  
Real Numbers ◽  
Rational Field ◽  
Ordered Field ◽  
Positive Elements

In this paper we represent a result of our study in field of analysis , that is, an abstraction of the system of real numbers. We start by defining a set of positive elements in a countable infinite (denumerable) field and, hence, we obtain a linearly ordered field which we call a field of rational elements or a rational field. After that we may introduce irrationals elements in our rational field. And, at last we have a system of real abstract numbers.

COMPARING TWO VERSIONS OF THE REALS

2016 ◽  
Vol 81 (3) ◽  
pp. 1115-1123
Author(s):  
G. IGUSA ◽  
J. F. KNIGHT
Keyword(s):  
Residue Field ◽  
Real Closed Field ◽  
Closed Field ◽  
Real Numbers ◽  
Computing Power ◽  
Ordered Field ◽  
Image Position ◽  
Recursively Saturated

AbstractSchweber [10] defined a reducibility that allows us to compare the computing power of structures of arbitrary cardinality. Here we focus on the ordered field ${\cal R}$ of real numbers and a structure ${\cal W}$ that just codes the subsets of ω. In [10], it was observed that ${\cal W}$ is reducible to ${\cal R}$. We prove that ${\cal R}$ is not reducible to ${\cal W}$. As part of the proof, we show that for a countable recursively saturated real closed field ${\cal P}$ with residue field k, some copy of ${\cal P}$ does not compute a copy of k.

Relative randomness and real closed fields

2005 ◽  
Vol 70 (1) ◽  
pp. 319-330 ◽  
Author(s):  
Alexander Raichev
Keyword(s):  
Real Number ◽  
Real Closed Field ◽  
Closed Field ◽  
Real Numbers ◽  
The Real ◽  
Real Closed Fields ◽  
Ordered Field ◽  
Closed Fields ◽  
Master's Thesis ◽  
National University

AbstractWe show that for any real number, the class of real numbers less random than it, in the sense of rK-reducibility, forms a countable real closed subfield of the real ordered field. This generalizes the well-known fact that the computable reals form a real closed field.With the same technique we show that the class of differences of computably enumerable reals (d.c.e. reals) and the class of computably approximable reals (c.a. reals) form real closed fields. The d.c.e. result was also proved nearly simultaneously and independently by Ng (Keng Meng Ng, Master's Thesis, National University of Singapore, in preparation).Lastly, we show that the class of d.c.e. reals is properly contained in the class or reals less random than Ω (the halting probability), which in turn is properly contained in the class of c.a. reals, and that neither the first nor last class is a randomness class (as captured by rK-reducibility).

Sign in / Sign up

Export Citation Format

Share Document