The destiny of constant structure discrete time closed semantic systems
This addresses a theoretical problem in semantic systems analysis, but it appears incremental as it builds on known concepts without broad application.
The paper tackles the problem of iterative redefinition in constant structure closed semantic systems with discrete time, proving that the process quickly degenerates into a series of pairwise isomorphic states.
Constant structure closed semantic systems are the systems each element of which receives its definition through the correspondent unchangeable set of other elements of the system. Discrete time means here that the definitions of the elements change iteratively and simultaneously based on the "neighbor portraits" from the previous iteration. I prove that the iterative redefinition process in such class of systems will quickly degenerate into a series of pairwise isomorphic states and discuss some directions of further research.