PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very low Entry average rating: No information on entry rating
equivalence of forcing notions (Definition)

Let $ P$ and $ Q$ be two forcing notions such that given any generic subset $ G$ of $ P$ there is a generic subset $ H$ of $ Q$ with $ \mathfrak{M}[G]=\mathfrak{M}[H]$ and vice-versa. Then $ P$ and $ Q$ are equivalent.

Since if $ G\in\mathfrak{M}[H]$, $ \tau[G]\in\mathfrak{M}$ for any $ P$-name $ \tau$, it follows that if $ G\in\mathfrak{M}[H]$ and $ H\in\mathfrak{M}[G]$ then $ \mathfrak{M}[G]=\mathfrak{M}[H]$.



"equivalence of forcing notions" is owned by Henry.
(view preamble)

View style:

See Also: forcing, proof that forcing notions are equivalent to their composition

Other names:  equivalent

Attachments:
forcings are equivalent if one is dense in the other (Result) by Henry
Log in to rate this entry.
(view current ratings)

Cross-references: subset, generic, forcing
There are 143 references to this entry.

This is version 2 of equivalence of forcing notions, born on 2002-08-01, modified 2003-01-11.
Object id is 3257, canonical name is EquivalenceOfForcingNotions.
Accessed 12675 times total.

Classification:
AMS MSC03E35 (Mathematical logic and foundations :: Set theory :: Consistency and independence results)
 03E40 (Mathematical logic and foundations :: Set theory :: Other aspects of forcing and Boolean-valued models)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)