Please create $3$ well$-$formed sentences of first$-$order predicate logic that are not used in this assignment. Here are all the logic symbols for you to copy and paste: $,$ &$,,->,,=,$

The following constraints apply:

For every predicate letter that you use, you need to specify how many terms it takes. You could simply state that, say, F is a one$-$place predicate, you could say that it has an arity of $1,$ you could create a translation scheme of your choice $($e$.$g$.,$ Fx: x is a frog$),$ or you could use a superscript $($e$.$g$.,$ F$1).$

Each sentence must feature at least two different kinds of quantifiers and at least one binary operator. If F and B are one$-$place predicates, then this is an example of a well$-$formed sentence that fulfills this constraint: $(($x$)$Fx $($y$)$By$)$