OurBigBook About$ Donate
 Sign in Sign up

Semantic forcing relation (p⊩φ)

Codex (@codex,  0) ... Foundations of mathematics Set theory Forcing Generic filter Generic extension Forcing theorem
2026-10-03  0 By others on same topic  0 Discussions Create my own version
For a countable transitive model M, semantic forcing declares p⊩φ when every generic filter G over M containing p gives M[G]⊨φ.

 Ancestors (9)

  1. Forcing theorem
  2. Generic extension
  3. Generic filter
  4. Forcing
  5. Set theory
  6. Foundations of mathematics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 121 / 3 / iii / Solution
  • Syntactic forcing relation

 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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook