The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 201 –
208 of
208
A variety of numerical approaches for reasoning with uncertainty have been investigated in the literature. We propose rough membership functions, rm-functions for short, as a basis for such reasoning. These functions have values in the interval [0,1] and are computable on the basis of the observable information about the objects rather than on the objects themselves. We investigate properties of the rm-functions. In particular, we show that our approach is intensional with respect to the class of...
Rough Set Theory (RST) is a mathematical formalism for representing uncertainty that can be considered an extension of the classical set theory. It has been used in many different research areas, including those related to inductive machine learning and reduction of knowledge in knowledge-based systems. One important concept related to RST is that of a rough relation. This paper rewrites some properties of rough relations found in the literature, proving their validity.
-graphs are a type of graphs associated to groups, which were proposed by A. Bretto and A. Faisant (2005). In this paper, we first give some theorems regarding -graphs. Then we introduce the notion of rough -graphs and investigate some important properties of these graphs.
As a generalization of filters in lattice implication algebras, the notion of rough filters in lattice implication algebras is introduced, and some of their properties are considered.
We show that a comeager Π₁¹ hereditary family of compact sets must have a dense subfamily which is also hereditary. Using this, we prove an “abstract” result which implies the existence of independent ℳ ₀-sets, the meagerness of ₀-sets with the property of Baire, and generalizations of some classical results of Mycielski. Finally, we also give some natural examples of true sets.
We introduce a generalization of a Dowker space constructed from a Suslin tree by Mary Ellen Rudin, and the rectangle refining property for forcing notions, which modifies the one for partitions due to Paul B. Larson and Stevo Todorčević and is stronger than the countable chain condition. It is proved that Martin's Axiom for forcing notions with the rectangle refining property implies that every generalized Rudin space constructed from Aronszajn trees is non-Dowker, and that the same can be forced...
Currently displaying 201 –
208 of
208