MétaCan
Menu
Back to cohort
Record W2011841843 · doi:10.1016/j.entcs.2010.08.003

Unitary Theories, Unitary Categories

2010· article· en· W2011841843 on OpenAlexaff
Pieter Hofstra, Robin Cockett

Bibliographic record

VenueElectronic Notes in Theoretical Computer Science · 2010
Typearticle
Languageen
FieldComputer Science
TopicLogic, programming, and type systems
Canadian institutionsUniversity of CalgaryUniversity of Ottawa
Fundersnot available
KeywordsUnitary stateMathematicsCharacterization (materials science)Algebra over a fieldPure mathematicsPolitical scienceLawPhysics

Abstract

fetched live from OpenAlex

This paper explores the fine structure of classifying categories of partial equational theories. The central concept is that of unitary category, and results about those are applied to the problem of completing partial algebras to total ones. We also look at the special case of partial combinatory logic and give a characterization of the global sections of the generic PCA.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation 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: none
Teacher disagreement score0.006
Threshold uncertainty score0.019

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0020.002
Science and technology studies0.0030.009
Scholarly communication0.0030.009
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0060.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.006
GPT teacher head0.234
Teacher spread0.228 · 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 source (direct Gemma or distilled Codex), 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

Citations5
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueElectronic Notes in Theoretical Computer ScienceSame topicLogic, programming, and type systemsFrench-language works237,207