A historial query regarding Scott's trick


Scott's trick, of replacing equivalence classes modulo R with sets of
the form

{y | xRy and for all z with rank(z) < rank(y), not xRz}

is well-known, and crops up now and then in sci.logic and sci.math,
usually in discussions about cardinality in absence of choice. I
wonder, though, if the trick was first introduced in the ultrapower
construction in Scott's proof that the existence of a measurable
implies that not all sets are constructible?

--
Aatu Koskensilta (aatu.koskensilta@xxxxxx)

"Wovon man nicht sprechen kann, darüber muss man schweigen"
- Ludwig Wittgenstein, Tractatus Logico-Philosophicus
.

Relevant Pages

  • Re: simple module method call question
    ... Ben Lovell wrote: ... construction using a variable, in the final version ... This always fails. ... I've tried every trick I can think of, ...
    (comp.lang.ruby)
  • Re: A historial query regarding Scotts trick
    ... of replacing equivalence classes modulo R with sets of ... wonder, though, if the trick was first introduced in the ultrapower ... construction in Scott's proof that the existence of a measurable ...
    (sci.logic)
  • Re: How To write syntax
    ... if both X and Y are multiples of 25 then the odd and even ... trick will work... ... to use this construction, you can change the If condition to just this.... ...
    (microsoft.public.vb.general.discussion)