Short Note: Counting Conjectures.
A. R. de Soto, A. Alvárez, E. Trillas (2007)
Mathware and Soft Computing
Similarity:
A. R. de Soto, A. Alvárez, E. Trillas (2007)
Mathware and Soft Computing
Similarity:
Sergei Ovchinnikov (2000)
Mathware and Soft Computing
Similarity:
Stochastic token theory is a new branch of mathematical psychology. In this paper we investigate algebraic properties of token systems defined on finite lattices.
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.
Konôpka, P., Pulmannová, S. (1991)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
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.
Milan Mares, Milan Vlach (2006)
Mathware and Soft Computing
Similarity:
The uncertainty of expectations and vagueness of the interests belong to natural components of cooperative situations, in general. Therefore, some kind of formalization of uncertainty and vagueness should be included in realistic models of cooperative behaviour. This paper attempts to contribute to the endeavour of designing a universal model of vagueness in cooperative situations. Namely, some initial auxiliary steps toward the development of such a model are described. We use the concept...
Román, Leopoldo, Zuazua, Rita E. (1996)
Theory and Applications of Categories [electronic only]
Similarity:
Adam Grabowski (2015)
Formalized Mathematics
Similarity:
The article continues the formalization of the lattice theory (as structures with two binary operations, not in terms of ordering relations). In the paper, the notion of a pseudocomplement in a lattice is formally introduced in Mizar, and based on this we define the notion of the skeleton and the set of dense elements in a pseudocomplemented lattice, giving the meet-decomposition of arbitrary element of a lattice as the infimum of two elements: one belonging to the skeleton, and the...