Fuzzy positive implicative ordered filters of implicative semigroups.
Fuzzy -algebras with interval-valued membership functions.
Fuzzy quasi-ideals of ordered semigroups.
Fuzzy sets (in)equations with a complete codomain lattice
The paper applies some properties of the monotonous operators on the complete lattices to problems of the existence and the construction of the solutions to some fuzzy relational equations, inequations, and their systems, taking a complete lattice for the codomain lattice. The existing solutions are extremal - the least or the greatest, thus we prove some extremal problems related to fuzzy sets (in)equations. Also, some properties of upper-continuous lattices are proved and applied to systems of...
Fuzzy structures of PI() BCK-ideals in hyper BCK-algebras.
-supplemented property in the lattices
Let be a lattice with the greatest element . Following the concept of generalized small subfilter, we define -supplemented filters and investigate the basic properties and possible structures of these filters.
Galois connections as left adjoint maps
Galois lattice as a framework to specify building class hierarchies algorithms
Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms
In the context of object-oriented systems, algorithms for building class hierarchies are currently receiving much attention. We present here a characterization of several global algorithms. A global algorithm is one which starts with only the set of classes (provided with all their properties) and directly builds the hierarchy. The algorithms scrutinized were developped each in a different framework. In this survey, they are explained in a single framework, which takes advantage of a substructure...
Galois theory for groups
Galois triangle theory for direct summands of modules
Galois-type connections and closure operations on preordered sets.
Game properties of Boolean algebras
Gaps and dualities in Heyting categories
We present an algebraic treatment of the correspondence of gaps and dualities in partial ordered classes induced by the morphism structures of certain categories which we call Heyting (such are for instance all cartesian closed categories, but there are other important examples). This allows to extend the results of [14] to a wide range of more general structures. Also, we introduce a notion of combined dualities and discuss the relation of their structure to that of the plain ones.
Gate circuits in the algebra of transients
We study simulation of gate circuits in the infinite algebra of transients recently introduced by Brzozowski and Ésik. A transient is a word consisting of alternating s and s; it represents a changing signal. In the algebra of transients, gates process transients instead of s and s. Simulation in this algebra is capable of counting signal changes and detecting hazards. We study two simulation algorithms: a general one that works with any initial state, and a special one that applies only if...
Gate circuits in the algebra of transients
We study simulation of gate circuits in the infinite algebra of transients recently introduced by Brzozowski and Ésik. A transient is a word consisting of alternating 0s and 1s; it represents a changing signal. In the algebra of transients, gates process transients instead of 0s and 1s. Simulation in this algebra is capable of counting signal changes and detecting hazards. We study two simulation algorithms: a general one that works with any initial state, and a special one that applies only if...
Gelfand theorem implies Stone representation theorem of Boolean rings.
General algebraic geometry and formal concept analysis.
General comparability of pseudo MV-algebras
Generalization of ideal topology in chains