Revision as of 04:56, 11 January 2008 edit Zero sharp (talk \| contribs) Extended confirmed users 1,795 edits adding references template ← Previous edit		Revision as of 20:21, 11 January 2008 edit undo Zero sharp (talk \| contribs) Extended confirmed users 1,795 edits m →Terminology: 'Cohen' is a proper name; capitalize Next edit →
Line 22: ; Cohen forcing: The notion of forcing <math>C</math> where conditions are elements of <math>(2^{<\omega}</math> and <math>\tau \succ_C \sigma \iff \sigma \supset \tau</math> Note that for ~~cohen~~Cohen forcing <math>\succ_{C}</math> is the '''reverse''' of the containment relation. This leads to an unfortunate notational confusion where some recursion theorists reverse the direction of the forcing partial order (exchanging <math>\succ_P</math> with <math>\prec_P</math> which is more natural for Cohen forcing but is at odds with the notation used in set theory. == Generic objects ==

Forcing (computability): Difference between revisions