哪位能给理解下: , |$ d+ P8 [1 f" U) D! M- _3 f" l' H4 i4 \4 t; w0 k
Formal Sets # R8 r( C+ @4 dA formal set consists of the subset of elements of some carrier set (structure) on which a certain predicate assumes the value `true'. , F1 y' X5 M( y6 d- F" I0 z
2 B" W% [7 Q- s; f( UThe only set-theoretic operations that can be performed on formal sets are union, intersection, difference and symmetric difference, and element membership testing. 2 H, p0 B" [* x( h4 P3 f6 s: h/ E% O: T2 Y( x4 x5 f( O
# Y- ]9 r1 I! |. W
* a" Y# Z6 H& @+ j0 n$ V( @
S := { 1 .. 5}; 9 b; ?* J! n/ \' F> P := PowerSet(S); ' V5 Y6 V) v6 g! _/ }4 VP; ) n2 ?4 _% l, `PFS:=PowerFormalSet(S); ' S( k9 B/ r( h: ePFS;. |' a( a5 @1 y( Q
F := { 2, 4 };; p! \+ L- s& f- }! Q/ x; k
FF := { 2/3, 4 };: A, D$ v9 }- q6 F
* @1 w- C; M, d7 ?- g% T
F in P;! M7 y( Z5 w6 L, c
FF in P; ' D2 O: C4 @/ X0 V% ?7 @ F in PFS;* [5 ?; g# F) ?* W* X
FF in PFS;$ C) ]' S* ]( M4 c6 N, ]
Set of subsets of { 1 .. 5 }$ u8 T6 s+ C( j; L. Y* o% \# z
Set of formal subsets of { 1 .. 5 }3 S% Q' l5 X: {1 {5 x: W0 i7 e
true1 `& O6 m; d, u2 F) D0 J& q
false 9 k" }1 Y; d) a2 S: a& W5 u6 G: X+ N9 p% l
>> F in PFS;9 _ ]( e# ? n' {0 F# @1 M$ A
^ 6 J: q3 W( P1 t/ d; O4 G& E q2 BRuntime error in 'in': Bad argument types # c, H# S' `" l 9 m* z; b- n# |& O+ a $ E2 D* z+ C% ~>> FF in PFS;- s2 Z; v+ u9 o, ~. B+ _. X. R6 h
^3 o/ k# [" p9 A. _! B: I9 S
Runtime error in 'in': Bad argument types