Pseudofiniteness in Hrushovski constructions
From MaRDI portal
Publication:2176403
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 developed in [BL12], we interpret in the -generic and prove that this structure is not pseudofinite. This provides a negative answer to the question posed in [EW09] (Question 2.6). This result, in fact, unfolds another aspect of complexity of this structure, along with undecidability and strict order property proved in [EW09] and [Bl12]. On the other hand, when is binary, it can be shown that the -generic is decidable and pseudofinite.
Recommendations
Cites work
- scientific article; zbMATH DE number 554978 (Why is no real title available?)
- scientific article; zbMATH DE number 663787 (Why is no real title available?)
- On generic structures
- On rational limits of Shelah-Spencer graphs
- On superstable generic structures
- Randomness and semigenericity
- Simple generic structures
- Smooth classes without AC and Robinson theories
- Some remarks on generic structures
- Stable generic structures
- Strict superstablity and decidability of certain generic graphs
- Superstable graphs
- The strange logic of random graphs
Cited in
(4)
This page was built for publication: Pseudofiniteness in Hrushovski constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176403)