Separating sets by modal formulas

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Subsequently, we introduce a reasoning formalism which in particular allows to express that certain sets in a system of subsets of a given set are disjoint. The main purpose of considering such a family of subsets is to be able to investigate how knowledge grows as subsets shrink in the course of time. We actually introduce a trimodal logic: we have a system containing operators for knowledge and time, of which the latter corresponds to the effort of measurement and reminds of the nexttime operator of temporal logic; an operator separating sets is added then. So-called subset tree models appear as the relevant semantical structures.We present an axiomatization of the set of valid formulas encompassing the three operators and their interaction. Afterwards the completeness of the given axiomatization is proved. We also give arguments showing that the logic is decidable.

Cite

CITATION STYLE

APA

Heinemann, B. (1998). Separating sets by modal formulas. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1548, pp. 140–153). Springer Verlag. https://doi.org/10.1007/3-540-49253-4_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free