Abstract:

 Using P-sets(packet sets), inverse P-sets(inverse packet sets) and its structure are presented, which is briefly expressed as P^-1-sets. P^-1-sets is the dual form of P-sets. P^-1-sets is a set pair composed of internal inverse P-set F and outer inverse P-set , or  (F,)  is P^-1-sets, and P^-1-sets has the dynamic characteristic. The separation theorem and dynamic equivalence class characteristic of P^-1-sets and the application of P^-1-sets are given in the dynamic information system.

Key words: inverse P-sets; separation theorem; dynamic equivalence class characteristic; information discovery