Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .
0 of .
Results for:
P. 1
Nxor\Xor Logic

# Nxor\Xor Logic

Ratings: (0)|Views: 1,045|Likes:
We show that cardinality is incomplete logically. As a result there is a logical solution of Russell’s paradox and proper classes are avoided. Expressions like 1/0 and 0/0 are defined.
We show that cardinality is incomplete logically. As a result there is a logical solution of Russell’s paradox and proper classes are avoided. Expressions like 1/0 and 0/0 are defined.

### Availability:

See more
See less

08/22/2010

pdf

text

original

1
NXOR\XOR Logic
Abstract:We show that cardinality is incomplete logically. As a result there is alogical solution of Russell’s paradox and proper classes are avoided. Expressions like 1/0 and 0/0 are defined.
Keywords:
"The set of all ideas is not a member of itself exactly as
{}
is not amember of itself. As a result |
{}
|=0 and not 1 , |
{}
}
|=1 and not 2 ,|
{},{{}}
}
|=2 and not 3

,

The standard notion of the concept of Set:
" By the standard notion a set is determined by its members, where thedomain is not explicitly defined."

A non standard notion of the concept of Set:
"But being a member (being related) is meaningless if it is not related toa domain (a relator which enables to research member's
in
,
out
relations)so the domainmust be explicitly defined if we are using a concept like Membership. If the domain isexplicitly defined then a set is not less thandomain\member relations, where the domain is not a member and amember is not the domain. For example: |
{}
|=0 and not 1 , |
{}
}
|=1 and not 2 , |
{},{{}}
}
|=2 and not 3

,

etc. ... ad infinitum ... exactly because thedomain (notated by the outer
and
}
is not a member".

2
Introduction:
The two values of 2-valued logic have 16 different connectives, where eachconnective is the logical relation between the two values.Let
A
be 0011Let
B
be 0101
A
and
B
have these values because together they cover the all possibilities of 2 values,which are:
A

B
0 00 11 01 1When we research the difference between
A
and
B
we discover that they have twocommon relations (invariant under exchange) which are 00;11 and two differentrelations (variant under exchange) which are 01;10. It means that 2-valued Logic isbased on common\non-common relations that stand in the basis of any givenconnective of the 16 connectives.Let a pair of common values be called a non-local relation between
A
;
B
.Let 00 be empty non-local.Let 11 be full non-local.Let non-common values be called a local relation between
A
;
B
.Let the local\non-local relation of each connective (of 16 possible logical connectives)be determined by its true states:
A
0 0 1 1
B
0 1 0 1
0
0 0 0 0 No measurement
A
AND
B
0 0 0 1 Full non-local
A
not

B
0 0 1 0 Local
A

A
0 0 1 1 Full non-local , Local
A

A

not
B
0 1 0 0 Local
B

B
0 1 0 1 Full non-local , Local
B

A
XOR
B
0 1 1 0 Local
A
, Local
B

A
OR
B
0 1 1 1 Full non-local , Local
A
, Local
B

A
NOR
B
1 0 0 0 Empty non-local
A
NXOR
B
1 0 0 1 Full non-local , Empty non-localNOT
B
1 0 1 0 Local
A
, Empty non-local
A

B
1 0 1 1 Full non-local , Local
A
, Empty non-localNOT
A
1 1 0 0 Local
B
, Empty non-local
A

B
1 1 0 1 Full non-local , Local
B
, Empty non-local
A
NAND
B
1 1 1 0 Local
A
, Local
B
, Empty non-local
1
1 1 1 1 F. non-local , Local
A
, E. non-local , Local
B

Values

Connectives

3
If Non-locality or Locality are related to the same connective more than once, thentheir unique properties are ignored (Fullness and Emptiness or
A
and
B
are ignored):
A
0 0 1 1
B
0 1 0 1
0
0 0 0 0 No measurement
A
AND
B
0 0 0 1 Full non-local
A
not

B
0 0 1 0 Local
A

A
0 0 1 1 Full non-local , Local
A

A

not
B
0 1 0 0 Local
B

B
0 1 0 1 Full non-local , Local
B

A
XOR
B
0 1 1 0 Local
A
OR
B
0 1 1 1 Full non-local , Local
A
NOR
B
1 0 0 0 Empty non-local
A
NXOR
B
1 0 0 1 Non-localNOT
B
1 0 1 0 Local
A
, Empty non-local
A

B
1 0 1 1 Non-local , Local
A
NOT
A
1 1 0 0 Local
B
, Empty non-local
A

B
1 1 0 1 Non-local , Local
B

A
NAND
B
1 1 1 0 Local , Empty non-local
1
1 1 1 1 Non-local , LocalIn order to avoid confusion between classical logical connectives of 2-valued logicand the new theory that is based on symmetry as a first-order concept, let us use this2-valued table:
A
0 0 1 1
B
0 1 0 1
A

Nm

B
0 0 0 0 No measurement
A

Fnl
B
0 0 0 1 Full non-local
A

LA

B
0 0 1 0 Local
A

A

FnlLA

B
0 0 1 1 Full non-local , Local
A

A

LB

B
0 1 0 0 Local
B

A

FnlLB

B
0 1 0 1 Full non-local , Local
B

A

L

B
0 1 1 0 Local
A

FnlL

B
0 1 1 1 Full non-local , Local
A

Enl

B
1 0 0 0 Empty non-local
A

Nl

B
1 0 0 1 Non-local
A

LAEnl

B
1 0 1 0 Local
A
, Empty non-local
A

NlLA

B
1 0 1 1 Non-local , Local
A

A

LBEnl

B
1 1 0 0 Local
B
, Empty non-local
A

NlLB

B
1 1 0 1 Non-local , Local
B

A

LEnl

B
1 1 1 0 Local , Empty non-local
A

NlL

B
1 1 1 1 Non-local , Local
Values

Values

Connectives

Connectives