MétaCan
Menu
Back to cohort
Record W4382561381 · doi:10.1017/jsl.2023.46

DEFINABLE -THEOREM FOR FAMILIES WITH VC-CODENSITY LESS THAN

2023· article· en· W4382561381 on OpenAlexfundno aff
Pablo Andújar Guerrero

Bibliographic record

VenueJournal of Symbolic Logic · 2023
Typearticle
Languageen
FieldMathematics
TopicAdvanced Topology and Set Theory
Canadian institutionsnot available
FundersDivision of Mathematical SciencesEngineering and Physical Sciences Research CouncilFields Institute for Research in Mathematical Sciences
KeywordsCombinatoricsConjectureMathematicsIntersection (aeronautics)Order (exchange)OmegaProperty (philosophy)Discrete mathematicsPhysics

Abstract

fetched live from OpenAlex

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].

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.015
Threshold uncertainty score0.369

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.072
GPT teacher head0.325
Teacher spread0.253 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Symbolic LogicSame topicAdvanced Topology and Set TheoryFrench-language works237,207