MétaCan
Menu
Back to cohort
Record W4394855737 · doi:10.3233/ao-230051

From slot mereology to a mereology of slots

2024· article· en· W4394855737 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.

Bibliographic record

VenueApplied Ontology · 2024
Typearticle
Languageen
FieldComputer Science
TopicLogic, Reasoning, and Knowledge
Canadian institutionsHealth and Social Services Centre University Institute of Geriatrics of SherbrookeUniversité de Sherbrooke
Fundersnot available
KeywordsMereologyComputer scienceRelation (database)Problem of universalsCore (optical fiber)EpistemologyMathematical economicsMathematicsPhilosophyData mining

Abstract

fetched live from OpenAlex

In 2013, Bennett proposed a mereological theory in which the parthood relation is defined on the basis of two primitive relations: a is a part of b iff a fills a slot owned by b . However, this theory has issues counting how many parts an entity has. We explore the various counting problems and propose a new theory to solve them. Keeping the core idea of Bennett’s slots, this theory introduces mereological relations between slots. This theory enables us to solve all known counting problems and to go beyond the limits of Bennett’s theory by theorising expected features of mereological theories: supplementation principles and mereological sum and fusion. The theory is illustrated on ontological issues on the nature of structural universals and informational entities.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
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.849
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.012
GPT teacher head0.255
Teacher spread0.243 · 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