Comum · Saberes
Scott's trick
Set theory method
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.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
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 representatives for ordinal numbers in ZF, Zermelo–Fraenkel set theory without the axiom of choice (Forster 2003:182). The method was introduced by Dana Scott (1955). Beyond the problem of defining set representatives for ordinal numbers, Scott's trick can be used to obtain representatives for cardinal numbers and more generally for isomorphism types, for example, order types of linearly ordered sets (Jech 2003:65). It is credited to be indispensable (even in the presence of the axiom of choice) when taking ultrapowers of proper classes in model theory. (Kanamori 1994:47)
Texto: Wikipédia em inglês, CC BY-SA 4.0. ·
Cartas próximas
-
★★★
Axiomas de Zermelo-Fraenkel
Sistema axiomático essencial para a construção da teoria dos conjuntos, desenvolvido por Zermelo e Fraenkel
-
★
Hierarquia aritmética
-
F★
Forçamento
-
T★
Teoria de conjuntos de Zermelo
-
W★★
Well-ordering theorem
Set-theoretic theorem or principle, equivalent to the axiom of choice
-
A★★
Axioma da separação
Afirmativa de que é possível criar subconjuntos de um conjunto original que satisfaçam certa condição