哪位能给理解下: 5 j7 H1 \% o$ [* R& h3 `, w; p . s. V8 G" | M, G9 b9 JFormal Sets3 [9 K9 w1 }1 q- k9 R* j
A formal set consists of the subset of elements of some carrier set (structure) on which a certain predicate assumes the value `true'. F' d. Q, i# |) E/ E# i
5 x# \# Y# s4 |3 |! U; rThe only set-theoretic operations that can be performed on formal sets are union, intersection, difference and symmetric difference, and element membership testing. . a% g) T* f) Y$ [* R8 g5 G # s. n# O0 d4 A' K3 [+ R, C8 Q" g5 H8 }% Y
; R+ j5 V& Y3 n) l* {& n
S := { 1 .. 5};8 t- u! c7 a7 x" w3 Q- o
> P := PowerSet(S);9 f1 c& V1 u' l
P; j4 h C- M" B- {PFS:=PowerFormalSet(S); ( n% c! p. o% q7 T* C4 |; EPFS; 3 U2 D/ h5 q) ZF := { 2, 4 };" D) J* ?( x; F5 [
FF := { 2/3, 4 };* m/ U1 b k: A# u: d
5 p, P( y4 o% T- \5 @6 Z
F in P;+ D, q1 i" F8 y# O
FF in P;1 `* A6 U* B( O5 \! }5 J
F in PFS;6 x, h3 V, M6 \/ Z1 V( j
FF in PFS;+ k7 }5 b( n8 d4 M* w
Set of subsets of { 1 .. 5 }5 D4 f8 v" c. S0 n( g# S1 h
Set of formal subsets of { 1 .. 5 }0 R4 j+ U6 }1 a! _! g
true 5 ^! \' t0 F3 @$ p# t% R' Z! T7 Jfalse, L& H4 D# j: w9 S
h" ~" x+ A+ R: \
>> F in PFS; + f7 }+ o* ?( h3 X1 l6 a0 B ^ 2 b- N: D$ [$ y. {; ]4 a2 cRuntime error in 'in': Bad argument types 6 W9 E' O( W; ]4 S5 t; g- q- f + b4 r$ {. r# j7 q$ b $ J1 X. Y1 ^# V0 v4 f3 T>> FF in PFS; # I! H7 J; p( \2 T+ G9 e" r g ^7 { R/ H) L+ |
Runtime error in 'in': Bad argument types