| Display title | Scott's trick |
| Default sort key | Scott's trick |
| Page length (in bytes) | 5,160 |
| Namespace ID | 0 |
| Page ID | 207695 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>JMinHep |
| Date of page creation | 16:26, 9 May 2022 |
| Latest editor | imported>JMinHep |
| Date of latest edit | 16:26, 9 May 2022 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In set theory, Scott's trick is a method for giving a definition of equivalence classes for equivalence relations on a proper class (Jech 2003:65) by referring to levels of the cumulative hierarchy.
The method relies on the axiom of regularity but not on the axiom of choice. It can be used to define... |
