Hostname: page-component-89b8bd64d-b5k59 Total loading time: 0 Render date: 2026-05-08T08:18:39.159Z Has data issue: false hasContentIssue false

COUNTING IN UNCOUNTABLY CATEGORICAL PSEUDOFINITE STRUCTURES

Published online by Cambridge University Press:  16 April 2024

ALEXANDER VAN ABEL*
Affiliation:
DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE WESLEYAN UNIVERSITY MIDDLETOWN CT 06459 USA
Rights & Permissions [Opens in a new window]

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 R-mecs as well as N-dimensional asymptotic classes, where N is the Morley rank of the theory.

Information

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of The Association for Symbolic Logic