VTechWorks staff will be away for the winter holidays starting Tuesday, December 24, 2024, through Wednesday, January 1, 2025, and will not be replying to requests during this time. Thank you for your patience, and happy holidays!
 

Definability of Boolean Function Over Many-value Boolean Algebra

Simple item page
dc.contributor.authorKang, Andy N. C.en
dc.contributor.authorShen, Stewart N.T.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:50Zen
dc.date.available2013-06-19T14:36:50Zen
dc.date.issued1974en
dc.description.abstractIn this paper, the definability of functions over B_s is first briefly discussed. We then give necessary and sufficient conditions on the definable functions over B_2, boolean algebra of four values. An efficient algorithm is also presented for finding the defining boolean expressions for the definable functions over B_2, The result is then extended to the functions over B_s.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000761/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000761/01/CS74007-R.pdfen
dc.identifier.trnumberCS74007-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20253en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleDefinability of Boolean Function Over Many-value Boolean Algebraen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS74007-R.pdf
Size:
736.29 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports