### A dichotomy theorem for mono-unary algebras

We study the isomorphism relation of invariant Borel classes of countable mono-unary algebras and prove a strong dichotomy theorem.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

We study the isomorphism relation of invariant Borel classes of countable mono-unary algebras and prove a strong dichotomy theorem.

Let p(x) be a nonprincipal type. We give a sufficient condition for a model M to have a proper elementary extension omitting p(x). As a corollary, we obtain a generalization of Steinhorn's omitting types theorem to the supersimple case.

The purpose of this article is to connect the notion of the amenability of a discrete group with a new form of structural Ramsey theory. The Ramsey-theoretic reformulation of amenability constitutes a considerable weakening of the Følner criterion. As a by-product, it will be shown that in any non-amenable group G, there is a subset E of G such that no finitely additive probability measure on G measures all translates of E equally. The analysis of discrete groups will be generalized to the setting...

In this paper we consider those Fraïssé classes which admit companion classes in the sense of [KPT]. We find a necessary and sufficient condition for the automorphism group of the Fraïssé limit to be amenable and apply it to prove the non-amenability of the automorphism groups of the directed graph S(3) and the boron tree structure T. Also, we provide a negative answer to the Unique Ergodicity-Generic Point problem of Angel-Kechris-Lyons [AKL]. By considering $GL\left({V}_{\infty}\right)$, where ${V}_{\infty}$ is the countably infinite-dimensional...

We establish the following model-theoretic characterization of the fragment IΔ₀ + Exp + BΣ₁ of Peano arithmetic in terms of fixed points of automorphisms of models of bounded arithmetic (the fragment IΔ₀ of Peano arithmetic with induction limited to Δ₀-formulae). Theorem A. The following two conditions are equivalent for a countable model of the language of arithmetic: (a) satisfies IΔ₀ + BΣ₁ + Exp; (b) $={I}_{fix}\left(j\right)$ for some nontrivial automorphism j of an end extension of that satisfies IΔ₀. Here ${I}_{fix}\left(j\right)$ is the...

Let T denote a completion of ZF. We are interested in the number μ(T) of isomorphism types of countable well-founded models of T. Given any countable order type τ, we are also interested in the number μ(T,τ) of isomorphism types of countable models of T whose ordinals have order type τ. We prove: (1) Suppose ZFC has an uncountable well-founded model and $\kappa \in \omega \cup \aleph \u2080,\aleph \u2081,{2}^{\aleph \u2080}$. There is some completion T of ZF such that μ(T) = κ. (2) If α <ω₁ and μ(T,α) > ℵ₀, then $\mu (T,\alpha )={2}^{\aleph \u2080}$. (3) If α < ω₁ and T ⊢ V ≠ OD, then $\mu (T,\alpha )\in 0,{2}^{\aleph \u2080}$. (4)...

A method is developed for proving non-amenability of certain automorphism groups of countable structures and is used to show that the automorphism groups of the random poset and random distributive lattice are not amenable. The universal minimal flow of the automorphism group of the random distributive lattice is computed as a canonical space of linear orderings but it is also shown that the class of finite distributive lattices does not admit hereditary order expansions with the Amalgamation Property....

We show that if G is a non-archimedean, Roelcke precompact Polish group, then G has Kazhdan's property (T). Moreover, if G has a smallest open subgroup of finite index, then G has a finite Kazhdan set. Examples of such G include automorphism groups of countable ω-categorical structures, that is, the closed, oligomorphic permutation groups on a countable set. The proof uses work of the second author on the unitary representations of such groups, together with a separation result for infinite permutation...