Closure lattices

DOI10.1016/0012-365X(96)00043-XzbMath0852.06002MaRDI QIDQ1918553

John L. Pfaltz

Publication date: 29 October 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

closure spacepartial order on subsets

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Combinatorial aspects of matroids and geometric lattices (05B35) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items

Computational processes that appear to model human memory ⋮ Extreme point axioms for closure spaces ⋮ Matroids on convex geometries (cg-matroids) ⋮ A new notion of convexity in digraphs with an application to Bayesian networks ⋮ New representations of algebraic domains and algebraic L-domains via closure systems ⋮ Transformations of discrete closure systems ⋮ Transformations of Concept Graphs: ⋮ Closure spaces that are not uniquely generated ⋮ Characterizations of the convex geometries arising from the double shellings of posets ⋮ Violator spaces vs closure spaces ⋮ Parallel composition and decomposition of specifications ⋮ Closure systems and their structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroids and antimatroids - a survey
• Greedoids
• The theory of convex geometries
• Meet-distributive lattices and the anti-exchange closure
• On the poset of all posets on \(n\) elements
• Convexity in directed graphs
• Powerposets
• Convexity in Graphs and Hypergraphs