scratch

§ Godel Operations

created 2022-04-28
  • A finite collection of operations that is used to create all constructible sets from ordinals.
  • Recall VVV, the von neumann universe, which we build by iterating powersets starting from ∅\emptyset∅. That is, f(V)=P(V)∪P(P(V))f(V) = \mathcal P(V) \cup \mathcal P (\mathcal P(V))f(V)=P(V)∪P(P(V))
  • We construct LLL sort of like VVV, but we build it by not taking P(V)P(V)P(V) fully, but only taking subsets that are carved out by using subsets via first order formulas used to filter the previous stage.
  • This makes sure that the resulting sets are independent of the peculiarities of the surrounding model, by sticking to FOL filtered formulas.
❦
Newer ৪ Blog ৪ Older