User blog comment:Boboris02/MBOT/@comment-30167082-20161218101337/@comment-30118230-20161218182838

Yes and here is how:

\(n \neg n\) is the start of our definition.Like I said earlier \(\neg\) by itself does not have a meaning - even more so than the other symbols.

in this case to find the definition of \(\neg\) you need to do the following:

1. search if there is an equal sign immediately after the operation.

a) If there is not go to case 2

b) If there is,then the definition will be given in the system itself.

2.Search if there is \(\Leftrightarrow\) immediately after the operation.

a) If there is not go to case 1

b) If there is,look at what the next number is and what this number is set to represent.

After you know what the value of that is,you set the n to have the value k.

Next you must know what k represents to do that.

Now you use the same two cases as before with just the part 2b changed from

" If there is,look at what the next number is and what this number is set to represent.

After you know what the value of that is,you set the n to have the value k. "

To " If there is,look at what the next number is and what this number is set to represent.

After you know what the value of that is,you set the k to have the definition for which m would give the biggest finite value for all other aspects of the system workig properly. "

In other words:if there is \(\neg n\) find the symbol after it.If it's \(\Leftrightarrow k\) then find what k is and then change it to n.If there is \(\Leftrightarrow k\Leftrightarrow m\) then make m the biggest finite m for which everything else in the system applies.

If that's still too complicated to understand then maybe the way it's soppost to be pronanced will help you.....I guess?

Phi(n) = n neg n return k return m equals max m for which 0011...1100 works if return 0 equals infinity.