English

Counting in Uncountably Categorical Pseudofinite Structures

Logic 2025-02-05 v2

Abstract

We show that every definable subset of an uncountably categorical pseudofinite structure has pseudofinite cardinality which is polynomial (over the rationals) in the size of any strongly minimal subset, with the degree of the polynomial equal to the Morley rank of the subset. From this fact, we show that classes of finite structures whose ultraproducts all satisfy the same uncountably categorical theory are polynomial RR-mecs as well as NN-dimensional asymptotic classes, where NN is the Morley rank of the theory.

Keywords

Cite

@article{arxiv.2103.03276,
  title  = {Counting in Uncountably Categorical Pseudofinite Structures},
  author = {Alexander Van Abel},
  journal= {arXiv preprint arXiv:2103.03276},
  year   = {2025}
}
R2 v1 2026-06-23T23:46:18.581Z