
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
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 finitecover determination algorithm to a general modeltheoretic language implementing this approach to importation closure.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment