Displaying similar documents to “Short Note: Counting Conjectures.”

Averaging premises.

Enric Trillas, Elena E. Castiñeira, Susana Cubillo (2001)

Mathware and Soft Computing

Similarity:

This paper deals with the sets of strict conjectures and consequences of a given collection P of premises. The set of Averaging Functions is introduced on lattices and some properties of these functions are shown. Averaging Functions allow to interpret restricted consequences as averages of premises. The subset of consequences C*(P) and the subset of conjectures Φ*(P) defined by means of the averaging function g are introduced, and their properties are studied. This sets allow to give...

Zero-dimensional Dugundji spaces admit profinite lattice structures

Lutz Heindorf (1992)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We prove what the title says. It then follows that zero-dimensional Dugundji space are supercompact. Moreover, their Boolean algebras of clopen subsets turn out to be semigroup algebras.

A characterization of complete atomic Boolean algebra.

Francesc Esteva (1977)

Stochastica

Similarity:

In this note we give a characterization of complete atomic Boolean algebras by means of complete atomic lattices. We find that unicity of the representation of the maximum as union of atoms and Lambda-infinite distributivity law are necessary and sufficient conditions for the lattice to be a complete atomic Boolean algebra.

Ring-like structures derived from λ -lattices with antitone involutions

Ivan Chajda (2007)

Mathematica Bohemica

Similarity:

Using the concept of the λ -lattice introduced recently by V. Snášel we define λ -lattices with antitone involutions. For them we establish a correspondence to ring-like structures similarly as it was done for ortholattices and pseudorings, for Boolean algebras and Boolean rings or for lattices with an antitone involution and the so-called Boolean quasirings.