Formality of the complements of subspace arrangements with geometric lattices.
Formalization of Generalized Almost Distributive Lattices
Almost Distributive Lattices (ADL) are structures defined by Swamy and Rao [14] as a common abstraction of some generalizations of the Boolean algebra. In our paper, we deal with a certain further generalization of ADLs, namely the Generalized Almost Distributive Lattices (GADL). Our main aim was to give the formal counterpart of this structure and we succeeded formalizing all items from the Section 3 of Rao et al.’s paper [13]. Essentially among GADLs we can find structures which are neither V-commutative...
Forme algébrique des théories de Stone-Gel'fand
Formulas of the general solutions of Boolean equations.
Formule d'inversion et fonction de Möbius sur les ensembles ordonnés
Fortsetzungen extremaler Funktionale.
Four notes on quasiorder lattices
Four-part semigroups - semigroups of Boolean operations
Four-part semigroups form a new class of semigroups which became important when sets of Boolean operations which are closed under the binary superposition operation f + g := f(g,...,g), were studied. In this paper we describe the lattice of all subsemigroups of an arbitrary four-part semigroup, determine regular and idempotent elements, regular and idempotent subsemigroups, homomorphic images, Green's relations, and prove a representation theorem for four-part semigroups.
Fractal construction of an atomic Archimedean effect algebra with non-atomic subalgebra of sharp elements
Does there exist an atomic Archimedean lattice effect algebra with non-atomic subalgebra of sharp elements? An affirmative answer to this question is given.
Frame monomorphisms and a feature of the -group of Baire functions on a topological space
“The kernel functor” from the category of archimedean lattice-ordered groups with distinguished weak unit onto LFrm, of Lindelöf completely regular frames, preserves and reflects monics. In , monics are one-to-one, but not necessarily so in LFrm. An embedding for which is one-to-one is termed kernel-injective, or KI; these are the topic of this paper. The situation is contrasted with kernel-surjective and -preserving (KS and KP). The -objects every embedding of which is KI are characterized;...
Frame tolerances are directly decomposable
Frames in Priestley's duality
Frankl-Füredi type inequalities for polynomial semi-lattices.
Frankl’s conjecture for large semimodular and planar semimodular lattices
A lattice is said to satisfy (the lattice theoretic version of) Frankl’s conjecture if there is a join-irreducible element such that at most half of the elements of satisfy . Frankl’s conjecture, also called as union-closed sets conjecture, is well-known in combinatorics, and it is equivalent to the statement that every finite lattice satisfies Frankl’s conjecture. Let denote the number of nonzero join-irreducible elements of . It is well-known that consists of at most elements....
Frattini sublattices in varieties of lattices
Frattinian constructions
Free almost-p-lattices
Free Archimedean l-Groups.
Free bounded distributive lattice over finite ordered sets and their skeletons.
Free group automorphisms, invariant orderings and topological applications.