Robert C. PowersSpringer Berlin HeidelbergAn ordered set approach to neutral consensus functions - Crown, Janowitz, et al. - 1994 () Citation Context ...publication. See [1] in the bibliography. (9) Two authors are indicated as I. Smart and G. Bush, while three or more authors are ...
In a set X equipped with a relation ≼, we say that two elements x, y are comparable if at least one of the relations x ≼ y or y ≼ x holds. (This terminology is mainly used in posets.) b. The only partial order that is also an equivalence relation is equality (=). c....
With very few exceptions in the I/O Kit, all Libkern-based C++ classes, functions, and macros areunsafeto use in a primary interrupt context. Consult the I/O Kit documentation related to primary interrupts for more information. OSOrderedSet provides no concurrency protection; it's up to the...
The following are 30 code examples of ordered_set.OrderedSet(). You can vote up the ones you like or vote down the ones you don't like, and go to the original project or source file by following the links above each example. You may also want to check out all available functions/cla...
Let C denote the set of all real-valued continuous functions denned over the whole real line (−∞,∞); then C is a lattice with its usual order: f≤ g if and only if f(x) ≤ g(x) for every x. Let A be a partially ordered set; then note that some two element subset may...
Representation functionsAdditive basisErdős–Fuchs TheoremLet \\(k\\ge 2\\) be a positive integer. We study concentration results for the ordered representation functions \\(r^{{ \\le }}_k({\\mathcal {A}},n) = \\# \\big \\{ (a_1 \\le \\dots \\le a_k) \\in {\\math...
7.3. Exercise. If C is well orderable and A ≤ c C, then A is well orderable. 7.4. Exercise. If C is well orderable and there exists a surjection f : C →→ A, then A ≤ c C, and hence A is also well orderable. 7.5. Successor and limit points. Every well ordered set U ...
"fieldset","as":null,"items":[{"id":"widgetVisibility","className":null,"__typename":"FormFieldRef"}],"props":null,"legend":null,"description":null,"className":null,"viewVariant":null,"toggleState":null,"__typename":"FormFieldset"},{"id":"moreOptionsGroup","type"...
Creates a Dictionary<TKey,TValue> from an IEnumerable<T> according to specified key selector and element selector functions. ToHashSet<TSource>(IEnumerable<TSource>, IEqualityComparer<TSource>) Creates a HashSet<T> from an IEnumerable<T> using the comparer to compare keys. ToHashSet<TSource...
This chapter has proposed an overview of set-functions valued on a totally ordered scale, with emphasis on the simplest of such set-functions, found in possibility theory. The corresponding relations on a power set describing the relative confidence of events have been studied. It has been shown...