Connectives Advanced Quiz 4

1. In a Lindenbaum–Tarski algebra, equivalence classes of propositions are structured under connectives to form what?

2. Which property of a connective ensures that any nested sequence of its applications can be evaluated in any order without parentheses?

3. If a connective satisfies "P * P = P", what algebraic property does it possess?

4. Which operator is used to convert formulas into Conjunctive Normal Form (CNF) without exponential size blowup via the Tseitin transformation?

5. What is the dual truth function of material implication under standard systematic negation mapping?

6. The connective system of intuitionistic logic can be structurally mapped to which mathematical system?

7. Which term describes a binary connective that is monotone and maps bounded elements to bounded elements?

8. In relevant logic systems, standard truth-functional connectives are restricted to avoid what problem?

9. Which logic gate representation of a connective allows for complete reversible computing without loss of state information?

10. Which closed truth-functional class contains only functions whose Zhegalkin polynomial features no terms with degree higher than one?