SearcharxivSearch

arXiv · 1703.10498

Reconstructing Structures with the Strong Small Index Property up to Bi-Definability

Abstract

Let $\mathbf{K}$ be the class of countable structures $M$ with the strong small index property and locally finite algebraicity, and $\mathbf{K}_*$ the class of $M \in \mathbf{K}$ such that $acl_M(\{ a \}) = \{ a \}$ for every $a \in M$. For homogeneous $M \in \mathbf{K}$, we introduce what we call the expanded group of automorphisms of $M$, and show that it is second-order definable in $Aut(M)$. We use this to prove that for $M, N \in \mathbf{K}_*$, $Aut(M)$ and $Aut(N)$ are isomorphic as abstract groups if and only if $(Aut(M), M)$ and $(Aut(N), N)$ are isomorphic as permutation groups. In particular, we deduce that for $\aleph_0$-categorical structures the combination of strong small index property and no algebraicity implies reconstruction up to bi-definability, in analogy with Rubin's well-known $\forall \exists$-interpretation technique of [7]. Finally, we show that every finite group can be realized as the outer automorphism group of $Aut(M)$ for some countable $\aleph_0$-categorical homogeneous structure $M$ with the strong small index property and no algebraicity.

Explore related subjects

Keep this discovery

BibTeXRIS

Gianluca Paolini, Saharon Shelah. 2017-03-30. Reconstructing Structures with the Strong Small Index Property up to Bi-Definability. https://arxiv.org/abs/1703.10498

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