MétaCan
Menu
Back to cohort
Record W2803334365 · doi:10.3233/com-190254

Degrees of categoricity above limit ordinals

2019· preprint· en· W2803334365 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueComputability · 2019
Typepreprint
Languageen
FieldComputer Science
TopicComputability, Logic, AI Algorithms
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsDegree (music)MathematicsOmegaCombinatoricsDiscrete mathematicsPhysicsQuantum mechanics

Abstract

fetched live from OpenAlex

A computable structure [Formula: see text] has degree of categoricity d if d is exactly the degree of difficulty of computing isomorphisms between isomorphic computable copies of [Formula: see text]. Fokina, Kalimullin, and Miller showed that every degree d.c.e. in and above [Formula: see text], for any [Formula: see text], and also the degree [Formula: see text], are degrees of categoricity. Later, Csima, Franklin, and Shore showed that every degree [Formula: see text] for any computable ordinal α, and every degree d.c.e. in and above [Formula: see text] for any successor ordinal α, is a degree of categoricity. We show that every degree c.e. in and above [Formula: see text], for α a limit ordinal, is a degree of categoricity. We also show that every degree c.e. in and above [Formula: see text] is the degree of categoricity of a prime model, making progress towards a question of Bazhenov and Marchuk.

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.

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.003
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Open science
Consensus categoriesOpen science
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.600
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.001
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0000.000
Open science0.0070.015
Research integrity0.0010.002
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.040
GPT teacher head0.275
Teacher spread0.234 · 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