Tag Info

New answers tagged

1

To answer your first question: your syllogism should probably be formulated as Resolve[ Implies[ ForAll[triangle, Implies[ Element[triangle, equilateralTriangles], Element[triangle, isoscelesTriangles]]] && Exists[triangle, NotElement[triangle, equilateralTriangles]], Exists[triangle, NotElement[triangle, ...


0

f = {BitAnd@##, BitXor@##} &; f @@ {1, 1} f @@@ {{1, 1}, {0, 1}, {1, 0}, {0, 0}} (* {1, 0} {{1, 0}, {0, 1}, {0, 1}, {0, 0}} *)


1

{c, s} = {And[x,y], Xor[x,y]} or as a function of x and y: f[x_,y_]:={And[x,y], Xor[x,y]}



Top 50 recent answers are included