MétaCan
Menu
Back to cohort
Record W2006341276 · doi:10.2178/jsl/1203350794

An untyped higher order logic with Y combinator

2007· article· en· W2006341276 on OpenAlexafffund
James H. Andrews

Bibliographic record

VenueJournal of Symbolic Logic · 2007
Typearticle
Languageen
FieldComputer Science
TopicLogic, programming, and type systems
Canadian institutionsWestern University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsCombinatory logicCurry–Howard correspondencesortType theoryConsistency (knowledge bases)MathematicsCalculus (dental)Computer scienceProgramming languageLambda calculusType (biology)Algebra over a fieldDiscrete mathematicsArithmeticPure mathematics

Abstract

fetched live from OpenAlex

Abstract We define a higher order logic which has only a notion of sort rather than a notion of type, and which permits all terms of the untyped lambda calculus and allows the use of the Y combinator in writing recursive predicates. The consistency of the logic is maintained by a distinction between use and mention, as in Gilmore's logics. We give a consistent model theory, a proof system which is sound with respect to the model theory, and a cut-elimination proof for the proof system. We also give examples showing what formulas can and cannot be used in the logic.

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.002
metaresearch head score (Gemma)0.002
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.007
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.002
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0010.002
Science and technology studies0.0010.004
Scholarly communication0.0050.006
Open science0.0020.003
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0040.001

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.022
GPT teacher head0.271
Teacher spread0.249 · 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

Citations0
Published2007
Admission routes2
Has abstractyes

Explore more

Same venueJournal of Symbolic LogicSame topicLogic, programming, and type systemsFrench-language works237,207