Strongly minimal pseudofinite structures
Logic
2014-11-25 v2
Abstract
We observe that the nonstandard finite cardinality of a definable set in a strongly minimal pseudofinite structure D is a polynomial over the integers in the nonstandard finite cardinality of D. We conclude that D is unimodular, hence also locally modular. We also deduce a regularity lemma for graphs definable in strongly minimal pseudofinite structures. The paper is elementary, and the only surprising thing about it is that the results were not explicitly noted before. In the new version we add a comment on relations to work of Macpherson and Steinhorn, as well as on the limited nature of the examples
Cite
@article{arxiv.1411.5008,
title = {Strongly minimal pseudofinite structures},
author = {Anand Pillay},
journal= {arXiv preprint arXiv:1411.5008},
year = {2014}
}
Comments
11 pages