Boolean Networks (BN) are established tools for modelling biological systems. However, their analysis is hindered by the state space explosion: exponentially many states on variables of a BN. We present an extension tool model reduction ERODE with support BNs and recent method called Backward Equivalence (BBE). BBE identifies maximal sets that retain same value whenever initialized equally. has...

The word, Boolean, was derived from the name of a British mathematician, George Boole, as a result of his classical work on logic. Boolean algebra can be defined as a set, whose members have two possible values, with two binary operators and one unary operator, satisfying the properties of commutativity, associativity, distributivity, existence of identity and complement. Boolean algebra has im...

The Bruhat order gives a poset structure to any Coxeter group. The ideal of elements in this poset having boolean principal order ideals forms a simplicial poset. This simplicial poset defines the boolean complex for the group. In a Coxeter system of rank n, we show that the boolean complex is homotopy equivalent to a wedge of (n− 1)-dimensional spheres. The number of these spheres is the boole...

abstract. in this paper, we introduce the notion of fuzzy obstinate ideals in mv -algebras. some properties of fuzzy obstinate ideals are given. not only we give some characterizations of fuzzy obstinate ideals, but also bring the extension theorem of fuzzy obstinate ideal of an mv -algebra a. we investigate the relationships between fuzzy obstinate ideals and the other fuzzy ideals of an mv -a...

land-use planning is a science that determines the type optimum of land-use through studying the ecological characteristics of the land as well as its socio-economic structure. the primary objective of this study is to evaluate the land-use and natural resources for future sustainable land planning using gis. in this study, the makhdoom’s systematic method was used to analyze the ecological and...

In this note, we consider the minimum number of NOT operators in a Boolean formula representing a Boolean function. In circuit complexity theory, the minimum number of NOT gates in a Boolean circuit computing a Boolean function f is called the inversion complexity of f . In 1958, Markov determined the inversion complexity of every Boolean function and particularly proved that ⌈log 2 (n + 1)⌉ NO...