SearcharxivSearch

arXiv · 1311.0499

First order theory of cyclically ordered groups

Abstract

By a result known as Rieger's theorem (1956), there is a one-to-one correspondence, assigning to each cyclically ordered group $H$ a pair $(G,z)$ where $G$ is a totally ordered group and $z$ is an element in the center of $G$, generating a cofinal subgroup $\langle z\rangle$ of $G$, and such that the quotient group $G/\langle z\rangle$ is isomorphic to $H$. We first establish that, in this correspondence, the first order theory of the cyclically ordered group $H$ is uniquely determined by the first order theory of the pair $(G,z)$. Then we prove that the class of cyclically ordered groups is an elementary class and give an axiom system for it. Finally we show that, in opposition to the fact that all theories of totally Abelian ordered groups have the same universal part, there are uncountably many universal theories of Abelian cyclically ordered groups. We give for each of these universal theories an invariant, which is a pair of subgroups of the group of unimodular complex numbers.

Explore related subjects

Keep this discovery

BibTeXRIS

Michèle Giraudet, Gérard Leloup, Francois Lucas. 2013-11-03. First order theory of cyclically ordered groups. https://arxiv.org/abs/1311.0499

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