First Steps Towards Computably-Infinite Information Systems

Abstract

In order to characterize the metric of exact subsets of infinite information systems, [51] studied the asymptotic behaviour of unchains 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 behaviour of ο-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. © Springer-Verlag 2004.