Simple characterization of functionally complete one‐element sets of propositional connectives |
| |
| Authors: | Petar Maksimovi&#x; Predrag Jani
i&#x; |
| |
| Institution: | Petar Maksimovi?,Predrag Jani?i? |
| |
| Abstract: | A set of propositional connectives is said to be functionally complete if all propositional formulae can be expressed using only connectives from that set. In this paper we give sufficient and necessary conditions for a one‐element set of propositional connectives to be functionally complete. These conditions provide a simple and elegant characterization of functionally complete one‐element sets of propositional connectives (of arbitrary arity). (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) |
| |
| Keywords: | Propositional logic Boolean functions complete sets of connectives |
|
