You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
listed X = Σ xs ꞉ List X , ((x : X) → member x xs)
The propositional truncation of this should be equivalent to Kuratowski-finiteness. Proving this might be a fun exercise, but will involve some bureaucracy regarding the Fin type.
The text was updated successfully, but these errors were encountered:
In module
MLTT.List
, there is a notion calledlisted
.TypeTopology/source/MLTT/List.lagda
Lines 101 to 102 in d8e2220
The propositional truncation of this should be equivalent to Kuratowski-finiteness. Proving this might be a fun exercise, but will involve some bureaucracy regarding the
Fin
type.The text was updated successfully, but these errors were encountered: