Bibliographic record
Abstract
The paper presents a new scientonomic account of question dynamics. To explain the process of question acceptance and rejection, we begin by introducing the notion of epistemic presupposition and show how it’s different from the notion of logical presupposition. With the notion of epistemic presupposition at hand, we formulate the law of question acceptance, a new scientonomic axiom, which states that a question becomes accepted only if all of its epistemic presuppositions are accepted, and it is accepted that the question is answerable. We then show how the process of question rejection can be explained by means of the question rejection theorem, which states that a question becomes rejected when other elements that are incompatible with the question become accepted. To deduce this theorem in the usual scientonomic fashion (from the first law and the compatibility corollary), we first ascertain that the notion of compatibility/incompatibility is applicable to questions and show that one can legitimately speak of both question-theory and question-question incompatibility. We conclude by providing a quick illustration of the historical applicability of this new framework and suggest a number of questions for future research.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.004 | 0.011 |
| Scholarly communication | 0.007 | 0.022 |
| Open science | 0.002 | 0.007 |
| Research integrity | 0.004 | 0.004 |
| Insufficient payload (model declined to judge) | 0.035 | 0.004 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".