scholarly journals BOREL FUNCTORS AND INFINITARY INTERPRETATIONS

2018 ◽  
Vol 83 (04) ◽  
pp. 1434-1456 ◽  
Author(s):  
MATTHEW HARRISON-TRAINOR ◽  
RUSSELL MILLER ◽  
ANTONIO MONTALBÁN

AbstractWe introduce the notion of infinitary interpretation of structures. In general, an interpretation between structures induces a continuous homomorphism between their automorphism groups, and furthermore, it induces a functor between the categories of copies of each structure. We show that for the case of infinitary interpretation the reversals are also true: every Baire-measurable homomorphism between the automorphism groups of two countable structures is induced by an infinitary interpretation, and every Baire-measurable functor between the set of copies of two countable structures is induced by an infinitary interpretation. Furthermore, we show that the complexities are maintained in the sense that if the functor is ${\bf{\Delta }}_\alpha ^0$, then the interpretation that induces it is ${\rm{\Delta }}_\alpha ^{in}$ up to ${\bf{\Delta }}_\alpha ^0$ equivalence.

2006 ◽  
Vol 71 (1) ◽  
pp. 203-216 ◽  
Author(s):  
Ermek S. Nurkhaidarov

In this paper we study the automorphism groups of countable arithmetically saturated models of Peano Arithmetic. The automorphism groups of such structures form a rich class of permutation groups. When studying the automorphism group of a model, one is interested to what extent a model is recoverable from its automorphism group. Kossak-Schmerl [12] show that if M is a countable, arithmetically saturated model of Peano Arithmetic, then Aut(M) codes SSy(M). Using that result they prove:Let M1. M2 be countable arithmetically saturated models of Peano Arithmetic such that Aut(M1) ≅ Aut(M2). Then SSy(M1) = SSy(M2).We show that if M is a countable arithmetically saturated of Peano Arithmetic, then Aut(M) can recognize if some maximal open subgroup is a stabilizer of a nonstandard element, which is smaller than any nonstandard definable element. That fact is used to show the main theorem:Let M1, M2be countable arithmetically saturated models of Peano Arithmetic such that Aut(M1) ≅ Aut(M2). Then for every n < ωHere RT2n is Infinite Ramsey's Theorem stating that every 2-coloring of [ω]n has an infinite homogeneous set. Theorem 0.2 shows that for models of a false arithmetic the converse of Kossak-Schmerl Theorem 0.1 is not true. Using the results of Reverse Mathematics we obtain the following corollary:There exist four countable arithmetically saturated models of Peano Arithmetic such that they have the same standard system but their automorphism groups are pairwise non-isomorphic.


Author(s):  
A. M. W. Glass ◽  
Yuri Gurevich ◽  
W. Charles Holland ◽  
Saharon Shelah

Classifying (unordered) sets by the elementary (first order) properties of their automorphism groups was undertaken in (7), (9) and (11). For example, if Ω is a set whose automorphism group, S(Ω), satisfiesthen Ω has cardinality at most ℵ0 and conversely (see (7)). We are interested in classifying homogeneous totally ordered sets (homogeneous chains, for short) by the elementary properties of their automorphism groups. (Note that we use ‘homogeneous’ here to mean that the automorphism group is transitive.) This study was begun in (4) and (5). For any set Ω, S(Ω) is primitive (i.e. has no congruences). However, the automorphism group of a homogeneous chain need not be o-primitive (i.e. it may have convex congruences). Fortunately, ‘o-primitive’ is a property that can be captured by a first order sentence for automorphisms of homogeneous chains. Hence our general problem falls naturally into two parts. The first is to classify (first order) the homogeneous chains whose automorphism groups are o-primitive; the second is to determine how the o-primitive components are related for arbitrary homogeneous chains whose automorphism groups are elementarily equivalent.


2016 ◽  
Vol 81 (3) ◽  
pp. 876-886 ◽  
Author(s):  
MACIEJ MALICKI

AbstractWe define a simple criterion for a homogeneous, complete metric structure X that implies that the automorphism group Aut(X) satisfies all the main consequences of the existence of ample generics: it has the automatic continuity property, the small index property, and uncountable cofinality for nonopen subgroups. Then we verify it for the Urysohn space $&#xF094;$, the Lebesgue probability measure algebra MALG, and the Hilbert space $\ell _2 $, thus proving that Iso($&#xF094;$), Aut(MALG), $U\left( {\ell _2 } \right)$, and $O\left( {\ell _2 } \right)$ share these properties. We also formulate a condition for X which implies that every homomorphism of Aut(X) into a separable group K with a left-invariant, complete metric, is trivial, and we verify it for $&#xF094;$, and $\ell _2 $.


2019 ◽  
Vol 85 (1) ◽  
pp. 199-223 ◽  
Author(s):  
DAOUD SINIORA ◽  
SŁAWOMIR SOLECKI

AbstractWe give strengthened versions of the Herwig–Lascar and Hodkinson–Otto extension theorems for partial automorphisms of finite structures. Such strengthenings yield several combinatorial and group-theoretic consequences for homogeneous structures. For instance, we establish a coherent form of the extension property for partial automorphisms for certain Fraïssé classes. We deduce from these results that the isometry group of the rational Urysohn space, the automorphism group of the Fraïssé limit of any Fraïssé class that is the class of all ${\cal F}$-free structures (in the Herwig–Lascar sense), and the automorphism group of any free homogeneous structure over a finite relational language all contain a dense locally finite subgroup. We also show that any free homogeneous structure admits ample generics.


1980 ◽  
Vol 32 (2) ◽  
pp. 414-420 ◽  
Author(s):  
A. M. Brunner

In this paper, we consider the class of groups G(l, m; k) which are defined by the presentationwhere k, l, m are integers, and |l| > m > 0, k > 0. Groups in this class possess many properties which seem unusual, especially for one-relator groups. The basis for the results obtained below is the determination of endomorphisms.For certain of the groups, we are able to calculate their automorphism groups. One consequence of this is to produce examples of one-relator groups with infinitely generated automorphism groups. This answers a question raised by G. Baumslag (in a colloquium lecture at the University of Waterloo). Our examples are, perhaps, the simplest possible; J. Lewin [10] has found an example of a finitely presented group with an infinitely generated automorphism group.


Author(s):  
MAX CARTER ◽  
GEORGE A. WILLIS

Motivated by the Bruhat and Cartan decompositions of general linear groups over local fields, we enumerate double cosets of the group of label-preserving automorphisms of a label-regular tree over the fixator of an end of the tree and over maximal compact open subgroups. This enumeration is used to show that every continuous homomorphism from the automorphism group of a label-regular tree has closed range.


2015 ◽  
Vol 80 (4) ◽  
pp. 1411-1434
Author(s):  
JAMES H. SCHMERL

AbstractIf ${\cal M},{\cal N}$ are countable, arithmetically saturated models of Peano Arithmetic and ${\rm{Aut}}\left( {\cal M} \right) \cong {\rm{Aut}}\left( {\cal N} \right)$, then the Turing-jumps of ${\rm{Th}}\left( {\cal M} \right)$ and ${\rm{Th}}\left( {\cal N} \right)$ are recursively equivalent.


2018 ◽  
Vol 83 (2) ◽  
pp. 395-415
Author(s):  
LOVKUSH AGARWAL ◽  
MICHAEL KOMPATSCHER

AbstractGiven two structures${\cal M}$and${\cal N}$on the same domain, we say that${\cal N}$is a reduct of${\cal M}$if all$\emptyset$-definable relations of${\cal N}$are$\emptyset$-definable in${\cal M}$. In this article the reducts of the Henson digraphs are classified. Henson digraphs are homogeneous countable digraphs that omit some set of finite tournaments. As the Henson digraphs are${\aleph _0}$-categorical, determining their reducts is equivalent to determining the closed supergroupsG≤ Sym(ℕ) of their automorphism groups.A consequence of the classification is that there are${2^{{\aleph _0}}}$pairwise noninterdefinable Henson digraphs which have no proper nontrivial reducts. Taking their automorphisms groups gives a positive answer to a question of Macpherson that asked if there are${2^{{\aleph _0}}}$pairwise nonconjugate maximal-closed subgroups of Sym(ℕ). By the reconstruction results of Rubin, these groups are also nonisomorphic as abstract groups.


2014 ◽  
Vol 79 (2) ◽  
pp. 561-584
Author(s):  
ERMEK S. NURKHAIDAROV ◽  
JAMES H. SCHMERL

AbstractLet κ be the cardinality of some saturated model of Peano Arithmetic. There is a set of ${2^{{\aleph _0}}}$ saturated models of PA, each having cardinality κ, such that whenever M and N are two distinct models from this set, then Aut(${\cal M}$) ≇ Aut ($${\cal N}$$).


Author(s):  
Carolyn Nohr ◽  
Ann Ayres

Texts on electron diffraction recommend that the camera constant of the electron microscope be determine d by calibration with a standard crystalline specimen, using the equation


Sign in / Sign up

Export Citation Format

Share Document