A Compatibility Law and the Classification of Theory Change
Bibliographic record
Abstract
The current formulation of the zeroth law (the law of compatibility) is marred with a number of theoretical problems, which necessitate its reformulation. In this paper, we propose that compatibility is an independent stance that can be taken towards epistemic elements of all types. We then provide a new definition of compatibility criteria to reflect this change. We show that the content of the zeroth law is deducible from our definition of compatibility. Instead of a static law of compatibility, we propose a new dynamic law of compatibility that explains how the stance of compatibility obtains. Unlike the zeroth law, this new law has empirical content, as it forbids certain conceivable scenarios. Having established these notions, we propose a classification space that exhaustively covers all the possible states a theory may occupy and all the transitions it may undergo during its lifecycle. Suggested Modifications [Sciento-2018-0015]: Accept the following definition of compatibility: Compatibility ≡ the ability of two elements to coexist in the same mosaic. Also accept the following corollary: Compatibility Corollary: at any moment of time, the elements of the scientific mosaic are compatible with each other. Accept that all theorems that take the current zeroth law as their premise are recoverable when the compatibility corollary is used as a premise instead. Reject the zeroth law. [Sciento-2018-0016]: Accept compatibility as a distinct epistemic stance that can be taken towards epistemic elements of all types. Also accept that compatibility is binary, reflexive, and symmetric. Transitivity of compatibility holds only within mosaics, not sui generis. [Sciento-2018-0017]: Accept the following definition of compatibility criteria: Compatibility Criteria ≡ criteria for determining whether two elements are compatible or incompatible. Reject the previous definition of compatibility criteria. [Sciento-2018-0018]: Accept the following law of compatibility as a scientonomic axiom: The Law of Compatibility: if a pair of elements satisfies the compatibility criteria employed at the time, it becomes compatible within the mosaic; if it does not, it is deemed incompatible; and if assessment is inconclusive, the pair can become compatible, incompatible, or its status may be unknown. [Sciento-2018-0019]: Accept the new definition of theory acceptance: Theory Acceptance ≡ an accepted theory is a scientific theory that is taken as the best available description or prescription of its object. Reject the previous definition of theory acceptance. [Sciento-2018-0020]: Accept the following theorem: Demarcation-Acceptance Synchronism theorem: every theory that becomes accepted satisfies the demarcation criteria employed at the time of acceptance.
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.016 | 0.026 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.003 |
| Bibliometrics | 0.008 | 0.004 |
| Science and technology studies | 0.006 | 0.029 |
| Scholarly communication | 0.011 | 0.028 |
| Open science | 0.003 | 0.008 |
| Research integrity | 0.005 | 0.007 |
| Insufficient payload (model declined to judge) | 0.010 | 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".