A natural generalization of Cohen's set of forcing conditions (the t w ~ valued functions with domain a finite subset of w) is the set of twovalued functions with domain an element of an ideal J on ~. The I~roblem treated in this paper is to determine when such forcing yields a generic real of minimal degree of constructibility. A :;imple decomposition argument shows that the non-maximality of ...

In this paper we examine the implications of ideal and anti-ideal decision-making units on Benefit-of-the-Doubt (BoD) model. particular, verify that, in presence an (anti-ideal) unit, efficiency scores BoD (inverted BoD) model can be obtained without solving relevant linear programming problems. case, it suffices to choose largest (smallest) element-wise divided component indicators evaluated u...

The paper is devoted to studying of subsets multidimensional local fields such that any power series with coefficients from this subset converges when a maximal ideal element substituted for variable.

The purposes of this study were to conceptualize moral identity as moral ideal self, to develop a measure of this construct, to test for age and gender differences, to examine links between moral ideal self and adolescent outcomes, and to assess purpose and social responsibility as mediators of the relations between moral ideal self and outcomes. Data came from a local school sample (Data Set 1...

This paper facilitates the computation of tight closure by giving giving upper and lower bounds on the degrees of elements that need to be checked for inclusion in the tight closure of certain homogeneous ideals in a graded ring. Differential operators are introduced to the study of tight closure, and used to prove that the degree of any element in the tight closure of a homogeneous ideal (but ...

We use Gröbner bases and a theorem of Handelman to show that an ideal I of R[x1, . . . , xk] contains a polynomial with positive coefficients if and only if no initial ideal inv(I), v ∈ R, has a positive zero. Let R = R[x1, . . . , xk], R = R[x1, . . . , xk] and, considering Laurent polynomials, let R̃ = R[x1 , . . . , xk ], R̃ = R[x ± 1 , . . . , x ± k ]. For a = (a1, . . . , ak) ∈ Z, write x = ...

let $s$ be an ordered semigroup. a fuzzy subset of $s$ is anarbitrary mapping   from $s$ into $[0,1]$, where $[0,1]$ is theusual interval of real numbers. in this paper,  the concept of fuzzygeneralized bi-ideals of an ordered semigroup $s$ is introduced.regular ordered semigroups are characterized by means of fuzzy leftideals, fuzzy right ideals and fuzzy (generalized) bi-ideals.finally, two m...

gears are one of the most critical components in power transmission system of an automobile and also many rotating machinery. many studies have been conducted on optimum gear design. the main objective is to design different aluminium metal matrix composite spur gears before and after optimization. aluminium metal matrix material composites are preferred mostly due to their low density. also th...

Let g be a complex simple Lie algebra. Fix a Borel subalgebra b and a Cartan subalgebra t ⊂ b. The nilpotent radical of b is denoted by u. The corresponding set of positive (resp. simple) roots is ∆ (resp. Π). An ideal of b is called ad-nilpotent, if it is contained in [b, b]. The theory of ad-nilpotent ideals has attracted much recent attention in the work of Kostant, Cellini-Papi, Sommers, an...

We introduce the notion of clean ideal, which is a natural generalization of clean rings. It is shown that every matrix ideal over a clean ideal of a ring is clean. Also we prove that every ideal having stable range one of a regular ring is clean. These generalize the corresponding results for clean rings. 1. Introduction. Let R be a unital ring. We say that R is a clean ring in case every elem...