Dividing and forking in random hypergraphs

DOI10.1016/j.apal.2024.103521MaRDI QIDQ6652034

Akito Tsuboi, Hirotaka Kikyo

Publication date: 12 December 2024

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

forkingrandom hypergraphsdividingSU-rank

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Classification theory, stability, and related concepts in model theory (03C45) Models with special properties (saturated, rigid, etc.) (03C50) Model theory of denumerable and separable structures (03C15) Other model constructions (03C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theories without the tree property of the second kind
• Classification theory and the number of non-isomorphic models
• Simple theories
• Toward classifying unstable theories
• AN AXIOMATIC APPROACH TO FREE AMALGAMATION
• A family of countable homogeneous graphs

This page was built for publication: Dividing and forking in random hypergraphs