نتایج جستجو برای: complete forcing number
تعداد نتایج: 1492568 فیلتر نتایج به سال:
In the paper we probe the possibilities of creating a Kurepa tree in a generic extension of a model of CH plus no Kurepa trees by an ω1-preserving forcing notion of size at most ω1. In the first section we show that in the Lévy model obtained by collapsing all cardinals between ω1 and a strongly inaccessible cardinal by forcing with a countable support Lévy collapsing order many ω1preserving fo...
An edge geodetic set of a connected graph G of order p ≥ 2 is a set S ⊆ V (G) such that every edge of G is contained in a geodesic joining some pair of vertices in S. The edge geodetic number g1(G) of G is the minimum cardinality of its edge geodetic sets and any edge geodetic set of cardinality g1(G) is a minimum edge geodetic set of G or an edge geodetic basis of G. An edge geodetic set S in ...
This thesis investigates possible initial segments of the degrees of constructibility. Specifically, we completely characterize the structure of degrees in generic extensions of the constructible universe L via forcing with Souslin trees. Then we use this characterization to realize any constructible dual algebraic lattice as a possible initial segment of the degrees of constructibility. In a s...
An Open Coloring Axiom type principle is formulated for uncountable cardinals and is shown to be a consequence of the Proper Forcing Axiom. Several applications are found. We also study dense C∗-embedded subspaces of ω∗, showing that there can be such sets of cardinality c and that it is consistent that ω∗ \ {p} is C∗-embedded for some but not all p ∈ ω∗.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید