Freely adjoining a complement to a lattice
Frequency estimates for linear extension majority cycles on partial orders
Frolik's theorem for basically disconnected spaces
From well-quasi-ordered sets to better-quasi-ordered sets.
Full embeddings into the categories of Boolean algebras
Full embeddings with a given restriction
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 ∪-semigroups
Function spaces and adjoints.
Function spaces and fixed point properties: a Galois connection.
Functional Completeness and Automorphisms.I.
Functional completeness in pseudocomplemented de Morgan algebras
Functional monadic -valued Łukasiewicz algebras
Some functional representation theorems for monadic -valued Łukasiewicz algebras (qLk-algebras, for short) are given. Bearing in mind some of the results established by G. Georgescu and C. Vraciu (Algebre Boole monadice si algebre Łukasiewicz monadice, Studii Cercet. Mat. 23 (1971), 1027–1048) and P. Halmos (Algebraic Logic, Chelsea, New York, 1962), two functional representation theorems for qLk-algebras are obtained. Besides, rich qLk-algebras are introduced and characterized. In addition,...
Functorial approximation to the lateral completion in archimedean lattice-ordered groups with weak unit
Functorial rings of quotients 2: the ring of hyper-fractions.
Fundamental order relations on inverse semigroups and on their generalizations.
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...