- #1
Organic
- 1,224
- 0
Hi,
Take for example these 5 equations:
Set A = {{x1},{x2},{x3},{x4}}, where each x# is some number.
Now, let us say that the above equations represent some cardinal's equation-trees of set A.
Let us say that any cardinal which is > 1 is the continuous side of the cardinal's equation-tree.
Let us say that any cardinal which is = 1 is the discrete side of the cardinal's equation-tree.
x#' stands for dummy variable of xor(|{x1}|,|{x2}|,|{x3}|,|{x4}|) ,
and we get 9 variations:
As you can see above, the quantity in each cardinal's equation-tree is being kept, while the structural symmetry-degree and the information's clarity-degree of each tree are changed.
My question is:
What mathematical branch deals with this kind of information's structures ?
Organic
Take for example these 5 equations:
Code:
1 1 1
+ 2 = + 2 = +
1 1 1
4 = + 4 = + 4 = +
1 1 1
+ + 2 = +
1 1 1
1 1
+ 2 = +
3 = 1 3 = + 1
4 = + + 4 = +
1 1
1 1
Set A = {{x1},{x2},{x3},{x4}}, where each x# is some number.
Now, let us say that the above equations represent some cardinal's equation-trees of set A.
Let us say that any cardinal which is > 1 is the continuous side of the cardinal's equation-tree.
Let us say that any cardinal which is = 1 is the discrete side of the cardinal's equation-tree.
x#' stands for dummy variable of xor(|{x1}|,|{x2}|,|{x3}|,|{x4}|) ,
and we get 9 variations:
Code:
1 is xor(x1',x2',x3',x4') (1:16)
+
1 is xor(x1',x2',x3',x4') (1:16)
4 = +
1 is xor(x1',x2',x3',x4') (1:16)
+
1 is xor(x1',x2',x3',x4') (1:16)
1 is xor(x1',x2') (1:8)
2 = +
1 is xor(x1',x2') (1:8)
4 = +
1 is xor(x1',x2',x3',x4') (1:16)
+
1 is xor(x1',x2',x3',x4') (1:16)
1 is x1' (1:4)
2 = +
1 is x1' (1:4)
4 = +
1 xor(x1',x2',x3',x4') (1:16)
+
1 xor(x1',x2',x3',x4') (1:16)
1 is xor(x1',x2') (1:8)
2 = +
1 is xor(x1',x2') (1:8)
4 = +
1 is xor(x1',x2') (1:8)
2 = +
1 is xor(x1',x2') (1:8)
1 is x1' (1:4)
2 = +
1 is x1' (1:4)
4 = +
1 is xor(x1',x2') (1:8)
2 = +
1 is xor(x1',x2') (1:8)
1 is x1' (1:4)
2 = +
1 is x1' (1:4)
4 = +
1 is x1' (1:4)
2 = +
1 is x1' (1:4)
(From here each x#' has 3 elements)
1 is xor(x1',x2',x3') (1:9)
+
3 = 1 is xor(x1',x2',x3') (1:9)
4 = + +
1 is xor(x1',x2',x3') (1:9)
1 is |{x4}| (1:1)
(From here each x#' has 2 elements)
1 is xor(x1',x2') (1:4)
2 = +
3 = + 1 is xor(x1',x2') (1:4)
4 = +
1 is |{x3}| (1:1)
1 is |{x4}| (1:1)
1 is |{x1}| (1:1)
2 = +
3 = + 1 is |{x2}| (1:1)
4 = +
1 is |{x3}| (1:1)
1 is |{x4}| (1:1)
As you can see above, the quantity in each cardinal's equation-tree is being kept, while the structural symmetry-degree and the information's clarity-degree of each tree are changed.
My question is:
What mathematical branch deals with this kind of information's structures ?
Organic
Last edited: