Pseudofiniteness in Hrushovski constructions

DOI10.1215/00294527-2019-0038zbMATH Open1484.03057arXiv1811.04692OpenAlexW2991617970MaRDI QIDQ2176403FDOQ2176403

M. Pourmahdian, Ali N. Valizadeh

Publication date: 4 May 2020

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Abstract: In a relational language consisting of a single relation $R,$ we investigate pseudofiniteness of certain Hrushovski constructions obtained via predimension functions. It is notable that the arity of the relation $R$ plays a crucial role in this context. When $R$ is ternary, by extending the methods developed in [BL12], we interpret $langlemathbb{Q}^{+},<angle$ in the $langlemathcal{K}_0^{+},le{q}^{*}angle$-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 $R$ is binary, it can be shown that the $langlemathcal{K}_0^{+},le{q}^{*}angle$-generic is decidable and pseudofinite.

Full work available at URL: https://arxiv.org/abs/1811.04692

zbMATH Keywords

predimension[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Ehrenfeucht-Fra%EF%BF%BD%EF%BF%BDss%EF%BF%BD%EF%BF%BD+games&go=Go Ehrenfeucht-Fra��ss�� games]Hrushovski constructionsgeneric structurespseudofinite structures

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45) Infinite graphs (05C63) Hypergraphs (05C65) Model theory of denumerable and separable structures (03C15)

Cites Work

• The strange logic of random graphs
• Stable generic structures
• On generic structures
• Simple generic structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• On superstable generic structures
• Randomness and semigenericity
• Strict superstablity and decidability of certain generic graphs
• Superstable graphs
• Smooth classes without AC and Robinson theories
• Some remarks on generic structures
• On rational limits of Shelah-Spencer graphs

Cited In (4)

• Pseudofinite structures and simplicity
• Strict superstablity and decidability of certain generic graphs
• A note on pseudofinite acyclic graphs
• Some questions concerning Hrushovski's amalgamation constructions

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)