a -> Boolean
. Stating that sets are well-defined is equivalent to stating that their function terminates. Saturday, October 2, 2010
Sets are functions
Sets are functions of type
Subscribe to:
Post Comments (Atom)
So wrong. EVERYTHING is of type a -> Boolean. Even functions. Since this is a universal property and universal properties are meaningless, this is meaningless.
ReplyDeleteMath is about the creation of universal properties using other universal properties; I wouldn't call it meaningless.
ReplyDelete