Operation like relation between numbers

[bertanimauro]

a+b=c is a relation between a,b,c. In logic term is the number f that implies all three number a,b,c
https://docs.google.com/document/d/1Wd3mL2Azm5t76_wlhJHaZqUboJWWpPA457ypCD2ITKk/edit?usp=sharing
https://groups.io/g/lawsofform/message/995

[bertanimauro]

a possible interpretation of the sentence "this sentence is false" should be true if the sentence is false or otherwise false if the sentence is true. The best code I have found is the following:
(((!a) =>a) =>! a) xor ((a=>! a) =>a)
!a xor a
When I asked my professor to explain type theory to me in my first university computer class, he showed me this example:
a=2
a=(a*a)+1
with unlimited resources "a" tends to infinity. But if we put "a" in an integer (which will become its context) it will start bouncing between the max.integer and the min.integer.
It is similar to the sentence above. According to what the sentence evaluate, its truth value will imply the opposite.
With this example that partly does not express the concept well, because the logical phrase is always false due to the fact that a number less than a power of two in relation to a smaller number does not have a number that implies both, I try at least to express the idea.
The expression is
(243+75)%256=62
318%256=62
if you want to express the relationship between the numbers of this expression you could limit yourself to the three numbers 318,256,62.
318&256=256
256&62=0
but if you want to express the concept that the sum does not go to infinity because it is inside a field-context, then you will have to keep in mind the relationship between these three numbers as well 243,75,318
243&75=67
67&318=2
putting the two relations into a system we get 2 & 0 = 0: As I said at the beginning, there is no number that implies the two triples of numbers at the same time.
it's just an idea. Actually, after 20 from the example of my professor I still haven't understood the theory of types but it is as if every time I approximate it to a radical.
Returning to the sel-referencial sentences: "No idea is correct enough to always be true".

REF:
https://groups.io/g/lawsofform/message/1002
http://web.archive.org/web/20150802184000/http://forum.wolframscience.com/archive/topic/266.html

[bertanimauro]

(((!a) =>a) =>! a) & ((a=>! a) =>!a)

[bertanimauro]

Find value of single variable in cellular automata, by these values you can create all logical sentences
https://docs.google.com/document/d/1_jLowlngU4MUw19gQKWvuj_xNGgHBrPqOjRrXnUPido/edit?usp=sharing