... 1-3 December 2001 (second printed edition) FLORENTIN SMARANDACHE editor PROCEEDINGS OF THE FIRST INTERNATIONAL CONFE... ...ntributed papers were sent, by November 30, 2001, to the organizer: Florentin Smarandache, University of New Mexico, 200 College Road, Gallup, NM 8... ...Neutrosophic Conference). E-mail: smarand@unm.edu, http://www.gallup.unm.edu/~smarandache/FirstNeutConf.htm. A selection of them is being published... ...t to be True or False, but may have a degree of truth between 0 and 1"; - the Boolean logic (for n = 1 and i = 0, with t, f either 0 or 1); - the m... ..., John, Proceedings on the Neutrosophic Logic and Their Applications in Neural Networks, Computer Programming, and Quantum Physics, Institute of Phy... ...doc.cgi?Smarandache+logic. and FOLDOC Australian Mirror - Australia's Cultural Network, http://www.acn.net.au/cgi-bin/foldoc.cgi?Smarandache+logic,... ...len, 43, 63-100, 1893. [26] Le, Charles T., Neutrosophic logic used in neural networks, CIO Communications, Inc., http://wellengaged.com/engaged/ci... ...The DST has shown its compatibility with the classical probability theory, with boolean logic and has a feasible computational complexity [46] for pro... ...corresponds to the famous Dedekind’s problem on enumerating the set of monotone Boolean functions (i.e., functions expressible using only AND and OR s...

...n the information provided by the sources is both uncertain and (highly) conflicting. This approach, known in literature as DSmT (standing for Dezert-Smarandache Theory), proposes new useful rules of combinations. We gathered in this volume a presentation of DSmT from the beginning to the latest development. Part 1 of this book presents the current state-of-the-art on theo...

... of the first hyper-power sets . . . 38 2.4 The generation of D_ . . . . 39 2.4.1 Memory size requirements and complexity . . . 39 2.4.2 Monotone Boolean functions . . . . 40 2.4.3 Generation of MBF . . . . 42 2.5 Conclusion . . . . . 45 2.6 References . . . . . 46 Appendix: MatLab code for generating hyper-power sets . . . 48 3 Partial ordering on hyper-power set...