نتایج جستجو برای: undesirable variables
تعداد نتایج: 328155 فیلتر نتایج به سال:
BACKGROUND The use of vertical chute marine evacuation systems (MES) is now well established on board marine passenger vessels; this system has yet to be deployed in an emergency situation, however, it has been associated with a fatality and several major injuries during training. Brunel University's Ethics Committee endorsed an initial retrospective cross sectional study (Harwood and Farrow, 2...
introduction: health promoting lifestyle is one of the determinants of health. university years are important phase of life when one can develop health promoting lifestyle. given the high cost of healthcare there is need of shift from a treatment based approach to a preventive approach in which appropriate methods should be developed to promote health and productivity among youth. objective: th...
The paper consists of two parts. The rst one is a concise introduction to epistemic (both propositional and predicate) logic with common knowl-ege operator. As the full common knowledge predicate logics are not even recursively enumerable, in the second part we introduce and investigate the monodic fragment of these logics which allows applications of the epistemic operators to formulas with at...
Let z = (z1, z2, · · · , zn) be noncommutative free variables and t a formal parameter which commutes with z. Let k be a unital commutative ring of any characteristic and Ft(z) = z−Ht(z) with Ht(z) ∈ k[[t]]〈〈z〉〉 ×n and o(Ht(z)) ≥ 2. Note that Ft(z) can be viewed as a deformation of the formal map F (z) := z−Ht=1(z) when it makes sense. The inverse map Gt(z) of Ft(z) can always be written as Gt(...
In this paper we prove decidability of two kinds of branching time temporal logics. First we show that the non-local version of propositional , in which truth values of atoms may depend on the branch of evaluation, is decidable. Then we use this result to establish decidability of various fragments of quantified , where the next-time operator can be applied only to formulas with at most one fre...
Affine λ-terms are λ-terms in which each bound variable occurs at most once and linear λ-terms are λ-terms in which each bound variable occurs once. and only once. In this paper we count the number of closed affine λ-terms of size n, closed linear λ-terms of size n, affine β-normal forms of size n and linear β-normal forms of size n, for different ways of measuring the size of λ-terms. From the...
We consider reductions in Orthogonal Expression Reduction Systems (OERS), that is, Orthogonal Term Rewriting Systems with bound variables and substitutions, as in the-calculus. We design a strategy that for any given term t constructs a longest reduction starting from t if t is strongly normalizable, and constructs an innnite reduction otherwise. The Conservation Theorem for OERSs follows easil...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید