Finitely Presented Lattices
نویسندگان
چکیده
منابع مشابه
Finitely Presented Lattices: Continuity and Semidistributivity
In [3] we investigated finitely presented lattices and the closely related subject of lattices generated by a finite partial lattice. We described a canonical form for the elements of such a lattice and used this to study the covering relation. We showed that there is an effective procedure for finding the covers of any element of a finitely presented lattice. We gave an example of a finitely p...
متن کاملFinitely Presented Lattices: Canonical Forms and the Covering Relation
A canonical form for elements of a lattice freely generated by a partial lattice is given. This form agrees with Whitman’s canonical form for free lattices when the partial lattice is an antichain. The connection between this canonical form and the arithmetic of the lattice is given. For example, it is shown that every element of a finitely presented lattice has only finitely many minimal join ...
متن کاملAlgorithms for Finite, Finitely Presented and Free Lattices
In this talk we will present and analyze the efficiency of various algorithms in lattice theory. For finite lattices this will include recognition of various properties such as subdirect irreducibility, semidistributivity, and boundedness (in the sense of McKenzie) as well as efficient algorithms for computing the congruence lattice. For free and finitely presented lattices we will discuss algo...
متن کاملQuasi-Exact Sequence and Finitely Presented Modules
The notion of quasi-exact sequence of modules was introduced by B. Davvaz and coauthors in 1999 as a generalization of the notion of exact sequence. In this paper we investigate further this notion. In particular, some interesting results concerning this concept and torsion functor are given.
متن کاملFinitely Presented Infinite Graphs
This thesis contributes to the study of families of finitely presented infinite graphs,their structural properties and their relations to each other. Given a finite alpha-bet Σ, a Σ-labeled infinite graph can be characterized as a finite set of binaryrelations (Ra)a∈Σ over an arbitrary countable domain V . There are many ways tofinitely characterize such sets of relations, eithe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1979
ISSN: 0002-9939
DOI: 10.2307/2042634