相关论文: Representing Ordinal Numbers with Arithmetically I…

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…

In this paper, we define an ordering relation for a set of complex numbers, and research the properties and theorems of the ordering, solve some simple complex inequalities with the ordering.

When $A$ and $B$ are subsets of the integers in $[1,X]$ and $[1,Y]$ respectively, with $|A| \geq \alpha X$ and $|B| \geq \beta X$, we show that the number of rational numbers expressible as $a/b$ with $(a,b)$ in $A \times B$ is $\gg (\alpha…

Let $(p_n)$ denote the sequence of prime numbers, with $2=p_1<p_2<\ldots$. We demonstrate the existence of an irrational number $\alpha$ having the property that the sequence $(\alpha p_n)$ is not well-distributed modulo $1$.

We give a construction of an absolutely normal real number $x$ such that for every integer $b $ greater than or equal to $2$, the discrepancy of the first $N$ terms of the sequence $(b^n x \mod 1)_{n\geq 0}$ is of asymptotic order…

First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…

For an algebraic number $\alpha$ of degree $n$, let $\mathcal{M}_{\alpha}$ be the $\mathbb{Z}$-module generated by $1,\alpha ,\ldots ,\alpha^{n-1}$; then $\mathbb{Z}_{\alpha}:=\{\xi\in\mathbb{Q} (\alpha ):\,…

In this expository article, the real numbers are defined as infinite decimals. After defining an ordering relation and the arithmetic operations, it is shown that the set of real numbers is a complete ordered field. It is further shown that…

A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…

A sequence of real numbers $\{x_{n}\}_{n\in \mathbb{N}}$ is said to be $\alpha \beta$-statistically convergent of order $\gamma$ (where $0<\gamma\leq 1$) to a real number $x$ \cite{a} if for every $\delta>0,$ $$\underset{n\rightarrow…

Let $A$ be a finite ordered set. Define the ordered set $A^A$ as the set of all maps from $A$ to $A$, ordered pointwise. Let ${}^{A} A$ be the dual of $A^A$. We prove results in the spirit of Parts~I--III, but now using both $A^A$ and…

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

We classify the countable linear orders $X$ for which there is an order $A$ with at least two points such that the lexicographic product $AX$ is isomorphic to $X$. Given such an $X$, we determine every corresponding order $A$, and identify…

Let $\alpha=0.a_1a_2a_3\ldots$ be an irrational number in base $b>1$, where $0\leq a_i<b$. The number $\alpha \in (0,1)$ is a \textit{normal number} if every block $(a_{n+1}a_{n+2}\ldots a_{n+k})$ of $k$ digits occurs with probability…

We give a criterion when an expansion of the ordered set of real numbers defines the image of the expansion of the real field by the set of natural numbers under a semialgebraic injection. In particular, we show that for a non-quadratic…

The standard interpretation of first-order number theory (PA), according to the generally accepted view, associates well-defined set-theoretic entities with each and every well-formed formula of this system. But this implies that the class…

An ordered set-partition (or preferential arrangement) of n labeled elements represents a single ``hierarchy''; these are enumerated by the ordered Bell numbers. In this note we determine the number of ``hierarchical orderings'' or…

Well-partial orders, and the ordinal invariants used to measure them, are relevant in set theory, program verification, proof theory and many other areas of computer science and mathematics. In this article we focus on one of the most…

We define Collatz representations for a subset of rational numbers and prove that each real number \( x \notin (-1,1) \) can be approximated arbitrarily well by rational numbers which have only \( 2 \)'s and \( 1 \)'s in their Collatz…

The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest set whose structure is not that of any natural number extends this set-theoretic representation to positive and negative integers. The…