<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Negru, I.</creatorName>
<affiliation>Universitatea Tehnică a Moldovei, Moldova, Republica</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>On a Certain Property of the Elements of a Finitely Generated Lattice</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2018</publicationYear>
<relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'> 978-9975-76-247-2</relatedIdentifier>
<dates>
<date dateType='Issued'>2018</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Conference Paper</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'><p>Firstly, a reminder that a lattice is a set S of elements; it is partially ordered, closed in relation to two lattice operations: the reunion a + b and the intersection a 
 b of any two elements a and b from set S. (The reunion a + b is the smallest element of the lattice containing both elements a and b; the intersection a 
 b is the greatest element of the lattice contained in both elements a and b. Obviously, a  a + b; b  a + b; a  a 
 b; b  a 
 b) A lattice may also be de ned thusly: the generating elements of the lattice are given. Other elements, di erent from the generators, are obtained via the two lattice operations, applied to the generators.</p></description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>