哪位能给理解下: # k1 j1 [! s0 Z. A; L # x+ s; a2 O8 [! c6 f _1 VFormal Sets1 p q4 }% U. ^" o* E, H+ M1 P- B
A formal set consists of the subset of elements of some carrier set (structure) on which a certain predicate assumes the value `true'. ) _! G4 l) W" p q0 A+ Y) N5 S! ?, O9 j' h! R
The only set-theoretic operations that can be performed on formal sets are union, intersection, difference and symmetric difference, and element membership testing. 0 m5 S! D" t) W8 y- g . v; s' y9 G3 ]4 X1 ?# W5 m7 i, ~2 t/ M, h3 ?4 w6 `+ O
* P3 P, s- Z; gS := { 1 .. 5}; / i- i/ I/ w% Q* A8 N> P := PowerSet(S);" U2 o; n& I, u$ F* @( V
P;/ u2 S( N$ M7 `( R1 l: A S2 W! ^% C
PFS:=PowerFormalSet(S); $ o$ V( x/ T p+ [& o; g4 JPFS; + f4 h v- \/ O6 PF := { 2, 4 };: J, S6 p$ l- Y
FF := { 2/3, 4 }; : S9 t# O V$ }2 c/ @; W/ \ . F% [$ ~4 O. @2 z4 H# S3 t: O F in P;; ?4 a- k+ [, L5 a' v
FF in P; - a! `; X9 ^4 ~ F in PFS; ' h9 ~0 F0 \8 |FF in PFS;) T6 ?3 E+ y X; v/ X' w
Set of subsets of { 1 .. 5 } 0 Z( ?" y w: v6 H% ^Set of formal subsets of { 1 .. 5 } . B& X8 g3 f( ?/ v7 {0 otrue) V# ~+ s7 l' O% A4 p) p
false8 u9 W/ _& u Q* Y" I4 _
3 C3 |+ z' L3 @ L$ s! |, _1 m>> F in PFS; ) f' J o# o! E" O4 ^' N t ^ / ^2 p3 u' o, l' Z( LRuntime error in 'in': Bad argument types * \8 X7 A4 v( H5 L% | D" ]5 _7 @/ y' V( U
: I( I( D2 W" h>> FF in PFS;' q0 a w X, M" t
^( b2 K. B2 c2 N
Runtime error in 'in': Bad argument types