Just like $\Sigma$ and $\Pi$ are the "big operators" for summation and multiplication, what would such operators be for logical operations? For example, would $\bigwedge\limits_{i} b_i$ be the logical-and operator applied on the set of booleans $b_i$? For some reason, although LaTeX does have \sum, there does not seem to exist any \And or \Or.
Asked
Active
Viewed 226 times
0
Tfovid
- 153
1 Answers
-1
In first order logic "operators" are predicates.
you may have a formula: $(\forall x)(\exists y)(xPy)$
$P$ is a predicate and $x,y$ are the bound variables.
a predicate can be $n-$ary which can be interpreted in a suitable domain of discourse.
In the example above $P$ is a binary predicate, i.e. it acts on two variables.
ryaron
- 1,091
-
So you mean the and operator $\land$ can't possibly by applied to a set (or more than two operands)? How does one represent an "and" operation on more than two booleans? – Tfovid Nov 15 '22 at 09:54
-
\bigvee$\bigvee$ and\bigwedge$\bigwedge$ – is this a mathematical question or a question about LaTeX? – Martin R Nov 15 '22 at 09:50