Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/508| Title: | Simple characterization of functionally complete one-element sets of propositional connectives | Authors: | Maksimović, Petar Janičić, Predrag |
Affiliations: | Informatics and Computer Science | Keywords: | Boolean functions;Complete sets of connectives;Propositional logic | Issue Date: | 1-Jan-2006 | Journal: | Mathematical Logic Quarterly | Abstract: | A set of prepositional connectives is said to be functionally complete if all prepositional 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 prepositional connectives to be functionally complete. These conditions provide a simple and elegant characterization of functionally complete one-element sets of prepositional connectives (of arbitrary arity). © 2006 WILEY-VCH Verlag GmbH & Co. KGaA. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/508 | ISSN: | 09425616 | DOI: | 10.1002/malq.200610009 |
| Appears in Collections: | Research outputs |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.