Search results

...'''. Other authors sometimes use a slightly different set of about 8 to 10 operations, usually denoted ''G''₁, ''G''₂,... ...eight operations as a set of Gödel operations (which he called fundamental operations): ...

...m''') is a simple way to visualize logical expressions and combinations of sets. Randolph diagrams were created by mathematician John F. Randolph in 1965, ...sity or exclusion. Using this system, one can represent any combination of sets or logical statements using intersecting lines. ...

{{distinguish|Family of sets}} Let <math>I</math> and <math>X</math> be sets and <math>f</math> a [[Function (mathematics)|function]] such that ...

{{Short description|Set of elements common to all of some sets}} | caption = The intersection of two sets <math>A</math> and <math>B,</math> represented by circles. <math>A \cap B</ ...

...on of two sets is at most the sum of values of the function on each of the sets. This is thematically related to the [[subadditivity]] property of real-val ...<math>f(S)</math> is the minimum number <math>t</math> such that there are sets <math>T_{i_1}, \dotsc, T_{i_t}</math> satisfying <math>S\subseteq \cup_{j=1 ...

===Saturated sets=== ...urated sets are saturated, as are arbitrary [[intersection]]s of saturated sets. ...

...nd intersection operations, in a family of sets that is closed under these operations, automatically form a distributive lattice, and Birkhoff's representation t ...omplement (so-called ''fields of sets'', closely related to the ''rings of sets'' used by Birkhoff to represent distributive lattices), and [[Birkhoff's HS ...

...he underlying space of the point process into another space. Point process operations and the resulting point processes are used in the theory of [[point process ...on is applied to some Poisson point process, then provided some conditions on the point process operation, the resulting process will be often another Po ...

...equivalence between elements. For example, if <code>f</code> is a function on values of type <code>Person</code>, it must be the case that for two <code> ...pically provides a [[data type]] together with an [[equivalence relation]] on that type, for example, <code>Person // ==</code>, where <code>==</code> is ...

...< k</math>, the elements in deque <math>Q_i</math> have a smaller working sets than the elements in deque <math>Q_{i+1}</math>. This property is referred ==Operations== ...

| contribution = On partitional matroids with applications ...Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), Vol. III ...

...er|title=Uncertainty and Intelligent Systems: 2nd International Conference on Information Processing and Management of Uncertainty in Knowledge Based Sys ...>, <math>Y</math> ranges over [[Independent set (graph theory)|independent sets]] of G, the joint distribution of <math>X</math> and <math>Y</math> is such ...

...ex bodies, generalizing both the polytope and smooth cases, using measures on the [[Gauss map]].{{r|grun2}} ...an a lower-dimensional subspace of the higher-dimensional space, and these sets of vectors can be combined without regard to the dimensions of the spaces t ...

...gh the information theoretic barrier with fusion trees|journal=[[Symposium on Theory of Computing]]|pages=1–7|date=1990}}</ref> ...addresses.</ref> The model allows both arithmetic operations and [[bitwise operations]] including [[logical shift]]s to be done in [[constant time]] (the precise ...

...[[fixed point (mathematics)|fixed-point]] for functions defined on finite sets, typically subsets of the integer grid <math>\mathbb{Z}^n</math>. ...idered points of a hypercube (HGDP), of a simplex (SGDP) etc. See the page on [[direction-preserving function]] for definitions. ...

...ertices]] of their [[convex hull]].{{r|m02}} More generally, a [[family of sets|family]] of [[convex set]]s is said to be in convex position if they are pa ...weight triangulation]] of planar point sets is NP-hard for arbitrary point sets,<ref name="mr08"/> but solvable in [[polynomial time]] by [[dynamic program ...

{{Short description|Matroid with complemented basis sets}} ...al Optimization: Polyhedra and Efficiency. Vol. B: Matroids, Trees, Stable Sets ...

...the convergence of von Neumann's alternating projection algorithm for two sets | journal = Set-Valued Analysis | volume = 1 | issue = 2| pages = 185–212 | ...ensions that consider cases when there are more than two sets, or when the sets are not [[convex set|convex]],<ref>{{Cite journal ...

...lgebra (structure)|commutative algebra]] over the reals with the following operations: These operations extend to [[partial function]]s from {{mvar|X}} to <math>\mathbb R,</math> ...

...the group law and the formation of the inverse element is continuous, both operations are in this case also measurable from <math> \mathcal B(G) </math> to <math Measurable groups can be seen as [[measurable acting group]]s that act on themselves. ...