Languages for the assessment of knowledge (Q1087504)

Given a set of questions X, the state of knowledge of any individual is a subset K of X, hence all possible states of knowledge is a family k of subsets of X; this pair constitutes a knowledge structure. An assessment language over X (defined recursively) is shown to be identical with a BC- language as defined by the authors. Finally it is shown that a partially ordinal knowledge structure can always be recovered from its assessment languages. Reviewer's comment: There exists a very strong Ideenkreis around the logical approach to knowledge theory; cf. e.g. \textit{J. Y. Halpern} (ed.), Theoretical aspects of reasoning about knowledge (1986).