چکیده مقاله
In Boolean logic, for any arbitrary T B T total binary truth table can generate a Boolean expression as a conjunctive normal form This paper considers the notation of T B T, introduces a novel concept of hypergraphable Boolean functions and Boolean functionable hypergraphs with respect to T B T This study defines a notation of kernel set on switching functions Also is shown that every T B T corresponds to a hypergraph
کلیدواژهها
T.B.T. Switching function hypergraphable Boolean function Boolean functionable hypergraph Boolean function based hypergraph switching kernel Boolean function–based hypergraph T B T
نویسندگان
Marzieh Rahmati
Department of Mathematics, University of Payame Noor, P O Box ۱۹۳۹۵ ۴۶۹۷, Tehran, Iran
Mohammad Hamidi
Department of Mathematics, University of Payame Noor, P O Box ۱۹۳۹۵ ۴۶۹۷, Tehran, Iran
شیوه ارجاع
Rahmati, Marzieh and Hamidi, Mohammad,1401,Hypernetwork Based on Classical Logic,10th National Conference on Mathematics, Payame Noor University,Shiraz
ارائهشده در
مجموعه مقالات دهمین همایش ملی ریاضی دانشگاه پیام نور28 اردیبهشت 1401 · شیراز