Search results

• Tacit extension
  ...eration]]s to the [[projection (mathematics)|projection]] of the Cartesian product onto the set in question, but the tacit extension is the one that places no * [[Cartesian product]]
  1 KB (181 words) - 13:28, 3 May 2019
• Grounded relation
  ...e|domain]]s'' of the relation. The second component is just the cartesian product itself.
  1 KB (177 words) - 02:20, 16 February 2008
• User:Jon Awbrey/WORKSPACE
  * [[Cartesian product]] * [[Cartesian product]]
  2 KB (192 words) - 04:54, 7 March 2011
• Directory:Rimrock Automation/Robotic Packaging Automation
  ...ety of industrial robots including 6 axis articulated arms, scara robots , cartesian coordinate robots (a.k.a. gantry robots), & parallel robots (a.k.a. delta o ...surface conditions. Regardless of whether the robot directly manipulates product into packaging or visa versa it is categorized as a part to tool based robo
  922 bytes (132 words) - 20:42, 27 February 2007
• User:Jon Awbrey/OLDSANDBOX
  | the scalar product of the <math>i</math>^th row of <math>G\!</math> with the <math>j | the scalar product of the <math>i</math>^th row of <math>G\!</math> with the <math>j
  43 KB (6,715 words) - 13:25, 22 June 2009
• Graph (mathematics)
  * [[Cartesian product of graphs]] * [[Tensor product of graphs]]
  13 KB (1,934 words) - 12:06, 6 September 2007
• Relation (mathematics)
  ...er the sets <math>X_1, \ldots, X_k\!</math> is a subset of their cartesian product, written <math>L \subseteq X_1 \times \ldots \times X_k.\!</math>&nbsp; Und ...pecify, namely, the <math>k\!</math> sets plus a subset of their cartesian product.&nbsp; In the idiom, this is expressed by saying that <math>L\!</math> is a
  20 KB (2,925 words) - 17:08, 14 November 2015
• Directory:Jon Awbrey/SANDBOX
  | the scalar product of the <math>i</math>^th row of <math>G\!</math> with the <math>j | the scalar product of the <math>i</math>^th row of <math>G\!</math> with the <math>j
  46 KB (7,067 words) - 04:10, 22 May 2010
• Triadic relation
  ...ath> and <math>L_1,</math> each of which is a subset of the same cartesian product <math>X \times Y \times Z.</math>&nbsp; The structures of <math>L_0</math> ...0, 1 \}</math> so <math>L_0</math> and <math>L_1</math> are subsets of the cartesian power <math>\mathbb{B} \times \mathbb{B} \times \mathbb{B}</math> or the <i
  18 KB (2,519 words) - 18:02, 27 May 2020
• Relation composition
  ...ducts occur, either the composition is marked on each occasion or else the product is marked by means of a ''center dot'' &ldquo;<math>\cdot</math>&rdquo;, as ...eir relationship to the projection operations that come with any cartesian product, but also suggesting natural directions for generalizing relational composi
  65 KB (6,802 words) - 18:14, 14 November 2015
• Relation reduction
  ...'extension'' of the relation <math>L\!</math> is a subset of the cartesian product <math>X = X_1 \times \ldots \times X_k.\!</math> ...ath>\{ X_j : j \in F \},\!</math> and there is the corresponding cartesian product over this subfamily, notated and defined as <math>\textstyle X_F = \prod_{j
  29 KB (4,035 words) - 03:32, 15 November 2015
• Relation theory
  ...math> the set <math>Y,\!</math> and a particular subset of their cartesian product <math>{X \times Y}.\!</math> So far so good. ...math> the set <math>Y,\!</math> and a particular subset of their cartesian product <math>{X \times Y}.\!</math> As before we have two choices, either let <ma
  25 KB (3,665 words) - 21:04, 16 November 2015
• Directory:Jon Awbrey/MathJax Problems
  ...d <math>x:y:z\!</math> are used as alternative notations for the cartesian product <math>X \times Y \times Z\!</math> and the tuple <math>(x, y, z),\!</math> ...nsidering particular ways of situating <math>{L, M, N}\!</math> within the product space <math>X:Y:Z.\!</math>
  59 KB (5,442 words) - 19:40, 8 November 2016
• Boolean algebras canonically defined
  ...ates; in particular operation ^''n''''f''_''j'' of the product operates on ''n'' ''I''-tuples by applying operation ^''n''''f''< ...tiplied together in this way are the same algebra ''A'' we call the direct product a ''direct power'' of ''A''. The Boolean algebra of all 32-bit bit vectors
  46 KB (7,114 words) - 18:24, 2 October 2007
• Sign relation
  ...nsion'', a sign relation <math>L\!</math> is a ''subset'' of a ''cartesian product'' <math>O \times S \times I.\!</math> Here, <math>O, S, I\!</math> are thr ...ned as the set of all ordered pairs <math>(o, s)\!</math> in the cartesian product <math>O \times S\!</math> for which there exists an ordered triple <math>(o
  58 KB (8,260 words) - 03:40, 21 November 2016
• Directory:Jon Awbrey/Papers/Cactus Language
  ...languages, as a ''sum'', by treating the concatenation of languages as a ''product'', and then by distinguishing the styles of analysis that favor ''sums of p ...ngs, the concatenation of the non-terminal symbols signifies the cartesian product over the corresponding sets of strings.
  211 KB (31,551 words) - 20:44, 2 August 2017
• Directory:Jon Awbrey/Papers/Propositional Equation Reasoning Systems
  A ''sign relation'' <math>L\!</math> is a subset of a cartesian product <math>O \times S \times I,\!</math> where <math>O, S, I\!</math> are sets k ...d <math>x:y:z\!</math> are used as alternative notations for the cartesian product <math>X \times Y \times Z\!</math> and the tuple <math>(x, y, z),\!</math>
  157 KB (17,761 words) - 03:44, 10 November 2016
• User:Jon Awbrey/Mathematical Notes
  | Consider the cartesian product X x Y of two sets, | <x, y> ~> x, <x, y> ~> y of the product on its
  567 KB (86,909 words) - 21:00, 6 December 2016
• Directory:Jon Awbrey/Papers/Peirce's 1870 Logic Of Relatives
  We can represent this problem setup as the problem of computing the following product: ...I flippered away playing the oldtime pinball machines, I tend to imagine a product like this being displayed in a vertical array:
  226 KB (33,992 words) - 16:22, 29 December 2017
• User:Jon Awbrey/IDS
  a definite text. The end product that results from the formalization is a subset of a cartesian product O x S x I. Here, O, S, I are three
  665 KB (109,541 words) - 02:46, 13 September 2010

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)