ncfavier
/ Russell.agda
Last active
January 7, 2026 07:23
Two versions of Russell's paradox in type theory
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| {-# OPTIONS --type-in-type --with-K #-} | |
| open import Data.Product | |
| open import Relation.Binary.PropositionalEquality | |
| open import Relation.Nullary | |
| open import Data.Empty | |
| {- | |
| Russell's paradox can be encoded in MLTT + K + U:U, as formalised in | |
| https://github.com/KonjacSource/Russell-paradox-in-TT. |