请输入您要查询的字词:

 

单词 CompositionOfForcingNotions
释义

composition of forcing notions


Suppose P is a forcingMathworldPlanetmath notion in 𝔐 and Q^ is some P-name such that PQ^ is a forcing notion.

Then take a set of P-names Q such that given a P name Q~ of Q, PQ~=Q^ (that is, no matter which genericPlanetmathPlanetmathPlanetmath subset G of P we force with, the names in Q correspond precisely to the elements of Q^[G]). We can define

P*Q={p,q^pP,q^Q}

We can define a partial orderMathworldPlanetmath on P*Q such that p1,q^1p2,q^2 iff p1Pp2 and p1q^1Q^q^2. (A note on interpretationMathworldPlanetmathPlanetmath: q1 and q2 are P names; this requires only that q^1q^2 in generic subsets contain p1, so in other generic subsets that fact could fail.)

Then P*Q^ is itself a forcing notion, and it can be shown that forcing by P*Q^ is equivalentMathworldPlanetmathPlanetmathPlanetmathPlanetmathPlanetmath to forcing first by P and then by Q^[G].

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 4:03:50