****Updated:
The following is an example of the limits of linear reasoning by notion of symbols that can be viewed synonymous to emergent variables:
****The following formalism will use only the following symbolic operators that defined the distinction of the sequences. There is not premise or intent of establishing a fully formal traditional system thus the modality of proof will be that of emergent patterns by degree of the sequences themselves.
“L:” will represent a Linear Reasoning Chain.
“R:” will represent a Recursive Reasoning Chain.
“->” will represent “transition towards/change to/direction.”
“( )” will represent context.
1. L: A
1. R: A
2. L: (A → B)
2. R: (A → A) → (A, B, -A)
3. L: (A → B → C) …
3. R: (A → A → A) → (A, B, C, -A, -B) …
4. (L ⊆ R):
(A → …X) → ((A → … A) → (A,B…X, -A, -B…-Y)
((L:) → (R:)) ↔ (((L:) → (L:)) ⊆ (R:))
((L: A → B → C…),
(L: -A → -B → -C…),
(L: A → A1 → A2…),
(L: B → B1 → B2…),
(L: C → C1 → C2…),
(L: -A → -A1 → -A2…)
(L: -B → -B1 → -B2…),
(L: -C → -C1 → -C2…)) ⊆ (R: A → A…)
5. R: (A → A) →
((A, B , -A) →
(-(A) ↔ (-A))
-> (B) → (A → B))
(R:) → (L:)
There is only A

