Displaying 781 – 800 of 5970

Showing per page

Binary Relations-based Rough Sets – an Automated Approach

Adam Grabowski (2016)

Formalized Mathematics

Rough sets, developed by Zdzisław Pawlak [12], are an important tool to describe the state of incomplete or partially unknown information. In this article, which is essentially the continuation of [8], 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 [11]). Here we drop the classical equivalence- and tolerance-based models of rough...

BL-algebras of basic fuzzy logic.

Esko Turunen (1999)

Mathware and Soft Computing

BL-algebras [Hajek] rise as Lindenbaum algebras from certain logical axioms familiar in fuzzy logic framework. BL-algebras are studied by means of deductive systems and co-annihilators. Duals of many theorems known to hold in MV-algebra theory remain valid for BL-algebras, too.

Boolean differential operators

Jorge Catumba, Rafael Díaz (2014)

Commentationes Mathematicae Universitatis Carolinae

We consider four combinatorial interpretations for the algebra of Boolean differential operators and construct, for each interpretation, a matrix representation for the algebra of Boolean differential operators.

Boolean matrices ... neither Boolean nor matrices

Gabriele Ricci (2000)

Discussiones Mathematicae - General Algebra and Applications

Boolean matrices, the incidence matrices of a graph, are known not to be the (universal) matrices of a Boolean algebra. Here, we also show that their usual composition cannot make them the matrices of any algebra. Yet, later on, we "show" that it can. This seeming paradox comes from the hidden intrusion of a widespread set-theoretical (mis) definition and notation and denies its harmlessness. A minor modification of this standard definition might fix it.

Currently displaying 781 – 800 of 5970