Page 1

Displaying 1 – 7 of 7

Showing per page

A note on Steinhorn's omitting types theorem

Akito Tsuboi (2009)

Colloquium Mathematicae

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.

Amenability and Ramsey theory

Justin Tatch Moore (2013)

Fundamenta Mathematicae

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...

Amenability and unique ergodicity of automorphism groups of Fraïssé structures

Andy Zucker (2014)

Fundamenta Mathematicae

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 G L ( V ) , where V is the countably infinite-dimensional...

Automorphisms of models of bounded arithmetic

Ali Enayat (2006)

Fundamenta Mathematicae

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 f i x ( j ) for some nontrivial automorphism j of an end extension of that satisfies IΔ₀. Here I f i x ( j ) is the...

Currently displaying 1 – 7 of 7

Page 1