Forcing (computability): Difference between revisions

Content deleted Content added
Terminology: avoid defining a negation of a term ("incompatible") using a negation of a property, and defining the term as a negation of its negaton
Terminology: fix up my previous edit
Line 12:
;condition: An element in a notion of forcing. We say a condition <math>p</math> is stronger than a condition <math>q</math> just when <math>q \succ_P p</math>.
 
;compatible conditions: Given conditions <math>p,q</math> say that <math>p</math> and <math>q</math> are compatible if there is a condition <math>r</math> with <math> p \succ_P r</math> and <math>q \succ_P r</math>. <!-- Sometimes we will use '''consistent''' as a synonym for compatible. -->
 
;incompatible conditions (noted <math>p\mid q</math>): <math>p</math> is compatible withand <math>q</math> if they are not incompatible. <!-- Sometimes we will use '''consistent''' as a synonym for compatible. -->
 
;Filter : A subset <math>F</math> of a notion of forcing <math>P</math> is a filter if <math>p,q \in F \implies p \nmid q</math> and <math>p \in F \land q \succ_P p \implies q \in F</math>. In other words a filter is a compatible set of conditions closed under weakening of conditions.