SearcharxivSearch

arXiv · 2409.14467

Nonstandard polynomials: algebraic properties and elementary equivalence

Abstract

We solve the first-order classification problem for rings $R$ of polynomials $F[x_1, \ldots,x_n]$ and Laurent polynomials $F[x_1,x_1^{-1}, \ldots,x_n,x_n^{-1}]$ with coefficients in an infinite field $F$ or the ring of integers $\mathbb Z$, that is, we describe the algebraic structure of all rings $S$ that are first-order equivalent to $R$. Our approach is based on a new and very powerful method of regular bi-interpretations, or more precisely, regular invertible interpretations. Namely, we prove that $F[x_1, \ldots,x_n]$ and $F[x_1,x_1^{-1}, \ldots,x_n,x_n^{-1}]$ are regularly bi-interpretable with the list superstructure $\mathbb S(F,\mathbb N)$ of $F$, which is equivalent to regular bi-interpretation with the superstructure $HF(F)$ of hereditary finite sets over $F$. The expressive power of $\mathbb S(F,\mathbb N)$ is the same as that of the weak second-order logic over $F$. Hence, the first-order logic in $R = F[x_1, \ldots,x_n]$ or $R = F[x_1,x_1^{-1}, \ldots,x_n,x_n^{-1}]$ is equivalent to the weak second-order logic in $F$ (following the terminology of Kharlampovich, Myasnikov, and Sohrabi [16], such structures are necessarily rich), which allows one to describe the algebraic structure of all rings $S$ with $S\equiv R$. In fact, these rings $S$ are precisely the ``non-standard'' models of $R$, like in non-standard arithmetic or non-standard analysis. This is particularly straightforward when $F$ is regularly bi-interpretable with $\mathbb N$, in this case the ring $R$ is also bi-interpretable with $\mathbb N$. Using our approach, we describe various, sometimes rather surprising, algebraic and model-theoretic properties of the non-standard models of $R$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexei Myasnikov, Andrey Nikolaev. 2024-09-22. Nonstandard polynomials: algebraic properties and elementary equivalence. https://arxiv.org/abs/2409.14467

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