Be the first to like this
The ISO Standard 24707 for Common Logic is under revision to fix certain issues in its semantics. One of these issues is in regard to the interpretation of circular importations, which is syntactically valid but semantically ambiguous. Elsewhere we have proposed a modification to the importation semantics that solves the theoretical problem. However, the importation closure of some finite collections (corpora) of texts leads to infinite corpora. For practical reasoning, we can work with finite covers- finite corpora that are equivalent in a particular sense to the original corpus. In this study we derive algebraic conditions for the applicability of an finite-cover determination algorithm to a general model-theoretic language implementing this approach to importation closure.