Yeah. Lots of small sets are universal.
One of the advantages of prefix and postfix notations is you can have any number of inputs, e.g.: and(1, 1, 1, 1, 0, 1). Can you evaluate that expression?
Can you write in English how to evaluate whether and, or and xor are true or false for input lists that could be any length? The answers should be one sentence each.