query: Counting partially ordered relations in a finite set
positive_passages.docid: 25769
positive_passages.text: Finding all posets on a set
negative_passages.docid: 111954
negative_passages.text: Computing the cardinality of a combinatorial set
negative_passages.docid: 130771
negative_passages.text: Sets and the principle of inclusion and exclusion
negative_passages.docid: 144821
negative_passages.text: Number of ordered pairs of subsets
negative_passages.docid: 107899
negative_passages.text: counting full bipartite matchings
negative_passages.docid: 12436
negative_passages.text: The cardinality of the set of all finite subsets of an infinite set
negative_passages.docid: 32081
negative_passages.text: The dual version of trichotomy of cardinality without AC
negative_passages.docid: 121860
negative_passages.text: Number of well-ordering relations on a well-orderable infinite set $A$?
negative_passages.docid: 74015
negative_passages.text: Number of relations that are both symmetric and reflexive
negative_passages.docid: 73794
negative_passages.text: counting with max and min restrictions
negative_passages.docid: 102824
negative_passages.text: Countable set of truth assignments satisfying set of well formed formulas
negative_passages.docid: 3465
negative_passages.text: Equivalence relations and power sets.
negative_passages.docid: 106397
negative_passages.text: Counting ways to partition a set into fixed number of subsets
negative_passages.docid: 76521
negative_passages.text: Every partial order can be extended to a linear ordering
negative_passages.docid: 41448
negative_passages.text: Counting set for generating functions
negative_passages.docid: 70143
negative_passages.text: Mutually exclusive countable subsets of a countable set
negative_passages.docid: 118560
negative_passages.text: Ordered N-Tuples as Cartesian Products of Indexed Families