For each ternary propositional connective, we determine the minimum number of binary connectives needed to construct a logically equivalent formula. In order to reduce this problem to a computably feasible one, we prove a number of lemmas showing that every element of a large set of formulas is logically equivalent to a formula in a much smaller associated set.
Jeffry Hirst, Department of Mathematical Sciences, Appalachian State University email@example.com
Bradley, William; Dunn, Alex; Harenberg, Steve; Owen, Matthew; and Roberts, Matthew
"Calibrating the Complexity of Ternary Propositional Connectives,"
Rose-Hulman Undergraduate Mathematics Journal: Vol. 11
, Article 8.
Available at: http://scholar.rose-hulman.edu/rhumj/vol11/iss2/8