Displaying 101 – 120 of 124

Showing per page

Monadic n × m -valued Łukasiewicz-Moisil algebras

A. V. Figallo, Claudia A. Sanza (2012)

Mathematica Bohemica

Here we initiate an investigation into the class m L M n × m of monadic n × m -valued Łukasiewicz-Moisil algebras (or m L M n × m -algebras), namely n × m -valued Łukasiewicz-Moisil algebras endowed with a unary operation. These algebras constitute a generalization of monadic n -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 m L M n × m is a discriminator variety and as a consequence, the...

Monadic quasi-modal distributive nearlattices

Ismael Calomino (2023)

Commentationes Mathematicae Universitatis Carolinae

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".

Monotone modal operators on bounded integral residuated lattices

Jiří Rachůnek, Zdeněk Svoboda (2012)

Mathematica Bohemica

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.

Monotone σ-complete groups with unbounded refinement

Friedrich Wehrung (1996)

Fundamenta Mathematicae

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 m a m = n b n 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...

More on the complexity of cover graphs

Jaroslav Nešetřil, Vojtěch Rödl (1995)

Commentationes Mathematicae Universitatis Carolinae

In response to [3] and [4] we prove that the recognition of cover graphs of finite posets is an NP-hard problem.

More set-theory around the weak Freese–Nation property

Sakaé Fuchino, Lajos Soukup (1997)

Fundamenta Mathematicae

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,...

Multiplicatively idempotent semirings

Ivan Chajda, Helmut Länger, Filip Švrček (2015)

Mathematica Bohemica

Semirings are modifications of unitary rings where the additive reduct does not form a group in general, but only a monoid. We characterize multiplicatively idempotent semirings and Boolean rings as semirings satisfying particular identities. Further, we work with varieties of enriched semirings. We show that the variety of enriched multiplicatively idempotent semirings differs from the join of the variety of enriched unitary Boolean rings and the variety of enriched bounded distributive lattices....

Currently displaying 101 – 120 of 124