Lattices as partially ordered sets and as algebraic systems, morphisms, sublattices, closure operators, and the MacNeille completion are also discussed. A partially ordered set or poset is a couple (P, ≤) where P is a non-empty set and ≤ a relation of partial order on P—that is, ...
The importance of equational axioms emerged initially with the axiomatic approach to Boolean algebras, groups, and rings, and later in lattices. This unique research monograph systematically presents minimal equational axiom-systems for various lattice-related algebras, regardless of whether they are given...
Dilworth Algebraic Theory of Lattices Prentice-Hall, Englewood Cliffs, NJ (1973) Google Scholar 9. B.A. Davey, H.A. Priestley Introduction to Lattices and Order Cambridge Univ. Press, Cambridge (1990) Google Scholar 10. G. Grätzer General Lattice Theory Birkhäuser, Basel-Stuttgart (1978)...
来源期刊 Communications in Computer & Information Science 2011 研究点推荐 completely algebraic ∩–structure algebraic lattice Completely Algebraic Lattices completely algebraic lattice ∩-structures completely algebraic information system Information Systems 0...
A software package for algebraic, geometric and combinatorial problems on linear spaces. By R. Hemmecke, R. Hemmecke, M. Köppe, P. Malkin, M. Walter mathematics markov-chains integer-programming commutative-algebra lattices algebraic-statistics Updated Mar 7, 2024 C++ JuliaPhysics / Lattice...
It determines the Leibniz operator, a mapping between the lattices of filters and congruences of an algebra, in terms of which a hierarchy of $k$-deductive systems can be defined. Monotone Leibniz operators give rise to protoalgebraic... WJ Blok,D Pigozzi - 《Universal Algebra & Quasigroup ...
R Berghammer - 《Journal of Logic & Algebraic Programming》 被引量: 18发表: 2013年 On the relation between V-to-I and the structure of the inflectional paradigm. Argues that there is not a direct causal connection between rich inflection and V-to-I (verb movement our of VP, across a VP...
Symmetric Chain Decompositions and the Strong Sperner Property for Noncrossing Partition Lattices We prove that the noncrossing partition lattices associated with the complex reflection groups $G(d,d,n)$ for $d,n\\geq 2$ admit a decomposition into satur... H Mühle - 《Journal of Algebraic Co...
Wille, R.: Tensor products of complete lattices as closure systems. Contributions to General Algebra 7, 381–386 (1991) About this Chapter Title Algebraicity and the Tensor Product of Concept Lattices Book Title Formal Concept Analysis Book Subtitle 12th International Conference, ICFCA 2014, Cl...
A Postnikov,D Speyer,L Williams - 《Journal of Algebraic Combinatorics》 被引量: 75发表: 2009年 Bicircular geometry and the lattice of forests of a graph representa- tions. For 9 with the stated ordering is essentially the lattice of flats ofthe bicircular matroid of P (F with a loop ...