Dividing and forking in random hypergraphs

DOI10.1016/J.APAL.2024.103521MaRDI QIDQ6652034zbMATH OpenFDO

Authors Hirotaka Kikyo, Akito Tsuboi

Publication date 12 December 2024

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

Full work available at URL https://doi.org/10.1016/J.APAL.2024.103521

zbMATH Keywords

dividingforkingrandom hypergraphsSU-rank

Mathematics Subject Classification ID

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

Cites work

• A family of countable homogeneous graphs
• AN AXIOMATIC APPROACH TO FREE AMALGAMATION
• Classification theory and the number of non-isomorphic models
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 1425669 (Why is no real title available?)
• scientific article; zbMATH DE number 2220970 (Why is no real title available?)
• Simple theories
• Theories without the tree property of the second kind
• Toward classifying unstable theories

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

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