Strict superstablity and decidability of certain generic graphs

DOI10.1007/S41980-019-00234-2OpenAlexW2952275609WikidataQ127844949 ScholiaQ127844949MaRDI QIDQ2332364

Ali N. Valizadeh, Massoud Pourmahdian

Publication date: 4 November 2019

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

predimensionHrushovski constructionsgeneric structuresLascar rankpseudofinite structuresstrictly superstableultraflat graphs

Mathematics Subject Classification ID

Model theory (03C99) Infinite graphs (05C63)

Related Items (1)

Pseudofiniteness in Hrushovski constructions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• On superstable generic structures
• Ab initio generic structures which are superstable but not \(\omega \)-stable
• A new strongly minimal set
• Second-order quantifiers and the complexity of theories
• Simple generic structures
• Stable generic structures
• Pseudofiniteness in Hrushovski constructions
• Interpreting nowhere dense graph classes as a classical notion of model theory
• Randomness and semigenericity
• Superstable graphs
• Some trivial considerations
• Stable graphs
• An Almost Strongly Minimal Non-Desarguesian Projective Plane
• Smooth classes without AC and Robinson theories
• The strange logic of random graphs

This page was built for publication: Strict superstablity and decidability of certain generic graphs