The following pages link to (Q4691408):
Displaying 5 items.
- Self-dual binary and ternary connectives for \(m\)-valued propositional calculi (Q775685) (← links)
- Complexity of sets obtained as values of propositional formulas (Q869787) (← links)
- On minimizing the \(\forall\)-\(\neg\) degree of a connective-free formula (Q1323356) (← links)
- Formula Complexity of Ternary Majorities (Q2914347) (← links)
- Ternary Exclusive Or (Q5448850) (← links)