On Monday, September 1, Newberry wrote:
>
> It is defined: An adjective is heterological iff it does not have the
>
> property it expresses.
ok so
H = { long , ... }
short ~e H
since 'short' is a short adjective.
>
>
>
> We can prove that the class of heterological adjectives is NOT a set:
>
> Assume 'heterological' is a member of the class of heterological
>
> adjectives ... etc. A contradiction follows. Hence the class of
>
> heterological adjectives is not a set. It *CANNOT* be an element of any
>
> class. But what exactly does "cannot" mean?
stratified out, unable to be specified, re-defined
>
>
>
> What does it mean "defined in abstract entities"? "Green" is not
>
> heterological because it is not green. What does not make sense? And if
>
> "it" (whatever that is) does not make sense what are we supposed to
>
> conclude?
>
>
>
> a) '~(h e h)' is false
>
> b) '~(h e h)' is malformed
>
> c) other
>
>
>
>
> Right. The class R of all classes that are not members of themselves is
> not a set hence it is not a member of itself.
>
> I guess I am asking how we avoid a contradiction if the non-membership
> is NOT a syntactical issue.
You could use a more advanced grammar than WFF.
http://tinyurl.com/new-math-foundations
Well Formed Formula are a syntactic method to
recursively incrementally construct finite sentences.
WFF ::= term_n
WFF ::= VAR_n
WFF ::= term_n( WFF_1 , WFF_2 , ... WFF_n )
WFF ::= ALL( VAR_n ) WFF
WFF ::= EXIST( VAR_n ) WFF
WFF ::= WFF_1 ^ WFF_2
WFF ::= WFF_1 v WFF_2
WFF ::= WFF_1 -> WFF_2
WFF ::= WFF_1 <-> WFF_2
WFF ::= WFF_1 = WFF_2
WFF :: = ~WFF
e.g. by limiting ALL(V) WFF
to ALL(V) V<epsilon
so you can range over ANY ELEMENT in formulations
but not ALL ELEMENTS
Or you could try my new Logic Quantifier (V)
http://tinyurl.com/new-logic-foundations
RUSSELL SET 1
Ax xer <-> x~ex
RUSSELL SET 2
r = Ax xer <-> (x~ex & x~=r)
RUSSELL SET 3
Vx xer <-> x~ex
RS2 & RS3 are equivalent and valid sets
"the set of all sets that don't belong themselves barring this actual set!"
RS3 is a concise notation that avoids Russells Paradox without any restrictions on naïve set specification.
Just define the set correctly to start with!
heterological = 'properties that are not properties of that property barring heterological itself'
DONE! DEFINED!