Non-Archimedean TSI Polish groups and their potential Borel complexity spectrum

Shaun Allison

Home/Archive/arXiv

arXiv · 2010.05085

Non-Archimedean TSI Polish groups and their potential Borel complexity spectrum

Shaun Allison

View original source ↗Read source document ↗Export metadata ↓

Abstract

A variation of the Scott analysis of countable structures is applied to actions of non-Archimedean TSI Polish groups acting continuously on a Polish spaces. We give results on the potential Borel complexity spectrum of such groups, and define orbit equivalence relations that are universal for each Borel complexity class. We also identify an obstruction to classifiability by actions of such groups, namely generic ergodicity with respect to $E_\infty$, which we apply to Clemens-Coskey jumps of countable Borel equivalence relations. Finally, we characterize the equivalence relations that are both Borel-reducible to $=^+$ and classifiable by non-Archimedean TSI Polish groups, extending a result of Ding and Gao. In the process, several tools are developed in the Borel reducibility theory of orbit equivalence relations which are likely to be of independent interest.

Explore related subjects

math.LO math.DS

Keep this discovery

BibTeX RIS

Shaun Allison. 2020-10-10. Non-Archimedean TSI Polish groups and their potential Borel complexity spectrum. https://arxiv.org/abs/2010.05085

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↗