First S-questionnaires are introduced as mechanical devices which permit the representation of recursively definable families of information structures by means of sets of sequences of non-negative integers. The subclass of L-questionnaires is then defined enabling: i) a bijection between such a family F and the set ℕ of non-negative integers ii) the construction of an operator admitting exactly the elements of F as its fixed-points. Two examples are treated extensively.
CITATION STYLE
Böhm, C., Dezani-Ciancaglini, M., & Ronchi Della Rocca, S. (1974). Listing of information structures defined by fixed-point operators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 19 LNCS, pp. 266–279). Springer Verlag. https://doi.org/10.1007/3-540-06859-7_139
Mendeley helps you to discover research relevant for your work.