Category Theory Illustrated – Types
abuseofnotation.github.io
Category Theory Illustrated – Types
1–10 of 26 posts
Re: Category Theory Illustrated – Types
#2Re: Category Theory Illustrated – Types
#3Re: Category Theory Illustrated – Types
#4Re: Category Theory Illustrated – Types
#5Re: Category Theory Illustrated – Types
#6Regarding Russell’s paradox, its dual is also interesting: Consider the set D := { s | s ∈ s }, the set of sets that do contain themselves. Does D contain itself? It might or it might not, neither causes a contradiction. Tnis shows that you don’t need an antinomy for a set comprehension to be ill-defined.
Also, in the usual ZF set theory, it's empty.
Re: Category Theory Illustrated – Types
#7Regarding Russell’s paradox, its dual is also interesting: Consider the set D := { s | s ∈ s }, the set of sets that do contain themselves. Does D contain itself? It might or it might not, neither causes a contradiction. Tnis shows that you don’t need an antinomy for a set comprehension to be ill-defined.
Why is it ill-defined? As you said, there's no contradiction. Also, in the usual ZF set theory, it's empty.
Re: Category Theory Illustrated – Types
#8Can it?
> a term can have only one type... Due to this law, types cannot contain themselves
Doesn't look like one follows from the other...
Re: Category Theory Illustrated – Types
#9> a set can contain itself Can it? > a term can have only one type... Due to this law, types cannot contain themselves Doesn't look like one follows from the other...