Page 1 Next

Displaying 1 – 20 of 78

Showing per page

G -supplemented property in the lattices

Shahabaddin Ebrahimi Atani (2022)

Mathematica Bohemica

Let L be a lattice with the greatest element 1 . Following the concept of generalized small subfilter, we define g -supplemented filters and investigate the basic properties and possible structures of these filters.

Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms

M. Huchard, H. Dicky, H. Leblanc (2010)

RAIRO - Theoretical Informatics and Applications

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...

Gaps and dualities in Heyting categories

Jaroslav Nešetřil, Aleš Pultr, Claude Tardif (2007)

Commentationes Mathematicae Universitatis Carolinae

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

Janusz Brzozowski, Mihaela Gheorghiu (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

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 0 s and 1 s; it represents a changing signal. In the algebra of transients, gates process transients instead of 0 s and 1 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

Janusz Brzozowski, Mihaela Gheorghiu (2010)

RAIRO - Theoretical Informatics and Applications


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...

Generalizations of pseudo MV-algebras and generalized pseudo effect algebras

Jan Kühr (2008)

Czechoslovak Mathematical Journal

We deal with unbounded dually residuated lattices that generalize pseudo M V -algebras in such a way that every principal order-ideal is a pseudo M V -algebra. We describe the connections of these generalized pseudo M V -algebras to generalized pseudo effect algebras, which allows us to represent every generalized pseudo M V -algebra A by means of the positive cone of a suitable -group G A . We prove that the lattice of all (normal) ideals of A and the lattice of all (normal) convex -subgroups of G A are isomorphic....

Generalized cardinal properties of lattices and lattice ordered groups

Ján Jakubík (2004)

Czechoslovak Mathematical Journal

We denote by K the class of all cardinals; put K ' = K { } . Let 𝒞 be a class of algebraic systems. A generalized cardinal property f on 𝒞 is defined to be a rule which assings to each A 𝒞 an element f A of K ' such that, whenever A 1 , A 2 𝒞 and A 1 A 2 , then f A 1 = f A 2 . In this paper we are interested mainly in the cases when (i) 𝒞 is the class of all bounded lattices B having more than one element, or (ii) 𝒞 is a class of lattice ordered groups.

Currently displaying 1 – 20 of 78

Page 1 Next