Set theory: Difference between revisions
Content added Content deleted
(→Notes) |
|||
| Line 10: | Line 10: | ||
'''Proper subset''': between two sets, the former set contains only elements from the latter set, but the latter set contains at least one more element than the former set. |
'''Proper subset''': between two sets, the former set contains only elements from the latter set, but the latter set contains at least one more element than the former set. |
||
''' |
'''Superset''': If one set has every element that another set has, then it is a superset. |
||
'''Singleton''': A set with exactly one alternative in it.<blockquote>An '''inclusion-wise maximal set''' among a collection of sets is a set that is not a subset of some other set in the collection. An '''inclusion-wise minimal set''' among a collection of sets is a set in the collection that is not a superset of any other set in the collection.</blockquote> |
|||
== Condorcet == |
== Condorcet == |
||
| Line 29: | Line 31: | ||
== Notes == |
== Notes == |
||
Order theory is often used for more advanced discussions on ranked methods. For example, a [[beatpath]] is an ordering of candidates such that the first candidate in the ordering [[pairwise counting#Terminology|pairwise beats]] the second, the second pairwise beats the third, etc. all the way until the last candidate. |
[[Order theory]] is often used for more advanced discussions on ranked methods. For example, a [[beatpath]] is an ordering of candidates such that the first candidate in the ordering [[pairwise counting#Terminology|pairwise beats]] the second, the second pairwise beats the third, etc. all the way until the last candidate. |
||
== See also == |
== See also == |
||