哪位能给理解下: ! [* E& A( e$ u1 ~) ] + a) b+ H" n" U" j! D( DFormal Sets4 x% m5 C, T$ k: _7 a
A formal set consists of the subset of elements of some carrier set (structure) on which a certain predicate assumes the value `true'. $ b% ^" Z V- G O8 {3 F8 Q. J5 x5 w3 W! P- |6 J Q ~8 \" ^
The only set-theoretic operations that can be performed on formal sets are union, intersection, difference and symmetric difference, and element membership testing. ( l7 k/ x+ _# w6 j2 y" H, p, T: K, q/ g' V
+ p. h& i ^5 k R
( A+ i8 m5 [" n( Z/ ?+ W8 k* }S := { 1 .. 5};* t5 O( |/ i% s3 _/ ?. f6 g+ U
> P := PowerSet(S); 2 ]! v4 P ^, v. ?- G0 Y1 t7 yP; ( h) W2 X6 M3 F% f# Q& w; G- C6 cPFS:=PowerFormalSet(S); 3 `9 i* I1 N# Q# N7 yPFS;! _, w( n" t" y9 r
F := { 2, 4 };: S( r$ |6 |; o5 I& d
FF := { 2/3, 4 }; : J z/ \* y& V. `/ }- `6 o( t- J4 V- |! g1 u) W: c
F in P; " s9 K! n7 {& X- D; F" M) lFF in P;( s' Y2 l+ S/ V" G1 ` [
F in PFS; S8 p8 |9 A% a' H
FF in PFS;5 k- F9 y$ t7 F) M3 ^( d) d
Set of subsets of { 1 .. 5 }+ y! ~ c5 t/ M- c
Set of formal subsets of { 1 .. 5 }1 q& m2 ^' f* @
true ' V; a- a- X1 k/ H) m4 ~false* a: _6 b. G0 U' O4 a
- S5 u( g8 g: M* F, B$ E) F
>> F in PFS; ; {( d. C# W# T ^ , e& j# B0 \% C5 t" m. fRuntime error in 'in': Bad argument types ( _ k* W$ ?# O* Y/ p+ r: n+ h* P: {8 \
- V3 L3 @8 S0 N/ c' r>> FF in PFS;- [$ \, O& C% J# X' X9 e" O
^ 9 K' }5 L8 p1 f2 ?Runtime error in 'in': Bad argument types