An obstruction theorem establishes that Eval(C), MP(C), Cons(C), and LEM(C) are jointly incompatible for any closure predicate C on formulas built from bottom and implication.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Defines code structures on fibrations to simplify the proof of Löb's theorem in geminal categories and adds a new categorical version of the Gödel-Löb axiom.
The coq-paradoxes library mechanizes Burali-Forti, Diaconescu, Reynolds, and Hurkens paradoxes to specify the placement of impredicativity, large elimination restrictions, and universe discipline in Rocq's CIC kernel.
citing papers explorer
-
Remarks on Primitive Regulation
An obstruction theorem establishes that Eval(C), MP(C), Cons(C), and LEM(C) are jointly incompatible for any closure predicate C on formulas built from bottom and implication.
-
G\"odel coding on fibrations and geminal categories
Defines code structures on fibrations to simplify the proof of Löb's theorem in geminal categories and adds a new categorical version of the Gödel-Löb axiom.