Displaying similar documents to “On the Lattice of Intervals and Rough Sets”

Collective Operations on Number-Membered Sets

Artur Korniłowicz (2009)

Formalized Mathematics

Similarity:

The article starts with definitions of sets of opposite and inverse numbers of a given number membered set. Next, collective addition, subtraction, multiplication and division of two sets are defined. Complex numbers cases and extended real numbers ones are introduced separately and unified for reals. Shortcuts for singletons cases are also defined.

Relational Formal Characterization of Rough Sets

Adam Grabowski (2013)

Formalized Mathematics

Similarity:

The notion of a rough set, developed by Pawlak [10], is an important tool to describe situation of incomplete or partially unknown information. In this article, which is essentially the continuation of [6], we try to give the characterization of approximation operators in terms of ordinary properties of underlying relations (some of them, as serial and mediate relations, were not available in the Mizar Mathematical Library). Here we drop the classical equivalence- and tolerance-based...

Semantics of MML Query

Grzegorz Bancerek (2012)

Formalized Mathematics

Similarity:

In the paper the semantics of MML Query queries is given. The formalization is done according to [4]

Semiring of Sets: Examples

Roland Coghetto (2014)

Formalized Mathematics

Similarity:

This article proposes the formalization of some examples of semiring of sets proposed by Goguadze [8] and Schmets [13].

Properties of forcing preserved by finite support iterations

Miroslav Repický (1991)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We shall investigate some properties of forcing which are preserved by finite support iterations and which ensure that unbounded families in given partially ordered sets remain unbounded.