Pages that link to "Item:Q507534"

The following pages link to Algorithms for \(k\)-meet-semidistributive lattices (Q507534):

Displaying 7 items.

• The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
• A depth-first search algorithm for computing pseudo-closed sets (Q1800382) (← links)
• Translating between the representations of a ranked convex geometry (Q2032718) (← links)
• Enumerating maximal consistent closed sets in closure systems (Q2117117) (← links)
• Concept lattices with negative information: a characterization theorem (Q2282052) (← links)
• On the preferred extensions of argumentation frameworks: bijections with naive sets (Q2681398) (← links)
• Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements (Q6165553) (← links)