Hostname: page-component-89b8bd64d-sd5qd Total loading time: 0 Render date: 2026-05-08T14:56:16.139Z Has data issue: false hasContentIssue false

DEFINABLE $(\omega ,2)$-THEOREM FOR FAMILIES WITH VC-CODENSITY LESS THAN $2$

Published online by Cambridge University Press:  29 June 2023

PABLO ANDÚJAR GUERRERO*
Affiliation:
SCHOOL OF MATHEMATICS UNIVERSITY OF LEEDS LEEDS, UK
*
Rights & Permissions [Opens in a new window]

Abstract

Let $\mathcal {S}$ be a family of nonempty sets with VC-codensity less than $2$. We prove that, if $\mathcal {S}$ has the $(\omega ,2)$-property (for any infinitely many sets in $\mathcal {S}$, at least two among them intersect), then $\mathcal {S}$ can be partitioned into finitely many subfamilies, each with the finite intersection property. If $\mathcal {S}$ is definable in some first-order structure, then these subfamilies can be chosen definable too.

This is a strengthening of the case $q=2$ of the definable $(p,q)$-conjecture in model theory [9] and the Alon–Kleitman–Matoušek $(p,q)$-theorem in combinatorics [6].

Information

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2023. Published by Cambridge University Press on behalf of The Association for Symbolic Logic