On idempotent binary relations on a finite set
We investigate some geometrical properties of squares of special Sierpiński sets. In particular, we prove that (under CH) there exists a Sierpiński set S and a function p: S → S such that the images of the graph of this function under π'(⟨x,y⟩) = x - y and π''(⟨x,y⟩) = x + y are both Lusin sets.
A Russell set is a set which can be written as the union of a countable pairwise disjoint set of pairs no infinite subset of which has a choice function and a Russell cardinal is the cardinal number of a Russell set. We show that if a Russell cardinal has a ternary partition (see Section 1, Definition 2) then the Russell cardinal fails to have such a partition. In fact, we prove that if a ZF-model contains a Russell set, then it contains Russell sets with ternary partitions as well as Russell...
There exists a natural extension of the notion of preorder from binary relations onto relations whose arities are arbitrary ordinals. In the article we find a condition under which extended preorders coincide with preorders if viewed categorically.
In this short note we show that for fuzzy sets of type II the additive rule for cardinalities holds true. The proof of this result requires an application of approximate reasoning as means of inference by use of the entailment principle.
A considerable amount of research has been done on the notions of pseudo complement, intersection and union of fuzzy sets [1], [4], [11]. Most of this work consists of generalizations or alternatives of the basic concepts introduced by L. A. Zadeh in his famous paper [13]: generalization of the unit interval to arbitrary complete and completely distributive lattices or to Boolean algebras [2]; alternatives to union and intersection using the concept of t-norms [3], [10]; alternative complements...