Boolean Advanced Quiz 2

1. What mathematical term describes a function where a change in an input value can never cause the output to change in the opposite direction?

2. According to Stone's representation theorem, every Boolean algebra is isomorphic to a field of what mathematical structures?

3. What classification describes a Boolean algebra whose underlying set features a uniquely defined maximum element and a minimum element?

4. If a Boolean space is constructed from a Boolean algebra, what topological property will that space inherently possess?

5. What mathematical operation is defined as finding the unique supremum of two elements within a Boolean lattice framework?

6. What mathematical operation is defined as finding the unique infimum of two elements within a Boolean lattice framework?

7. What classification is given to a Boolean algebra where every subset has both a supremum and an infimum?

8. Which structural derivative of a Boolean function maps changes in inputs to changes in outputs, acting as a logical derivative?

9. In Boolean circuit complexity, the complexity class AC0 restricts logic circuits to have what structural limit?

10. Which term describes the property where a Boolean function can be computed by a circuit using only AND and OR gates without any negation?