Preliminary calculus note

On inverted calculus:

This is just a preliminary note, without much thought put into it yet.

How to state all answers? By eliminating all non-answers?

Maybe.

But let's start with: x != x.

x = x + a

x = 1

a != 0.

Find a != a.

This states all answers to x.

Given:

a != a

Then a = -1, 1, 2, 3, 4, ..

and a = 0 

because x = x + a

then

a = 0

in 1 = 1 + 0

--


Comments

  1. PsimythJanuary 15, 2023 at 6:42 AM

    Let's try:

    x = x * a
    a != x
    Find a != a
    a != 1

    Given x = 2
    2 = 2*a
    x = x/a

    Dividing by 0 given not an option,
    2 = 2 * 0 is also false.

    But x = x/a
    a is not 0,
    x/a = 2 means 1/2*a
    x = x*a*1/2
    Etc.

    ReplyDelete

Post a Comment

Popular posts from this blog

Weather

You are weathering Me up, Crazy, Down With rain And suns, Stars at midnight Falling upon me Flying like bats On ocean white beached Islands With your body naked, I'm yours Then.
Read more

3-way transistor and uneven logic

Lets think about this: a 3 way transistor and uneven logic. So we have, logically speaking: a&b&c with three possible values (0,1,2): 0&0&0=0 0&0&1=0 0&0&2=0 0&1&0=0 0&1&1=1 0&1&2=0 0&2&0=0 0&2&1=0 0&2&2=2 1&0&0=0 1&0&1=1 1&0&2=0 1&1&0=1 1&1&1=1 1&1&2=1 1&2&0=0 1&2&1=1 1&2&2=2 2&0&0=0 2&0&1=0 2&0&2=2 2&1&0=0 2&1&1=1 2&1&2=2 2&2&0=2 2&2&1=2 2&2&2=2 Right? Let's update with the rest: Updating on the 4 bit propositional logic, Which should be 3 way or 2nd order uneven logic (since 1=1 is 1st order): As in: What if there were 3 true/false/X values? Now for or denoted by | (inclusive): 0|0|0=0 0|0|1=1 0|1|0=1 0|1|1=1 1|0|0=1 1|0|1=1 1|0|2=2 1|1|0=1 1|1|1=1 1|1|2=1 - 0|0|2=2 0|1|2=2 0|2|0=2 0|2|1=2 2|0|0=2 2|0|1=2 2|1|0=2 2|1|1=2 2|1|2=2 2|2|2=2 Let's denote exclu...
Read more