News for hackers. Stuff that matters.
Re:New Foundations is consistent – a difficult mathematical ... by Smaug123 on Tuesday April 23, 2024 @02:25PM (#40135348)
The thing I find really aesthetically pleasing about NF is how it adjusts the axiom of subset selection so that "the set of all sets" doesn't cause Russell's paradox. Basically it requires that the predicates you use to select subsets must obey a certain very lightweight type system. "x is not a member of itself" is not a well-typed question under any reasonable type system, and in particular it doesn't satisfy NF's "stratifiability" requirement, so you can't use it to construct the Russell's-paradox set of all sets which do not contain themselves.
Re:New Foundations is consistent – a difficult mathematical ... by juped on Wednesday April 24, 2024 @02:13AM (#40141206)
You just move the sorts around, you don't get rid of having to have sorts. I guess a rug with dirt swept under it is more aesthetically pleasing than a rug with dirt on top of it?
Re:New Foundations is consistent – a difficult mathematical ... by epgui on Wednesday April 24, 2024 @09:49AM (#40144399)
There is no notion of types in naive set theory.
Re:New Foundations is consistent – a difficult mathematical ... by juped on Friday April 26, 2024 @08:02AM (#40168301)
No one said anything about either types or naive set theory.
Re:New Foundations is consistent – a difficult mathematical ... by psychoslave on Wednesday April 24, 2024 @06:37AM (#40142710)
That sounds extremely underwhelming to my mind.

Like having a programming language sold as free of any awful metaprogramming constructions (and induced headaches) through guarantees that no metaprogramming at all can be done in it.

A language that forbids to talk about its own grammatical structures is doomed to see its users abandon or extend it when they will inevitably deal with a situation where exchanging about the communication tool at hand is required to appropriately deal with its possibilities, expectable behaviors and limits.

Re:New Foundations is consistent – a difficult mathematical ... by epgui on Wednesday April 24, 2024 @09:48AM (#40144383)
Your comment doesn't make any sense. Also:

> A language that forbids to talk about its own grammatical structures

That's just not the case, and it's not what is being claimed here.

Re:New Foundations is consistent – a difficult mathematical ... by psychoslave on Wednesday April 24, 2024 @11:24AM (#40145497)
I’m not acquainted with NF, but to my perspective what the comment I was replying to was suggesting is that the structures can’t express anything about a structure of the same level of comprehension.

Which, to my mind, implies that an expression should not be allowed to embed an expression. Which is roughly equivalent to disallow a code to embed code written in the same language, let alone a code aware of the language structure and able manipulate the current code base abstract syntax tree or any equivalent facility.

Once again, I don’t claim this about NF, which I wasn’t aware of before this thread. I never dug into Quine’s work to be transparent on the matter.