The paper deals with the F-transform with polynomial components with respect to a generalized fuzzy partition given by B-splines. We investigate approximation properties of the inverse F-transform in this case and prove that using B-splines allows us to improve the quality of approximation of smooth functions.

We develop the concept of a general factoraggre-gation operator introduced by the authors on the basis of an equivalence relation and applied in two recent papers for analysis of bilevel linear programming solving parameters. In the paper this concept is generalized by using a fuzzy equivalence relation instead of the crisp one. By using a left-continuous t-norm and its residuum we define and investigate two modifications of such generalized construction: upper and lower generalized factoraggregations. These generalized factoraggregations can be used for construction of extensional fuzzy sets.

This work is closely related to our previous papers on algorithms of approximation under L-fuzzy information. In the classical theory of approximation central algorithms were worked out on the basis of usual, that is crisp splines. We describe central methods for solution of linear problems with balanced L-fuzzy information and develop the concept of L-fuzzy splines.

We continue to develop a construction of an L-fuzzy valued measure extending a crisp measure defined on a σ-algebra of crisp sets to an L-fuzzy valued measure defined on a TM- tribe. We describe two equivalent approaches to define an L-fuzzy valued integral of non-negative measurable functions.