This paper considers compositions of relations based on the notion of the afterset and the foreset, i. e., the subproduct, the superproduct and the square product introduced by Bandler and Kohout with modification proposed by De Baets and Kerre. There are proven all possible mixed pseudo-associativity properties of Bandler – Kohout compositions of relations.
Let be an algebraic structure of type and a set of open formulas of the first order language . The set of all subsets of closed under forms the so called lattice of -closed subsets of . We prove various sufficient conditions under which the lattice is modular or distributive.
Varieties whose algebras have no idempotent element were characterized by B. Csákány by the property that no proper subalgebra of an algebra of such a variety is a congruence class. We simplify this result for permutable varieties and we give a local version of the theorem for varieties with nullary operations.
The interval eigenproblem in max-min algebra is studied. A classification of interval eigenvectors is introduced and six types of interval eigenvectors are described. Characterization of all six types is given for the case of strictly increasing eigenvectors and Hasse diagram of relations between the types is presented.
In this paper we describe all algebras with one unary operation such that by a direct limit construction exactly two nonisomorphic algebras can be obtained from .
We consider words coding exchange of three intervals with permutation (3,2,1), here called 3iet words. Recently, a characterization of substitution invariant 3iet words was provided. We study the opposite question: what are the morphisms fixing a 3iet word? We reveal a narrow connection of such morphisms and morphisms fixing Sturmian words using the new notion of amicability.
Any amicable pair ϕ, ψ of Sturmian morphisms enables a construction of a ternary morphism η which preserves the set of infinite words coding 3-interval exchange. We determine the number of amicable pairs with the same incidence matrix in SL±(2,ℕ) and we study incidence matrices associated with the corresponding ternary morphisms η.
Any amicable pair ϕ, ψ of Sturmian morphisms enables a construction of a ternary morphism η which preserves the set of infinite words coding 3-interval exchange. We determine the number of amicable pairs with the same incidence matrix in SL±(2,ℕ) and we study incidence matrices associated with the corresponding ternary morphisms η.
We describe the free objects in the variety of algebras involving several mutually distributive binary operations. Also, we show how an associative operation can be constructed on such systems in good cases, thus obtaining a two way correspondence between LD-monoids (sets with a left self-distributive and a compatible associative operation) and multi-LD-systems (sets with a family of mutually distributive operations).