A first-order formula is modulo ZFC if that theory proves it equivalent, with the same free variables, both to a Sigma-one formula in set theory and to a universal unbounded quantifier block with a bounded formula in set theory as matrix. The theory used for provable equivalence matters: modulo ZF is a stronger requirement.

Ancestors (10)

  1. Lévy hierarchy
  2. Set-theoretic absoluteness
  3. Formula relativization to a class
  4. Transitive class
  5. Class in set theory
  6. Set theory
  7. Foundations of mathematics
  8. Area of mathematics
  9. Mathematics
  10. Home

Incoming links (1)

Synonyms (1)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version