MétaCan
ENFR
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

Export CSVExport JSONAPI query

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
→
Sort
Language
Type
Field
Venue
Journal of Symbolic Logic
Topic
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

102 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
102 works in the cohort · of 4,299,418page 2 of 3

Labels cover 0 of 102 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 102 of 102 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
On the binding group in simple theories
Ziv Shami, Frank Olaf Wagner
2002· article· en· Journal of Symbolic Logic· Mathematics
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
STATIONARY REFLECTION
Yair Hayut, Spencer Unger
2020· article· en· Journal of Symbolic Logic· Mathematics
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
A geometric zero-one law
Robert H. Gilman, Yuri Gurevich, Alexei Miasnikov
2009· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
WEAK CANONICAL BASES IN NSOP THEORIES
Byunghan Kim
2021· article· en· Journal of Symbolic Logic· Mathematics
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
The settling-time reducibility ordering
Barbara F. Csima, Richard A. Shore
2007· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
P-ideal dichotomy and weak squares
Dilip Raghavan
2013· article· en· Journal of Symbolic Logic· Mathematics
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Every 1-generic computes a properly 1-generic
Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt, Joseph S. Miller
2006· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
fundno affunlabeled
COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
Matthew Harrison‐Trainor, Alexander Melnikov, Russell Miller, Antonio Montalbán
2017· preprint· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affunlabeled
TUKEY ORDER AMONG IDEALS
Jialiang He, Michael Hrušák, Diego Rojas‐Rebolledo, Sławomir Solecki
2021· article· en· Journal of Symbolic Logic· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
The complexity of analytic tableaux
Noriko Arai, Toniann Pitassi, Alasdair Urquhart
2006· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
BETWEENNESS ALGEBRAS
Ivo Düntsch, Rafał Gruszczyński, Paula Menchón
2023· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
MORE ON HALFWAY NEW CARDINAL CHARACTERISTICS
Barnabás Farkas, Lukas Daniel Klausner, Marc Lischka
2023· article· en· Journal of Symbolic Logic· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
HOMOGENEITY AND FIX-POINTS: GOING FORTH!
Roger Villemaire
2015· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
CATEGORICAL FOUNDATIONS OF FORMALIZED CONDENSED MATHEMATICS
Dagur Tómas Ásgeirsson, Riccardo Brasca, Nikolas Kuhn, Filippo Alberto Edoardo Nuccio Mortarino Majno Di Capriglio, Adam Topaz
2024· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
JSL volume 77 issue 2 Cover and Back matter
Alessandro Berarducci, Erich Grädel, Bradd Hart, Denis R. Hirschfeldt, Justin B. Moore, Frank Stephan +1 more
2012· paratext· en· Journal of Symbolic Logic· Economics, Econometrics and Finance
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
DOMINATION, FIBRATIONS, AND SPLITTING
Christine Eagles, Léo Jimenez
2025· article· en· Journal of Symbolic Logic· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
AMALGAMABLE DIAGRAM SHAPES
Ruiyuan Chen
2019· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
ON THE COMPUTABILITY OF OPTIMAL SCOTT SENTENCES
Rachael Alvir, Barbara F. Csima, Matthew Harrison‐Trainor
2025· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About