Vitaliy Reznik

Warrant Containment in Dependency Graphs

A conclusion rests on grounds; when a ground is withdrawn, some conclusions stop standing. This note reports a small instrument that computes which — a two-valued calculus over marked inputs, machine-checked in Lean 4 on an empty axiom list, with a ledger over it — and spends mos...

The Paradox Docket: A Computable Classification of the Classical Paradoxes

For twenty-three centuries the word "paradox" has been handed out without an audit: it is worn by genuine logical dead ends, by harmless puzzles, and by plainly ill-posed questions. We conducted the audit. The classical collection — the liar and its family, Russell, Curry, Yablo,...

The Paradox Docket: A Computable Classification of the Classical Paradoxes

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...