Talk:Set theory/Draft: Difference between revisions
Jump to navigation
Jump to search
imported>Boris Tsirelson (probably approvable but) |
imported>Boris Tsirelson (some minor errors) |
||
| Line 13: | Line 13: | ||
*"NFU, whose consistency is implied by that of simple type theory". | *"NFU, whose consistency is implied by that of simple type theory". | ||
[[User:Boris Tsirelson|Boris Tsirelson]] 08:19, 18 May 2010 (UTC) | [[User:Boris Tsirelson|Boris Tsirelson]] 08:19, 18 May 2010 (UTC) | ||
Also I observe some minor errors: | |||
*"difference X-Y or X\Y contains of all those" — either "consists of all" or "contains all", I guess; | |||
*"X∪Y ={x|P and Q}, X∩Y={x|P or Q}" — swap them. | |||
[[User:Boris Tsirelson|Boris Tsirelson]] 08:34, 18 May 2010 (UTC) | |||
Revision as of 02:34, 18 May 2010
Nice work! Boris Tsirelson 18:22, 16 September 2009 (UTC)
- Thanks! I only joined CZ because I thought the world needed a decent introductory account of set theory :-) Mark Wainwright 04:22, 9 May 2010 (UTC)
- Are you sure the world needs nothing else? :-) Boris Tsirelson 07:57, 9 May 2010 (UTC)
Probably this article is approvable. For now I am not ready to approve it, because some finer points are beyond my competence. I understand the given text about that, but I have no other sources to be sure. Namely:
- "An ingenious axiom of Goedel's, Limitation of Size";
- "Montague proved in 1961 that ZF cannot be finitely axiomatised";
- "NF ... is finitely axiomatisable";
- "NFU, whose consistency is implied by that of simple type theory".
Boris Tsirelson 08:19, 18 May 2010 (UTC)
Also I observe some minor errors:
- "difference X-Y or X\Y contains of all those" — either "consists of all" or "contains all", I guess;
- "X∪Y ={x|P and Q}, X∩Y={x|P or Q}" — swap them.
Boris Tsirelson 08:34, 18 May 2010 (UTC)