We consider Bayesian information collection, in which a measurement policy collects information to support a future decision. This framework includes ranking and selection, continuous global optimization, and many other problems in sequential experimental design. We give a sufficient condition under which measurement policies sample each measurement type infinitely often, ensuring consistency, ...

Many consistency criteria have been considered in databases and the causal consistency is one of them. The causal consistency model has gained much attention in recent years because it provides ordering of relative operations. The causal consistency requires that all writes, which are potentially causally related, must be seen in the same order by all processes. The causal consistency is a weak...

We develop the basic theory of hod mice below ADR+“Θ is regular”. Woven into this theory is a proof of the Mouse Set Conjecture in the minimal model of ADR + “Θ is regular”. Once the basic theory is available, it can be applied to questions of evaluating consistency strengths of set theoretic hypothesis in terms of large cardinals. One such application is that the consistency of ADR + “Θ is reg...

Building on the work of Schimmerling ([8]) and Steel ([14]), we show that the failure of square principle at a singular strong limit cardinal implies that there is a non-tame mouse. The proof presented is the first inductive step beyond L(R) of the core model induction that is aimed at getting a model of ADR + “Θ is regular” from the failure of square at a singular strong limit cardinal or PFA....

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V |= “ZFC + Ω is the least inaccessible limit of measurable limits of supercompact cardinals + f : Ω → 2 is a function”, then there is a partial ordering P ∈ V so that for...

We provide upper and lower bounds in consistency strength for the theories “ZF + ¬ACω + All successor cardinals except successors of uncountable limit cardinals are regular + Every uncountable limit cardinal is singular + The successor of every uncountable limit cardinal is singular of cofinality ω” and “ZF + ¬ACω + All successor cardinals except successors of uncountable limit cardinals are re...

Concurrency control mechanisms such as turn-taking, locking, serialization, transactional locking mechanism, and operational transformation try to provide data consistency when concurrent activities are permitted in a reactive system. Locks are typically used in transactional models for assurance of data consistency and integrity in a concurrent environment. In addition, recovery management is ...