Abstract:

Through improving an ordinary finite cantor set X inverse packet set is introduced by bringing dynamatic feature into X. Inverse packet set consists of an internal inverse packet set F and an outer inverse packet set  which is denoted briefly by a set pair (F,). It can be reduced to an ordinary set in some situations. Inverse Preasoning is a dynamatic reasoning generated by inverse packet sets which is composed of internal inverse packet reasoning and outer inverse packet reasoning together. Utilizing inverse packet sets and inverse packet reasoning, one defines severval important concepts such as inverse packet equivalence class, internal inverse packet equivalence class and outer inverse packet equivalence class and on the other hand, one obtains a relationship between inverse packet equivalence class and ordinary equivalence calss. Finally, one achieves seperation and reduction on inverse packets equivalence class and separation-reduction theorem as well.  Under static-dynamatic conditions, ordinary equivalence class is a special case of inverse packet equivalence class and inverse packet equivalence class is a general form of the ordinary one.

Key words: inverse packet sets; inverse packet equivalence class; inverse packet reasoning; reasoning separation; separation-reduction theorem