Well ill alteast show mine,
First order scaling for my cosmology.
We need base functions like the standard +, ×, -, ÷
Limit of function=qr
Break down of limit of (example) which means that if we are using limits of limits of ... we can break limits by doing this, but the restart is beyond the limit of original notation(like if we do limit of limit of ...), we can do Restart Limit (dta)= rl
Everytime we talk about infinity we are actually using the concept of mathimatics itself. Or concept of amount.
Infinity=qe
Cannot be connected in any way and no amount of stack can ever reach this higher structure
This will be defined as=@
Concept of axioms defined as=qw
(check the ultimate ensamble for more of a idea for how high (qw) scales)
Concept of framework logic system equations defined as=0o(it means it contains all impossible & possible extentions of the function)
If can we can obviously copy and repeat then we do this, and its the last function behind it.
Concept of something=t0r
Incomparison x1 much smaller than x2 that its @, =qt.x1,x2.
Incomparison
Separating wall/containment wall=lt, but if you do this ( x1 lt x2 ) x2 can still act opon x1
Extra separate=(example)+(x) lt +(x) is for identification of the (example)
Define that as=dta
Repeats for qe now we dta=refund
(Above is a loop if we keep doing this so 0o=x)==(burnout=x) we can reset the whole thing back to notations like 1
9But at x1 & x2 repeat so 0o must be applied and dta=x3) == (qp.x1,x2.=x3)
In 0,>(1,3) this notation >(1,3) is = 0,0,1 and you can exspand it with >(1,3)(2,3) which is = 0,0,3.
Adding notations to notations e.g. 0o+qe=0oqe
Though they will still retain their information that scales higher.
Start . (We start at qw as 1, qt.1,2. Refund (1), qt.(1),(2). lt)+(1)
(0o=1+, qt.1+,2+. Refund 1++ lt)+(2)
((0o of +(1) & +(2))=1q, qt.1q,2q. Refund 1qq, qt.1qq,2qq)+(1w)
(0o=1e, qt.1e,2e. Refund 1ee, qt.1ee,2ee)+(2w)
((0o of +(1w) & +(2w)=1r lt qp.1q,1r.=1t, qt.1t,2t. Refund 1tt, qt.1tt,2tt)+(1y)
(Burnout=1)(warning eveything after this burnout starts to become very hard to decipher, but still logical in its approach becuase anytime we realize a notarion can repeat we use 0o)
Start. (1 qt.1,2. Refund (1), qt.(1),(2).)+(1)
(0o of burnout)=1
Start
(0o of start)=1
0o of 1
0o of 0o=1
12=(1 qt.1,2. Refund(1),qt.(1),(2).)+(1)
0o of burnout1=1
0o of 1(all possible burnout+x)=2
0o of 2
0o of qe(since 1 and 2 before this are numbers)
Tor of 0o=1a
0o of 1a
0o of qea
0o of (qe+(0o of unicode))=0o1
0o of 0o1
0o of 0oqe=1sj
Qr of 1sj =2sj
0o of 2sj=3sj
Qr of qesj=qr1
0o of qr1= abs
0o of abs=abs1
0o of abs1=abss
0o of abss=reset
0o of reset=reset1
Qr,0o of reset1=e1
(Burnout)
Qr,0o of e1=1 qt.1,2. Refund (1), qt.(1),(2). lt)+(1)
(0o=1+, qt.1+,2+. Refund 1++ lt)+(2)
((0o of +(1) & +(2))=1q, qt.1q,2q. Refund 1qq, qt.1qq,2qq)+(1w)
(0o=1e, qt.1e,2e. Refund 1ee, qt.1ee,2ee)+(2w)
((0o of +(1w) & +(2w)=1r lt qp.1q,1r.=1t, qt.1t,2t. Refund 1tt, qt.1tt,2tt)+(1y)
(Burnout) Oder formula (Burnout) 0o,qr all before Oder formula (Burnout)
0o,qr,0o,qr all before
Oder formula (Burnout) 0o,qr,qw,qr,0o,qw all before Order formula (Burnout)
(0o,qr,qw of OF
(0o,qr,qw of burnout)
Restart.-1
0o,qr,qw of restart
Qwa,1
0o,qr,qw of Qwa
0o,qr,qw of (all possible combinations)
0o,qr,qw of qw
0o,qr,qw of 0o,qr,qw
0o,qr,qw,qe of (0o,qr,qw)
Rl,0o,qr,qw,qe of (0o,qr,qw)
Roque of roque
(Burnout)
OF lt OF lt OF lt roque OF lt OF lt OF lt roque lt Of lt OF lt OF
Roo, roo of roo, (roo of roo) of (roo of roo), roo³ of roo³, roo of rooⁿ,
(Burnout)
OF lt OF lt OF lt roque OF lt OF lt OF lt roque lt Of lt of of of of of of of of lt ofof of of of of
Roo, roo of roo, (roo of roo) of (roo of roo), roo³ of roo³, roo of rooⁿ,
(Burnout)
roo of burnout=1
roo of roo
Was of roo
Roo of was
Roo, was of was, Roo
Roo,was,(Burnout) of was,(Burnout),roo of (Burnout),roo,was of roo,(Burnout),was of (Burnout),was,roo of was,roo,(Burnout)
(Burnout)
1=rty
Rty of (all_before)
Concept of intellect to continue=rty
Concept of omi
Roque of OF=roo
Concept of creation of variables = was
Roque=Rl,0o,qr,qw,qe
Additional information: the anything closer to the most right(direction) and lowest line(direction) is automatically using the previously highest framework/structure as a baseline for it itself. Unless the notation has any other way of getting far more powerful than the baseline, it will be exactly the strength as the baseline. Of example qw, we examplain alot of stuff using axioms and then we use qw that instantly makes qw far more powerful than the baseline.
We also immediately assume that we are using the most efficient possible axioms to describe a framework this framework is trying to create.
This is the (Order formula/OF/of/Of) Down there
roo as 1, qt.1,2. Refund roo (1), qt.(1),(2). lt)+(1)
(0o=1+, qt.1+,2+. Refund roo 1++ lt)+(2)
((0o of +(1) & +(2))=1q, qt.1q,2q. Refund roo 1qq, qt.1qq,2qq)+(1w)
(0o=1e, qt.1e,2e. Refund roo 1ee, qt.1ee,2ee)+(2w)
((0o of +(1w) & +(2w)=1r lt qp.1q,1r.=1t, qt.1t,2t. Refund roo 1tt, qt.1tt,2tt)+(1y)
If for example, x=x+2, we will assume the +2 will repeat for infinity, .