
| (       | )   |    |     |    |     |
|---------|-----|----|-----|----|-----|
| 1       | 2   | 12 | 12  |    |     |
| F F     | FI  | FT | I I | IT | T T |
| +       | +   | +  |     |    |     |
| ,       | ,   |    |     |    |     |
| (1,0,0) |     |    |     |    |     |

These 16 neutrosophic binary operators are approximated, since the binary 

![0_image_0.png](0_image_0.png) N-conorm gives an approximation because of 'indeterminacy' component. 

 : 0,1 0,1 0,1 0,1 0,1 0,1 ( ) [ ][ ][ ] [ ][ ][ ] N

![0_image_1.png](0_image_1.png)

if all i x are disjoint two by two, and 
 We can extend Knuth's Table from binary operators to tri-nary operators (and we get 3 2 2 256 = tri-nary operators) and in general to n-ary operators (and we get 2 2 n n-ary operators). 

 Let's present the tri-nary Venn Diagram, with 3 variables x, , y z

![0_image_2.png](0_image_2.png)

using the name Smarandache codification. 

 This has 3 2 8 = disjoint parts, and if we shade none, one, two, …, or eight of them and consider all possible combinations we get 8 2 256 = tri-nary operators in the above tri-nary Venn Diagram. For n=3 we have: 