On 03/01/2017 05:23 PM, mitch wrote:
< snip >
This theory will use a non-eliminable identity
relation introduced by recursive definition and
an eliminable indiscernibility relation introduced
by constructive definition. With respect to the
non-eliminable identity relation, it is assumed
that the logic includes the axiom,
AxAy( Ez( x = z /\ z = y ) -> x = y )
and the schema
A_{phi}A_{x,y}[ ( Ex( phi(x) ) -> ( phi(y) /\ y = y ) ]
where y does not occur free in phi(x)
governing the introduction of bare identity statements
into a proof. Any such logic will require additional
changes to other quantifier rules because it is assumed
that occurrences of free singular terms in a proof is
governed by correspondence with the identity statements
in a proof.
======================================
Recursively defined relations
======================================
01)
An apartness relation
AxAy( x # y <-> ( ~( x # x ) /\ ( ( ~( x # x ) -> y # x ) /\ ( y # x ->
x # y ) ) ) )
When apartness is asserted in the standard fashion, it
is given by the rules,
Ax~( x # x )
Ax( x # y -> y # x )
AxAy( x # y -> Az( x # z \/ z # y ) )
As can be seen by examination, the first two rules
are explicitly expressed in the definiendum above,
although the symmetry rule is represented by its
converse. The third rule is easily seen to be
the contrapositive form of the sentence which is
assumed to govern the introduction of bare
informative identity statements in logical
deductions,
AxAy( Ez( x = z /\ z = y ) -> x = y )
The sentence above will be related to this logical
axiom through a relation with the non-eliminable
identity stipulated through axioms in the theory.
-----
02) A non-eliminable identity relation
AxAy( x = y <-> Ez( x = z /\ z = y ) )
It is through this relation that the indiscernibility
of singular terms with respect to the non-logical
symbols may be assumed to correspond with the
interpretation of singular terms as individuals.
-----
03)
Subsitutivity with respect to the language primitive
AxAy( x not-in y <-> ( Az( ~( z = y ) \/ ( z = y /\ x not-in z ) ) \/
Az( ~( x = z) \/ ( x = z /\ z not-in y ) ) ) )
This appears confusing because it is using the intended
negation of the primitive to implement substitutivity.
It is easier to understand in terms of the formulas,
Ez( z = y /\ ( z = y -> x in z ) )
Ez( x = z /\ ( x = z -> z in y ) )
These formulas certainly make
x in y
true whenever the two existence assertions are
satisfied.
Substitutivity for the language primitives must be
explicitly provided for because the indiscernibility
of identicals,
A_{phi}A_{x,y}[ x = y -> ( phi(x) -> phi(y) ]
is not available until a bare identity statement has
been introduced.
======================================
Constructively defined relations
======================================
04) An eliminable indiscernibility relation
AxAy( x :: y <-> ( Az( x in z <-> y in z ) /\ Az( z in x <-> z in y ) ) )
Anyone familiar with Quine's analysis in "Set
Theory and Its Logic" should recognize this form.
One may call this a "defined identity". With
respect to the philosophy behind the standard
account of identity, this is a "relative
identity". As such, it expresses no more than
indiscernibility. It cannot support the
individuality which underlies the purported
interpretation of singular terms.
It is the simple assertion that one cannot
discern between singular terms on the basis of
the language primitive. More correctly, it
enforces that condition as a constraint.
======================================
Axioms
======================================
05)
Introduction of the primitive relation
AxAy~( x in y <-> x not-in y )
Observe that an exclusive disjunction has been
used here. This reflects classical logic as
a limit of partial systems. If a unary negation
had been used,
AxAy( x in y <-> ~x not-in y )
then it would be more correct to call this a
constructive definition with respect to symbols
that have already been defined.
-----
06)
A true apartness relation only holds for existents
AxAy( x # y -> ( x = x /\ y = y ) )
-----
07)
A true trivial identity relation must deny a trivial
apartness relation
Ax( x = x -> ~( x # x ) )
-----
08)
A false informative identity relation must affirm an
apartness relation
AxAy( ~( x = y ) -> x # y )
-----
09)
Fregean concept identity denies apartness
AxAy( Az( z in x <-> z in y ) -> ~( x # y ) )
It is important to compare this antecedent with
the consequent of the axiom in 11). When that
consequent is satisfied, this axiom is satified.
-----
10)
Denying Fregean object identity denies identity
AxAy( Ez~( x in z <-> y in z ) -> ~( x = y ) )
It is important to compare this antecedent with
the antecedent of the axiom in 11). When that
antecedent is not satisfied, this axiom is satified.
-----
11)
Fregean object identity affirms Fregean concept
identity
AxAy( Az( x in z <-> y in z ) -> Az( z in x <-> z in y ) )
======================================
Theorems
======================================
12)
Indiscernible terms may be presumed to denote the same
individual
AxAy( x :: y -> x = y )
-----
13)
Discernible terms may be presumed to denote different
individuals
AxAy( ~( x :: y ) -> x # y )
======================================
Proofs
======================================
14) Theorem 1: AxAy( x :: y -> x = y )
Let x and y be arbitrary such that x :: y. This
establishes the premise. From
AxAy( x :: y <-> ( Az( x in z <-> y in z ) /\ Az( z in x <-> z in y ) ) )
it follows that
( Az( x in z <-> y in z ) /\ Az( z in x <-> z in y ) ) )
By the elimination of the conjunction, one may
further conclude
Az( z in x <-> z in y )
But, this is just the premise for the axiom,
AxAy( Az( z in x <-> z in y ) -> ~( x # y ) )
Thus, ~( x # y ). Given the axiom,
AxAy( ~( x = y ) -> x # y )
one obtains
x = y
from the contrapositive.
This completes the proof.
-----
15) Theorem 2: AxAy( ~( x :: y ) -> x # y )
Let x and y be arbitrary such that ~( x :: y ). This
establishes the premise. From
AxAy( x :: y <-> ( Az( x in z <-> y in z ) /\ Az( z in x <-> z in y ) ) )
it follows that ~( x :: y ) has three cases,
Ez~( x in z <-> y in z ) /\ Az( z in x <-> z in y )
Ez~( x in z <-> y in z ) /\ Ez~( z in x <-> z in y )
Az( x in z <-> y in z ) /\ Ez~( z in x <-> z in y )
By the axiom,
AxAy( Az( x in z <-> y in z ) -> Az( z in x <-> z in y ) )
one can exclude the third case. This leaves,
Ez~( x in z <-> y in z ) /\ Az( z in x <-> z in y )
Ez~( x in z <-> y in z ) /\ Ez~( z in x <-> z in y )
But,
Ez~( x in z <-> y in z )
holds in both of these case after elimination of
the conjunctions. Moreover, this is just the
premise for the axiom,
AxAy( Ez~( x in z <-> y in z ) -> ~( x = y ) )
Thus ~( x = y ) holds. Given the axiom,
AxAy( ~( x = y ) -> x # y )
one obtains x # y from ~( x = y )
This completes the proof.