In this paper, binomial difference ideals are studied. Three canonical representations for Laurent binomial difference ideals are given in terms of the reduced Gröbner basis of Z[x]-lattices, regular and coherent difference ascending chains, and partial characters over Z[x]-lattices, respectively. Criteria for a Laurent binomial difference ideal to be reflexive, prime, well-mixed, and perfect a...

Department of Mathematics, Jadavpur University Kolkata-700032, India manasi−[email protected] Abstract The notion of intuitionistic fuzzy set was introduced by Atanassov as a generalization of the notion of fuzzy set. In this paper we apply this concept of Atanassov to ideals, prime ideals and semiprime ideals of Γsemigroups in order to obtain some characterization theorems. We also introduce the not...

This paper investigates situations where a property of a ring can be tested on a set of “prime right ideals.” Generalizing theorems of Cohen and Kaplansky, we show that every right ideal of a ring is finitely generated (resp. principal) iff every “prime right ideal” is finitely generated (resp. principal), where the phrase “prime right ideal” can be interpreted in one of many different ways. We...

Recall that a commutative ring R is said to be a pseudo-valuation ring if every prime ideal of R is strongly prime. We define a completely pseudovaluation ring. Let R be a ring (not necessarily commutative). We say that R is a completely pseudo-valuation ring if every prime ideal of R is completely prime. With this we prove that if R is a commutative Noetherian ring, which is also an algebra ov...

For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or antichains. This allows us to prove some consequences of the Boolean Prime Ideal theorem using arguments in the style of those that use Zorn’s Lemma, or Martin’s Axiom.

We introduce compactness theorems for generalized colorings and derive several particular compactness theorems from them. It is proved that the theorems and many of their consequences are equivalent in ZF set theory to BPI, the Prime Ideal Theorem for Boolean algebras. keywords: generalized graph colorings, compactness, prime ideal theorem MSC: 05C15; 03E25 .

In this paper, we introduce a method by which we can find a close connection between the set of prime $z$-ideals of $C(X)$ and the same of $C(Y)$, for some special subset $Y$ of $X$. For instance, if $Y=Coz(f)$ for some $fin C(X)$, then there exists a one-to-one correspondence between the set of prime $z$-ideals of $C(Y)$ and the set of prime $z$-ideals of $C(X)$ not containing $f$. Moreover, c...