As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
We introduce a logical language with nullary operators min(n), for each non-negative integer n, which mean ‘the reasoner has at least n different beliefs’. The resulting language allows us to express interesting properties of non-monotonic and resource-bounded reasoners. Other operators, such as 'the reasoner has at most n different beliefs' and the operator introduced in [1, 4]: 'the reasoner knows at most the formulae φ1,…,φn′, are definable using min(n). We introduce several syntactic epistemic logics with min(n) operators, and prove completeness and decidability results for those logics.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.