Extra Concepts and Domains of Truth Values in Interpreting Logical Languages in Artificial Intelligence Systems

Abstract

So-called extra concepts introduced to represent structurally defined objects and structures with unlimited complexity in their traditional understanding are suggested. The concepts of extra-word, extra-regular expression, context-free extra-grammar, and context-free extra-language are extensions of the well-known concepts used in the theory of formal languages. Extra words are a special case of symbol sequences; however, the set of all extra words in any alphabet is countable, whereas the set of all symbol sequences is not countable. The periodic codes of rational number representations in some positional numeration system are in fact extra words in this terminology. The concept of an extra-tuple is a generalization of the tuple concept, which implies the possibility of interpreting extra-tuples both as finite and as the indicated type of infinite sequences of elements of an arbitrary, not more than countable set, and it should be noted that the set of all possible sequences of such sort remains countable.

By using the introduced concepts, a countable family of the domains of truth values has been specified for multivalued and countable-valued logics, each of which is a bounded lattice of finite or countable power with the traditional definition of basic logical operations of negation, conjunction, and disjunction. The hierarchical construction of the proposed truth domains makes it possible to introduce new logical operations in consideration that do not have analogues in the classical logic.