Free lattices over halflattices
Frequency estimates for linear extension majority cycles on partial orders
From well-quasi-ordered sets to better-quasi-ordered sets.
Function classes and relational constraints stable under compositions with clones
The general Galois theory for functions and relational constraints over arbitrary sets described in the authors' previous paper is refined by imposing algebraic conditions on relations.
Function minimum associated to a congruence on integral n-tuple space.
Function spaces and fixed point properties: a Galois connection.
Functional Completeness and Automorphisms.I.
Fundamental preorders and partial orders on completely [0] simple semigroups.
Further development of Chebyshev type inequalities for Sugeno integrals and T-(S-)evaluators
In this paper further development of Chebyshev type inequalities for Sugeno integrals based on an aggregation function and a scale transformation is given. Consequences for T-(S-)evaluators are established.
Further results on neutral consensus functions
We use a set theoretic approach to consensus by viewing an object as a set of smaller pieces called “bricks”. A consensus function is neutral if there exists a family D of sets such that a brick s is in the output of a profile if and only if the set of positions with objects that contain s belongs to D. We give sufficient set theoretic conditions for D to be a lattice filter and, in the case of a finite lattice, these conditions turn out to be necessary. Ourfinal result, which involves a finite...
Fuzzy concepts defined via residuated maps
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.
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...
General algebraic geometry and formal concept analysis.