Abstract
In a relational language consisting of a single relation , we investigate pseudofiniteness of certain Hrushovski constructions obtained via predimension functions. It is notable that the arity of the relation plays a crucial role in this context. When is ternary, by extending the methods recently developed by Brody and Laskowski, we interpret in the -generic and prove that this structure is not pseudofinite. This provides a negative answer to the question posed in an earlier work by Evans and Wong. This result, in fact, unfolds another aspect of complexity of this structure, along with undecidability and the strict order property proved in the mentioned earlier works. On the other hand, when is binary, it can be shown that the -generic is decidable and pseudofinite.
Citation
Ali N. Valizadeh. Massoud Pourmahdian. "Pseudofiniteness in Hrushovski Constructions." Notre Dame J. Formal Logic 61 (1) 1 - 10, January 2020. https://doi.org/10.1215/00294527-2019-0038
Information