Monadic epimorphisms and applications
Here we initiate an investigation into the class of monadic -valued Łukasiewicz-Moisil algebras (or -algebras), namely -valued Łukasiewicz-Moisil algebras endowed with a unary operation. These algebras constitute a generalization of monadic -valued Łukasiewicz-Moisil algebras. In this article, the congruences on these algebras are determined and subdirectly irreducible algebras are characterized. From this last result it is proved that is a discriminator variety and as a consequence, the...
We prove that there is a one to one correspondence between monadic finite quasi-modal operators on a distributive nearlattice and quantifiers on the distributive lattice of its finitely generated filters, extending the results given in ``Calomino I., Celani S., González L. J.: Quasi-modal operators on distributive nearlattices, Rev. Unión Mat. Argent. 61 (2020), 339--352".
We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone preserving and variants of these. Our aim is to study in which posets some of these mappings coincide. We define special mappings determined by two elements and investigate when these are strictly monotone or upper cone preserving. If the considered poset is a semilattice then its monotone mappings coincide with semilattice homomorphisms if and only if the poset is a chain. Similarly, we study posets which...
Bounded integral residuated lattices form a large class of algebras containing some classes of commutative and noncommutative algebras behind many-valued and fuzzy logics. In the paper, monotone modal operators (special cases of closure operators) are introduced and studied.
The real line ℝ may be characterized as the unique non-atomic directed partially ordered abelian group which is monotone σ-complete (countable increasing bounded sequences have suprema), has the countable refinement property (countable sums of positive (possibly infinite) elements have common refinements) and is linearly ordered. We prove here that the latter condition is not redundant, thus solving an old problem by A. Tarski, by proving that there are many spaces (in particular, of arbitrarily...
In response to [3] and [4] we prove that the recognition of cover graphs of finite posets is an NP-hard problem.
We introduce a very weak version of the square principle which may hold even under failure of the generalized continuum hypothesis. Under this weak square principle, we give a new characterization (Theorem 10) of partial orderings with κ-Freese-Nation property (see below for the definition). The characterization is not a ZFC theorem: assuming Chang’s Conjecture for , we can find a counter-example to the characterization (Theorem 12). We then show that, in the model obtained by adding Cohen reals,...