Structural Functionality as a Fundamental Property of Boolean Algebra and Base for Its Real-Valued Realizations

  • Dragan G. Radojević
Part of the Communications in Computer and Information Science book series (CCIS, volume 443)


The value of the complex Boolean function can be calculated directly on the basis of its components value. It is a principle known as the truth functionality. Properties of the Boolean algebra have indifferent values. The truth functional principle is taken as a valid principle in general case in the conventional generalization: multi-valued and/or real-valued realizations (fuzzy logic in the broad sense). This paper presents that truth functionality is not valued indifferent property of the Boolean algebra and it is valid only in two-valued realization, and thus it cannot be the basic of the value generalization. The value generalization (real-valued realizations) enables incomparably more descriptiveness than the two-valued classical Boolean algebra, so that the finite Boolean algebra is enough for any real application. Each finite Boolean algebra is atomic. Every Boolean function (the element of the analyzed finite Boolean algebra) can be presented uniquely as disjunction of the relevant atoms – disjunctive canonical form. Which atoms are and which are not included in the analyzed Boolean function is defined by its structure: 0-1 vector which dimension matches the number of atoms (in the case of n independent variables, the number of atoms is 2 n ). Atom corresponds uniquely to each vector structure position and value 0 means that the adequate atom is not included in the analyzed function, and 1 means that it is included. The principle of the structural functionality is: the structure of the complex Boolean function is defined directly on the basis of its components structure. The truth functionality is a value image of the structural functionality only in the case of two-valued realization. Each insisting on the truth functionality, such as in the case of conventional multi-valued logic and fuzzy logic in general sense, is unjustified from the point of the Boolean consistency.


Boolean algebra atomic Boolean functions disjunctive canonical form Boolean function structure structural functionality truth functionality generalized value realization of the Boolean functions 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Zadeh, L.A.: From Circuit Theory to System Theory. In: Proc. of Institute of Ratio Engineering, vol. 50, pp. 856–865 (1962)Google Scholar
  2. 2.
    Boole, G.: The Calculus of Logic. The Cambridge and Dublin Mathematical Journal 3, 183–198 (1848)Google Scholar
  3. 3.
    Radojevic, D.: New [0,1]-valued logic: A natural generalization of Boolean logic. Yugoslav Journal of Operational Research - YUJOR 10(2), 185–216 (2000)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Radojevic, D.: There is Enough Room for Zadeh’s Ideas, Besides Aristotle’s in a Boolean Frame. In: 2nd International Workshop on Soft Computing Applications, SOFA 2007 (2007)Google Scholar
  5. 5.
    Radojevic, D.: Interpolative Realization of Boolean algebra as a Consistent Frame for Gradation and/or Fuzziness. In: Nikravesh, M., Kacprzyk, J., Zadeh, L.A. (eds.) Forging New Frontiers: Fuzzy Pioneers II. STUDFUZZ, vol. 218, pp. 295–317. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Radojevic, D.: Real-valued realization of Boolean algebra is natural frame for consistent fuzzy logic. In: Seising, R., Trillas, E., Moraga, C., Termini, S. (eds.) On Fuzziness, A Homage to Lotfi Zadeh. STUDFUZZ, vol. 2, pp. 559–566. Springer, Heidelberg (2013)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Dragan G. Radojević
    • 1
  1. 1.Institute Mihajlo PupinUniversity of BelgradeBelgradeSerbia

Personalised recommendations