The Paradox Docket: A Computable Classification of the Classical Paradoxes

Read full text
Authors: Vitaliy Reznik
Cited by: 2

Abstract

A machine-checked census of the classical paradoxes. Every self-referential sentence is run through one executable instrument that counts its consistent classical solutions and issues a passport: 0 → PARADOX (refusal forever), 1 → INTRINSIC (forced verdict), 2+ → UNDERDETERMINED (a choice awaiting a decree). 21 case files, 8 verdicts, each reproducible with python3 zclassify.py. The taxonomy descends from Kripke and Gupta–Belnap; what is new is executability — old disputes (is circularity vicious; is a loop hidden in Yablo; is Curry the liar; is the Ship of Theseus a paradox) receive measured, not argued, answers. Prepared in co-authorship with an AI (Claude Fable 5, Variant A); curator Vitaly Reznik.

Fields of Study & Subjects

Computability Logic AI Algorithms Space Science and Extraterrestrial Life Philosophy and History of Science

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
9 August 2026
Language
EN
Document type
Preprint