MétaCan
Menu
Back to cohort
Record W2914643333 · doi:10.1017/s1755020319000054

BUNDER’S PARADOX

2019· article· en· W2914643333 on OpenAlexaff
Michael Caie

Bibliographic record

VenueThe Review of Symbolic Logic · 2019
Typearticle
Languageen
FieldComputer Science
TopicLogic, Reasoning, and Knowledge
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsPrima facieClass (philosophy)Resolution (logic)Logical consequenceConsistency (knowledge bases)Calculus (dental)MathematicsNon-classical logicMathematical economicsComputer scienceDiscrete mathematicsPhilosophyEpistemologyProgramming language

Abstract

fetched live from OpenAlex

Abstract Systems of illative logic are logical calculi formulated in the untyped λ -calculus supplemented with certain logical constants. 1 In this short paper, I consider a paradox that arises in illative logic. I note two prima facie attractive ways of resolving the paradox. The first is well known to be consistent, and I briefly outline a now standard construction used by Scott and Aczel that establishes this. The second, however, has been thought to be inconsistent. I show that this isn’t so, by providing a nonempty class of models that establishes its consistency. I then provide an illative logic which is sound and complete for this class of models. I close by briefly noting some attractive features of the second resolution of this paradox.

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.004
metaresearch head score (Gemma)0.007
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.028

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.007
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0030.011
Scholarly communication0.0050.011
Open science0.0010.004
Research integrity0.0030.005
Insufficient payload (model declined to judge)0.0060.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.017
GPT teacher head0.263
Teacher spread0.246 · 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
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueThe Review of Symbolic LogicSame topicLogic, Reasoning, and KnowledgeFrench-language works237,207