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: Medium Entry average rating: No information on entry rating
forcing relation (Definition)

If $ \mathfrak{M}$ is a transitive model of set theory and $ P$ is a partial order then we can define a forcing relation:

$\displaystyle p\Vdash_P \phi(\tau_1,\ldots,\tau_n)$
($ p$ forces $ \phi(\tau_1,\ldots,\tau_n)$)

for any $ p\in P$, where $ \tau_1,\ldots,\tau_n$ are $ P$- names.

Specifically, the relation holds if for every generic filter $ G$ over $ P$ which contains $ p$,

$\displaystyle \mathfrak{M}[G]\vDash \phi(\tau_1[G],\ldots,\tau_n[G])$

That is, $ p$ forces $ \phi$ if every extension of $ \mathfrak{M}$ by a generic filter over $ P$ containing $ p$ makes $ \phi$ true.

If $ p\Vdash_P \phi$ holds for every $ p\in P$ then we can write $ \Vdash_P\phi$ to mean that for any generic $ G\subseteq P$, $ \mathfrak{M}[G]\vDash\phi$.



"forcing relation" is owned by Henry.
(view preamble)

View style:

See Also: forcing

Also defines:  forcing relation, forces
Log in to rate this entry.
(view current ratings)

Cross-references: mean, contains, filter, generic, relation, partial order, set theory, transitive
There are 58 references to this entry.

This is version 2 of forcing relation, born on 2002-07-30, modified 2002-07-31.
Object id is 3238, canonical name is ForcingRelation.
Accessed 7099 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.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

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