Proof. Clearly (A ∩ B)[G] ⊆ A[G] ∩ B[G]. Let us show the opposite inclusion. It is enough to deal with ordinals. Note that B[G]∩ V = B, since Q ⊆ B. Let δ ∈ A[G]∩B[G]∩On = A[G]∩B ∩On. Pick a canonical name δ ∼ ∈ A such that δ ∼ = δ. It is of the form ⟨⟨qi, τ̌i⟩ | i < ρ ≤ |Q|⟩, where τi’s are in B and ⟨qi | i < ρ⟩ is a maximal antichain. Now, δ ∼ ∈ B, since |Q|B ⊆ B. So, δ ∼ ∈ A∩B. Hence, δ = δ ∼...

Itay Neeman found in [7] a new way of iterating proper forcing notions and extended it in [8] to א2. In [5] his construction for א1 ([7]) was generalized to semi-proper forcing notions. We apply here finite structures with pistes in order extend the construction to higher cardinals. In the final model a very weak form of SPFA will hold. 1 Basic definitions and main results The following two def...

This paper uses the special theory of relativity (SR) to introduce a novel solution to EinsteinPodolsky-Rosen (EPR) paradox. More specifically, the faster-than-light (FTL) communication is described to explain two types of EPR paradox experiments: photon polarization and electronpositron pair spins. And most importantly, this paper explains why this FTL communication does not violate the SR.

Implementation of faster-than-light (FTL) interstellar travel via traversable wormholes, warp drives, or other spacetime modification schemes generally requires the engineering of spacetime into very specialized local geometries. The analysis of these via Einstein’s General Theory of Relativity plus the resultant equations of state demonstrates that such geometries require the use of “exotic” m...

Within an axiomatic framework, we prove that the existence of faster than light (FTL) particles is consistent with (does not contradict) the dynamics of Einstein’s special relativity. The proof goes by constructing a model of relativistic dynamics where FTL particles can move with arbitrary speeds. To have a complete picture, we not only construct an appropriate model but explicitly list all th...

Recently, the in-page logging (IPL) scheme has been proposed to improve the overall write performance of flash memory by avoiding costly erase operations that would be caused by small random write requests common in database applications. In this paper, we identify the problems inherent in the existing design of disk-based B-tree index, and present the design and implementation of the IPL B-tre...