query: Boolean function construction
positive_passages.docid: 94771
positive_passages.text: Not every boolean function is constructed from $\wedge$ (and) and $\vee$ (or)
negative_passages.docid: 120499
negative_passages.text: compilation error on boolean expression
negative_passages.docid: 26569
negative_passages.text: Counting binary operations on a set with $n$ elements
negative_passages.docid: 6971
negative_passages.text: boolean variable values in PHP to javascript implementation
negative_passages.docid: 86064
negative_passages.text: Argument completions for user-defined functions
negative_passages.docid: 3323
negative_passages.text: Bijection Contruction
negative_passages.docid: 102232
negative_passages.text: Checking whether a number is positive or negative using bitwise operators
negative_passages.docid: 94669
negative_passages.text: Boolean Evaluation in Apex?
negative_passages.docid: 125900
negative_passages.text: Defining "boolness" of a class in python
negative_passages.docid: 74839
negative_passages.text: Catalan numbers: bijection between applications of a binary operator and Dyck words.
negative_passages.docid: 67683
negative_passages.text: Building logical criteria (with AND , OR, etc)
negative_passages.docid: 101453
negative_passages.text: Existence of a Boolean algebra with a unique ultrafilter in ZF
negative_passages.docid: 116646
negative_passages.text: implementing functions in a game
negative_passages.docid: 60697
negative_passages.text: Defining functions from expressions of variable lengths
negative_passages.docid: 21683
negative_passages.text: What is the most elegant way to check if all values in a boolean array are true?
negative_passages.docid: 52258
negative_passages.text: Applying And to lists of Booleans
negative_passages.docid: 20174
negative_passages.text: Discrete mathematics bit strings