In order to present this result, we approach it by proving some preliminary theorems about different forcings which capture the main ideas in a simpler setting. For the entirety of the notes we work with an increasing sequence of large cardinals 〈κn | n < ω〉 with κ =def supn<ω κn. The large cardinal hypothesis that we use varies with the forcing. A recurring theme is the idea of a cell. A cell ...

begin{abstract} If $F,D:Rto R$ are additive mappings which satisfy $F(x^{n}y^{n})=x^nF(y^{n})+y^nD(x^{n})$ for all $x,yin R$. Then, $F$ is a generalized left derivation with associated Jordan left derivation $D$ on $R$. Similar type of result has been done for the other identity forcing to generalized derivation and at last an example has given in support of the theorems. end{abstract}

We investigate forcing notions with the rectangle refining property, which is stronger than the countable chain condition, and fragments of Martin’s Axiom for such forcing notions. We prove that it is consistent that every forcing notion with the rectangle refining property has precaliber א1 but MAא1 for forcing notions with the rectangle refining property fails.

A strong open-ocean convection event was observed in the Northwestern Mediterranean sea during the 1986-87 winter. This period was used as a case study to evaluate the impact of the spatial resolution of atmospheric forcing on deep convection modeling. Twin numerical experiments were performed with an oceanic model forced by atmospheric forcing sets with different resolutions. A low resolution ...

Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced in physics, computer science and network science, areas where line digraphs are frequently used as models. Zero forcing is also related to power domination, a propagation process that models the monitoring of electric...