Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1301.2611

The valuation difference rank of a quasi-ordered difference field

Salma Kuhlmann·Mickael Matusinski·Francoise Point
View original source ↗Read source document ↗Export metadata ↓

Abstract

There are several equivalent characterizations of the valuation rank of an ordered or valued field. In this paper, we extend the theory to the case of an ordered or valued {\it difference} field (that is, ordered or valued field endowed with a compatible field automorphism). We introduce the notion of {\it difference rank}. To treat simultaneously the cases of ordered and valued fields, we consider quasi-ordered fields. We characterize the difference rank as the quotient modulo the equivalence relation naturally induced by the automorphism (which encodes its growth rate). In analogy to the theory of convex valuations, we prove that any linearly ordered set can be realized as the difference rank of a maximally valued quasi-ordered difference field. As an application, we show that for every regular uncountable cardinal $κ$ such that $κ= κ^{< κ}$, there are $2^κ$ pairwise non-isomorphic quasi-ordered difference fields of cardinality $κ$, but all isomorphic as quasi-ordered fields.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Salma Kuhlmann, Mickael Matusinski, Francoise Point. 2016-09-14. The valuation difference rank of a quasi-ordered difference field. https://doi.org/10.1007/978-3-319-51718-6_23

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↗