Bibliographic record
Abstract
The question of how we come to accept new theories is a central area of inquiry in scientonomic discourse. However, there has yet to be a formal discussion of the subjective reasons an agent may have for accepting theories. This paper explores these epistemic reasons and constructs a historically sensitive definition of reason. This formulation takes an abstractionist stance towards the ontology of reasons and makes use of a composite basing relation. The descriptive and normative components of reasons are fully formulated in scientonomic terms through the application of the newly introduced notion of implication, and its separation from the notion of inference. In addition, the paper provides scientonomic definitions for sufficient reason, support, and normative inference. The fruitfulness of this formulation of reasons is illustrated by a few examples. Suggested Modifications [Sciento-2019-0009]: Accept the following definition of implication: Implication ≡ a logical transition from one theory to another. [Sciento-2019-0010]: Accept the following definitions of sufficient reason, reason, support, and normative inference: Sufficient Reason ≡ an agent takes theory A to be a sufficient reason for (accepting) theory B iff the following four conditions are met: (1) The agent accepts A. (2) The agent accepts that A→B. (3) The agent employs ε. (4) The agent accepts (ε, A, A→B) →ε (Should accept B). Support ≡ an agent takes theory A to be supporting theory B iff the agent accepts A and accepts that A→B. Reason ≡ an agent takes theory A to be a reason for theory B iff the agent accepts that A→B, employs ε, and accepts (ε, A, A→B) →ε (Should accept B). Normative Inference ≡ An agent takes theory A to normatively infer theory B iff the agent accepts A, accepts that A→B, and accepts (ε, A, A→B) →ε (Should accept B). [Sciento-2019-0011]: Provided that modification [Sciento-2019-0010] is accepted, accept the sufficient reason theorem and its deduction from the definition of sufficient reason and the second law: Sufficient Reason theorem: a theory becomes accepted by an agent, when an agent has a sufficient reason for accepting it. Accept the following question as a legitimate topic of scientonomic inquiry: Theory Acceptance without Sufficient Reason: how do theories become accepted without a sufficient reason, i.e. in the cases of circularity or theories without a reason?
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.007 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.004 | 0.002 |
| Science and technology studies | 0.006 | 0.038 |
| Scholarly communication | 0.008 | 0.012 |
| Open science | 0.001 | 0.005 |
| Research integrity | 0.004 | 0.005 |
| Insufficient payload (model declined to judge) | 0.005 | 0.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.
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".