Paper Info
Title
Listing of information structures defined by fixed-point operators
Abstract
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.
Year
DOI
Venue
1974
10.1007/3-540-06859-7_139
Symposium on Programming
Keywords
Field
DocType
information structure,fixed-point operator,fixed point
Integer,Discrete mathematics,Combinatorics,Bijection,Mechanical devices,Subclass,Operator (computer programming),Fixed point,Mathematics,Recursion
Conference
ISBN
Citations 
PageRank 
3-540-06859-7
0
0.34
References 
Authors
2
3
Name
Order
Citations
PageRank
Corrado Böhm1487413.44
Mariangiola Dezani-Ciancaglini21615193.57
Simona Ronchi Della Rocca343670.94