## Duquenne, V., The core of finite lattices, Discrete Mathematics 88 (1991) 133-147.
The hierarchical lattices of a finite machine
โ Scribed by P.E. Caines; Y.J. Wei
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 441 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0167-6911
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A structure model is presented which can represent not only the simplified geometry of an individual part but also the whole structure of a machine. The model is derived from observation of the general features of a machine, ie the hierarchy and the topology (connectivity) among parts. The model pla
The following conjecture of U Faigle and B Sands is proved: For every number R > 0 there exists a number n(R) such that if 2 is a finite distributive lattice whose width w(Z) (size of the largest antichain) is at least n(R), then IZ/a Rw(Z). In words this says that as one considers ~ increasingly la
If the Liikasiewicz many-valued systems are treated as logics in the senst of the following section, to whirh a sequent belongs wlien every assignment of trut,h-ralues giving a deliignakcd value to every formnla on the left of the "I-" gives a designated value to the formula on the right, then these