An analytic equivalence relation not arising from a Polish group action
Our thesis is that computing with words needs to account for the uncertainties associated with the meanings of words, and that these uncertainties require using type-2 fuzzy sets. Doing this leads to a proposed architecture for making it judgments by means of computing with words, i.e., to a perceptual computer-the Per-C. The Per-C includes an encoder, a type-2 rule-based fuzzy logic system, and a decoder. It lets all human-computer interactions be performed using words. In this paper, a quantitative...
An axiomatization of fuzzy classes more general than usual fuzzy sets is proposed. Connections and interpretations with other axiomatizations of set theory and fuzzy set theory are investigated.
In this paper, a construction method on a bounded lattice obtained from a given t-norm on a subinterval of the bounded lattice is presented. The supremum distributivity of the constructed t-norm by the mentioned method is investigated under some special conditions. It is shown by an example that the extended t-norm on from the t-norm on a subinterval of need not be a supremum-distributive t-norm. Moreover, some relationships between the mentioned construction method and the other construction...
In this paper, we generally study an order induced by nullnorms on bounded lattices. We investigate monotonicity property of nullnorms on bounded lattices with respect to the -partial order. Also, we introduce the set of incomparable elements with respect to the F-partial order for any nullnorm on a bounded lattice. Finally, we investigate the relationship between the order induced by a nullnorm and the distributivity property for nullnorms.
In the 1960s Professor Hu Guoding proposed a method of measuring information based on the idea that connotation and denotation of a concept satisfies inverse ratio rule. According to this information measure, firstly we put forward the information quantity for information systems and decision systems; then, we discuss the updating mechanism of information quantity for decision systems; finally, we give an attribute reduction algorithm for decision tables with dynamically varying attribute values....
Using the method of forcing we construct a model for ZFC where CH does not hold and where there exists a connected compact topological space K of weight such that every operator on the Banach space of continuous functions on K is multiplication by a continuous function plus a weakly compact operator. In particular, the Banach space of continuous functions on K is indecomposable.
A space is called connectifiable if it can be densely embedded in a connected Hausdorff space. Let be the following statement: “a perfect -space with no more than clopen subsets is connectifiable if and only if no proper nonempty clopen subset of is feebly compact". In this note we show that neither nor is provable in ZFC.
Given a topological space ⟨X,⟩ ∈ M, an elementary submodel of set theory, we define to be X ∩ M with topology generated by . Suppose is homeomorphic to the irrationals; must ? We have partial results. We also answer a question of Gruenhage by showing that if is homeomorphic to the “Long Cantor Set”, then .
We present an extension of the classical isomorphic classification of the Banach spaces C([0,α]) of all real continuous functions defined on the nondenumerable intervals of ordinals [0,α]. As an application, we establish the isomorphic classification of the Banach spaces of all real continuous functions defined on the compact spaces , the topological product of the Cantor cubes with smaller than the first sequential cardinal, and intervals of ordinal numbers [0,α]. Consequently, it is relatively...