MétaCan
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.

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
Archive for Mathematical 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.

26 results · 1 filter active ·
Results by year
20012025
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.
26 works in the cohort · of 4,299,418page 1 of 1

Labels cover 0 of 26 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 26 of 26 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Weak theories of linear algebra
Neil Thapen, Michael Soltys
2004· article· en· Archive for Mathematical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Omitting types and AF algebras
Kevin Carlson, Enoch Cheung, Ilijas Farah, Alexander Gerhardt-Bourke, Bradd Hart, Leanne Mezuman +2 more
2013· article· en· Archive for Mathematical Logic· Mathematics
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
The modal logic of the countable random frame
Valentin Goranko, Bruce M. Kapron
2003· article· en· Archive for Mathematical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Equimorphy: the case of chains
C. Laflamme, M. Pouzet, R. Woodrow
2017· article· en· Archive for Mathematical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Some Calkin algebras have outer automorphisms
Ilijas Farah, Paul McKenney, Ernest Schimmerling
2013· article· en· Archive for Mathematical Logic· Mathematics
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Coverings by open cells
Mário J. Edmundo, Pantelis E. Eleftheriou, Luca Prelli
2014· article· en· Archive for Mathematical Logic· Mathematics
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Matrix identities and the pigeonhole principle
Michael Soltys, Alasdair Urquhart
2004· article· en· Archive for Mathematical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Imaginaries in Hilbert spaces
Itay Ben-Yaacov, Alexander Berenstein
2004· article· en· Archive for Mathematical Logic· Mathematics
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
On the distribution of Lachlan nonsplitting bases
S. Barry Cooper, Angsheng Li, Xiaoding Yi
2002· article· en· Archive for Mathematical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Hechler’s theorem for the null ideal
2004· article· en· Archive for Mathematical Logic· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Relatively computably enumerable reals
2010· article· en· Archive for Mathematical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Linear orders with distinguished function symbol
Douglas Cenzer, Barbara F. Csima, Bakhadyr Khoussainov
2008· article· en· Archive for Mathematical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Siblings of direct sums of chains
Davoud Abdi
2025· article· en· Archive for Mathematical Logic· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Intersection numbers of families of ideals
Michael Hrušák, Carlos Martínez-Ranero, Ulises Ariet Ramos-García, O. A. Téllez-Nieto
2013· article· en· Archive for Mathematical Logic· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Index sets and parametric reductions
Rod Downey, Michael R. Fellows
2001· article· en· Archive for Mathematical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About