Bibliographic record
Abstract
Is self-reference necessary for the production of Liar paradoxes? Yablo has given an argument that self-reference is not necessary. He hopes to show that the indexical apparatus of self-reference of the traditional Liar paradox can be avoided by appealing to a list, a consecutive sequence, of sentences correlated one-one with natural numbers. Yablo opens his “Paradox without Self-Reference” (Analysis, 1993) with the assumption that there is a sequence such that: Sn : “(∀k )(k > n . → . ¬True ⌈Sk⌉)” Each sentence on Yablo’s list is supposed to be correlated one-one with number n. Each sentence is supposed to say that for every natural number k greater than n, the k-th sentence on the list is not true. By comparing Yablo’s construction to an analogous construction with early Russellian propositions, we show that Yablo has failed to generate a 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 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.010 | 0.015 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.004 | 0.019 |
| Scholarly communication | 0.004 | 0.013 |
| Open science | 0.002 | 0.004 |
| 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".