Displaying 61 – 80 of 316

Showing per page

Characterization of posets of intervals

Judita Lihová (2000)

Archivum Mathematicum

If A is a class of partially ordered sets, let P ( A ) denote the system of all posets which are isomorphic to the system of all intervals of A for some A A . We give an algebraic characterization of elements of P ( A ) for A being the class of all bounded posets and the class of all posets A satisfying the condition that for each a A there exist a minimal element u and a maximal element v with u a v , respectively.

Characterizations of 0-distributive posets

Vinayak V. Joshi, B. N. Waphare (2005)

Mathematica Bohemica

The concept of a 0-distributive poset is introduced. It is shown that a section semicomplemented poset is distributive if and only if it is 0-distributive. It is also proved that every pseudocomplemented poset is 0-distributive. Further, 0-distributive posets are characterized in terms of their ideal lattices.

Characterizations of the 0 -distributive semilattice

P. Balasubramani (2003)

Mathematica Bohemica

The 0 -distributive semilattice is characterized in terms of semiideals, ideals and filters. Some sufficient conditions and some necessary conditions for 0 -distributivity are obtained. Counterexamples are given to prove that certain conditions are not necessary and certain conditions are not sufficient.

Characterizations of totally ordered sets by their various endomorphisms

Daniel Hort, Jan Chvalina, Jiří Moučka (2002)

Czechoslovak Mathematical Journal

We characterize totally ordered sets within the class of all ordered sets containing at least three-element chains using a simple relationship between their isotone transformations and the so called 2-, 3-, 4-endomorphisms which are introduced in the paper. Another characterization of totally ordered sets within the class of ordered sets of a locally finite height with at least four-element chains in terms of the regular semigroup theory is also given.

Choice principles in Węglorz’ models

N. Brunner, Paul Howard, Jean Rubin (1997)

Fundamenta Mathematicae

Węglorz' models are models for set theory without the axiom of choice. Each one is determined by an atomic Boolean algebra. Here the algebraic properties of the Boolean algebra are compared to the set theoretic properties of the model.

Classes of filters in generalizations of commutative fuzzy structures

Jiří Rachůnek, Dana Šalounová (2009)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Bounded commutative residuated lattice ordered monoids ( R -monoids) are a common generalization of 𝐵𝐿 -algebras and Heyting algebras, i.e. algebras of basic fuzzy logic and intuitionistic logic, respectively. In the paper we develop the theory of filters of bounded commutative R -monoids.

Classes of fuzzy filters of residuated lattice ordered monoids

Jiří Rachůnek, Dana Šalounová (2010)

Mathematica Bohemica

The logical foundations of processes handling uncertainty in information use some classes of algebras as algebraic semantics. Bounded residuated lattice ordered monoids (monoids) are common generalizations of BL -algebras, i.e., algebras of the propositional basic fuzzy logic, and Heyting algebras, i.e., algebras of the propositional intuitionistic logic. From the point of view of uncertain information, sets of provable formulas in inference systems could be described by fuzzy filters of the corresponding...

Currently displaying 61 – 80 of 316