We give a new constructive definition for Noetherian rings. It has a very concrete statement and is nevertheless strong enough to prove constructively the termination of algorithms involving “trees of ideals”. The efficiency of such algorithms (at least for providing clear and intuitive constructive proofs) is illustrated in a section about Lasker–Noether rings: we give constructive proofs for ...

A set X ⊆ R is strongly meager if for every measure zero set H, X + H = R. Let SM denote the collection of strongly meager sets. We show that assuming CH, SM is not an ideal.

in this paper a particular case of z-ideals, called strongly z-ideal, is defined by introducing zero sets in pointfree topology. we study strongly z-ideals, their relation with z-ideals and the role of spatiality in this relation. for strongly z-ideals, we analyze prime ideals using the concept of zero sets. moreover, it is proven that the intersection of all zero sets of a prime ideal of c(l),...

In the study of double-loop computer networks, the diagrams known as L-shapes arise as a graphical representation of an optimal routing for every graph’s node. The description of these diagrams provides an efficient method for computing the diameter and the average minimum distance of the corresponding graphs. We extend these diagrams to multiloop computer networks. For each Cayley digraph with...