1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/508
DC FieldValueLanguage
dc.contributor.authorMaksimović, Petaren_US
dc.contributor.authorJaničić, Predragen_US
dc.date.accessioned2022-08-13T10:14:42Z-
dc.date.available2022-08-13T10:14:42Z-
dc.date.issued2006-01-01-
dc.identifier.issn09425616en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/508-
dc.description.abstractA 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.en
dc.relation.ispartofMathematical Logic Quarterlyen
dc.subjectBoolean functionsen
dc.subjectComplete sets of connectivesen
dc.subjectPropositional logicen
dc.titleSimple characterization of functionally complete one-element sets of propositional connectivesen_US
dc.typeArticleen_US
dc.identifier.doi10.1002/malq.200610009-
dc.identifier.scopus2-s2.0-33750901996-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/33750901996-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.firstpage498en
dc.relation.lastpage504en
dc.relation.volume52en
dc.relation.issue5en
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0001-8922-4948-
Appears in Collections:Research outputs
Show simple item record

Page view(s)

9
checked on Dec 25, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.