Strict superstablity and decidability of certain generic graphs

DOI10.1007/S41980-019-00234-2MaRDI QIDQ2332364zbMATH OpenOpenAlexWikidataFDO

Authors Ali N. Valizadeh, M. 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

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

Recommendations

• Superstable graphs
• A remark on the stability of saturated generic graphs
• On superstable generic structures
• Model complete theories of trees
• A construction of superstable ndop-notop groups

Cites work

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

Cited in

(4)

• Structure of the set of generating graphs in the theory of pseudocriteria
• Pseudofiniteness in Hrushovski constructions
• Strict Superstablity and Decidability of Certain Generic Graphs
• A note on pseudofinite acyclic graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2332364)