________________
Many such situations may be routinely encountered, and therefore additional and independent knowledge about the system is needed in order to resolve such doubts. Prof. Ramachandran as noted earlier has shown that this representation of doubt has numerous advantages and it can be put to use in computer algorithms. As such the evaluation of truth functionality of three statements about a system can be adequately represented by three bits - true, false and inexpressible - which predict seven states of truth. The eighth state which represents 'neither is, nor is not, nor inexpressible' (0,0,0) is a contradictory and therefore must be left out for the consideration of mystics.
The seven states of truth - the spatabhangi example from the Syadvāda Mañjari readily illustrates the physical significance of these syllogistic states:
syād it is
(1,0,0) ... it is not
(0,0,1) it is inexpressible (0,1,0) ... is, is not
(1,0,1) ... is, is inexpressible (1,1,0) ... is not, is inexpressible (0,1,1) ... is, is not, is inexpressible (1,1,1)
In short these secular thoughts represented by notation impressively explicit the Syādvāda and Saptabhangi principle being not only consistent with each other but they are extensions of binary Boolean algebra. Inference syllogisms of higher order are obviously widely accepted for intellectual discourse but their mathematical foundations are not established. Interestingly, these syllogisms have intellectual continuity that emphasizes attempts to develop a secular basis for the elaboration of the deeper forms and inner structures of thought and for the interpretation of content and physical significance. Prof. Ramachandran has shown that the four states resulting from two elements generate foundations for the prepositional logic, and it appears that the eight states resulting from three elements could provide a basis for the predicate logic.
Jain Education International
For Private & Perso17 Use Only
www.jainelibrary.org
