The polynomial realized Delta –formulas are considered with quantifiers acting on hierarchy lists described by CF-grammars. These formulas are interpreted on a many-sorted model with the hierarchy list superstructure. The constant model is constructed for the Noether confluent theory based on quasi-identities. The signature predicates and functions are interpreted on input CF-list extended on the interpretation process. The Delta –formulas theories might be used to model real-time systems. As example a logic specification of robot behaviour is given.
| Abstracts file: | Глушкова.pdf |