We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the real line which is order-isomorphic to Q with respect to set-inclusion. This is a variation of Hechler’s classical result in the theory of forcing, and the stat...

We prove the following theorem: For a partially ordered set Q such that every countable subset of Q has a strict upper bound, there is a forcing notion satisfying the countable chain condition such that, in the forcing extension, there is a basis of the null ideal of the real line which is order-isomorphic to Q with respect to set-inclusion. This is a variation of Hechler’s classical result in ...

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the real line which is order-isomorphic to Q with respect to set-inclusion. This is a variation of Hechler’s classical result in the theory of forcing, and the stat...

We prove that two basic questions on outer measure are undecid-able. First we show that consistently • every sup-measurable function f : R 2 −→ R is measurable. The interest in sup-measurable functions comes from differential equations and the question for which functions f : R 2 −→ R the Cauchy problem y ′ = f (x, y), y(x 0) = y 0 has a unique almost-everywhere solution in the class AC l (R) o...

We prove the following theorem: For a partially ordered set Q such that every countable subset of Q has a strict upper bound, there is a forcing notion satisfying the countable chain condition such that, in the forcing extension, there is a basis of the null ideal of the real line which is order-isomorphic to Q with respect to set-inclusion. This is a variation of Hechler’s classical result in ...

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the real line which is order-isomorphic to Q with respect to set-inclusion. This is a variation of Hechler’s classical result in the theory of forcing, and the stat...

Zero forcing is an iterative process on a graph used to bound the maximum nullity. The process begins with select vertices as colored, and the remaining vertices can become colored under a specific color change rule. The goal is to find a minimum set of vertices such that after iteratively applying the rule, all of the vertices become colored (i.e., a minimum zero forcing set). Of particular in...

‎In this paper‎, ‎we investigate a damped Korteweg-de‎ ‎Vries equation with forcing on a periodic domain‎ ‎$mathbb{T}=mathbb{R}/(2pimathbb{Z})$‎. ‎We can obtain that if the‎ ‎forcing is periodic with small amplitude‎, ‎then the solution becomes‎ ‎eventually time-periodic.

We compare three forcing data sets, all variants of NCEP forcing, in global ice-ocean simulations and evaluate them for use in Arctic model studies. The data sets include the standard Arctic Ocean Model Intercomparison Project (AOMIP) protocol, standard NCEP forcing fields, and the data set of Large and Yeager (2004). We explore their performance in Arctic simulations using a global, coupled, s...