The following pages link to The core of finite lattices (Q1176723):
Displaying 15 items.
- A class of infinite convex geometries (Q276205) (← links)
- The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Minimum implicational basis for \(\wedge\)-semidistributive lattices (Q845722) (← links)
- Latticial structures in data analysis. (Q1285785) (← links)
- A geometric description of modular lattices (Q1327460) (← links)
- On permutation lattices (Q1364433) (← links)
- The presence of lattice theory in discrete problems of mathematical social sciences. Why. (Q1414820) (← links)
- Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors (Q1766746) (← links)
- A depth-first search algorithm for computing pseudo-closed sets (Q1800382) (← links)
- Representation of lattices via set-colored posets (Q1800386) (← links)
- Join-semidistributive lattices and convex geometries. (Q1865285) (← links)
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey (Q1874537) (← links)
- Optimum basis of finite convex geometry (Q2399285) (← links)
- (Q2741273) (← links)
