"완전순서"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
(→‎노트: 새 문단)
 
 
(사용자 2명의 중간 판 2개는 보이지 않습니다)
1번째 줄: 1번째 줄:
 
== 노트 ==
 
== 노트 ==
−
 
−
* What does it mean by saying "take place in a single total order"?<ref name="ref_a8d8">[https://stackoverflow.com/questions/53286110/what-does-a-single-total-order-mean-in-stdnotify-one What does “a single total order” mean in std::notify_one()?]</ref>
 
−
* Definition of "total order" from Wikipedia can't help much.<ref name="ref_a8d8" />
 
 
* The binary relation ≤ is then called a total order or a linear order (or total ordering or linear ordering).<ref name="ref_f166">[https://planetmath.org/totalorder total order]</ref>
 
* The binary relation ≤ is then called a total order or a linear order (or total ordering or linear ordering).<ref name="ref_f166">[https://planetmath.org/totalorder total order]</ref>
 
* A totally ordered set is also sometimes called a chain, especially when it is considered as a subset of some other poset.<ref name="ref_f166" />
 
* A totally ordered set is also sometimes called a chain, especially when it is considered as a subset of some other poset.<ref name="ref_f166" />
23번째 줄: 20번째 줄:
 
===소스===
 
===소스===
 
  <references />
 
  <references />
 +
 +
==메타데이터==
 +
===위키데이터===
 +
* ID :  [https://www.wikidata.org/wiki/Q369377 Q369377]
 +
===Spacy 패턴 목록===
 +
* [{'LOWER': 'total'}, {'LEMMA': 'order'}]
 +
* [{'LOWER': 'linear'}, {'LEMMA': 'order'}]
 +
* [{'LOWER': 'simple'}, {'LEMMA': 'order'}]
 +
* [{'OP': '*'}, {'LOWER': 'non'}, {'LOWER': '-'}, {'LOWER': 'strict'}, {'OP': '*'}, {'LEMMA': 'ordering'}]
 +
* [{'LEMMA': 'chain'}]

2021년 2월 17일 (수) 01:45 기준 최신판

노트

  • The binary relation ≤ is then called a total order or a linear order (or total ordering or linear ordering).[1]
  • A totally ordered set is also sometimes called a chain, especially when it is considered as a subset of some other poset.[1]
  • Some people prefer to define the binary relation < as a total order, rather than ≤ .[1]
  • The problem of finding a strict total order for a finite set of multiple criteria alternatives is considered.[2]
  • Each multicast sender thread walks through the stages for sending a message in the total order algorithm (see the state diagram).[3]
  • To facilitate proper testing, we needed a way to introduce nondeterminism into the execution of the total order algorithm.[3]
  • the total order intake in 2001 (in cgt).[4]
  • There is obvious pragmatic justification for choosing the standard total order; it's utility is not in question.[5]
  • A total order is a partial order that has one additional property - any two elements in the set should be related.[6]
  • each other, total order requires us to be able to order all elements in a set.[6]
  • We can define a total order between square boxes, however, as long as their sizes are unique.[6]
  • A partially ordered set \(\left( {A, \preccurlyeq} \right)\) in which any two elements are comparable is called a total order.[7]
  • To convert a partial order into a total order, we need to replace the reflexivity property by the stronger connexity property.[7]
  • Find a chain of length \(4\) in the poset \(\left( {A, \mid} \right),\) where \(\mid\) represents the divisibility relation.[7]
  • Example 3 Determine which of the following subset relations are total orders.[7]
  • The height of a poset denotes the cardinality of its largest chain in this sense.[8]
  • In other words, a total order on a set with k elements induces a bijection with the first k natural numbers.[8]
  • (the reflexive closure of the direct product of the corresponding strict total orders).[8]

소스

  1. ↑ 1.0 1.1 1.2 total order
  2. ↑ Constructing a strict total order for alternatives characterized by multiple criteria: An extension
  3. ↑ 3.0 3.1 nvanbenschoten/total-order-multicast: An implementation of the ISIS total order multicast algorithm
  4. ↑ French translation – Linguee
  5. ↑ Why do we choose the standard total order on the integers?
  6. ↑ 6.0 6.1 6.2 Partial and Total Orders
  7. ↑ 7.0 7.1 7.2 7.3 Total Orders
  8. ↑ 8.0 8.1 8.2 Total order

메타데이터

위키데이터

Spacy 패턴 목록

  • [{'LOWER': 'total'}, {'LEMMA': 'order'}]
  • [{'LOWER': 'linear'}, {'LEMMA': 'order'}]
  • [{'LOWER': 'simple'}, {'LEMMA': 'order'}]
  • [{'OP': '*'}, {'LOWER': 'non'}, {'LOWER': '-'}, {'LOWER': 'strict'}, {'OP': '*'}, {'LEMMA': 'ordering'}]
  • [{'LEMMA': 'chain'}]
원본 주소 "https://wiki.mathnt.net/index.php?title=완전순서&oldid=51526"