@ARTICLE { Rsds2208,
author = {Polkowski, Lech T. and Kanda, Akira and Apostoli, Peter John}, 
title = {First Steps Towards Computably-Infinite Information Systems}, 
booktitle = {T. Rough Sets}, 
journal = {Transactions on Rough Sets}, 
number = 	{(no. II)}, 
volume = 2, 
pages = {151-188}, 
publisher = {Springer-Verlag}, 
address = {Heidelberg - Berlin, Germany}, 
year = 2004, 
issn = {0302-9743}, 
isbn = {3-540-23990-1}, 
abstract = {In order to characterize the metric of exact subsets of infinite information systems, [51] studied the asymptotic behavior of omega-chains of graded indiscernibility relations. The SFP object underlying the universe of exact sets presented in [2] provides a concrete example of an infinite graded information system. By controlling the asymptotic behavior of omega-Sequences of Finite Projections, the theory of graded chains of indiscernibility relations articulates the fine structure of SFP objects, providing a metric over exact sets.}, 
keywords = {domain theory, effective domain theory, exact sets, Frege sets, graded indiscernibility, infinite information systems, Myhill-Sheperdson theorem, modal logic, non-standard analysis, numeration theory, rough sets, SFP objects, }, 
}