First steps towards computably-infinite information systems

Authors:
Peter Apostoli;Akira Kanda;Lech Polkowski
Affiliations:
The University of Pretoria, Pretoria, South Africa;The University of Toronto, Ontario, Canada;Polish Japanese Institute of Information Technology, Warsaw, Poland
Venue:
Transactions on Rough Sets II
Year:
2005

Citing 12
Cited 0

Type reducing correspondences and well-orderings: Frege's and Zermelo's constructions re-examined

Journal of Symbolic Logic
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
On fractal dimension in information systems. Toward exact sets in infinite information systems

Fundamenta Informaticae
Constructive Category Theory (No. 1)

Proceedings on Mathematical Foundations of Computer Science
On Generalizing Pawlak Approximation Operators

RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Approximation Spaces of Type-Free Sets

RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Rough-Neuro Computing

RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
On Asymptotic Properties of Rough-Set-Theoretic Approximations. Fractal Dimension, Exact Sets, and Rough Inclusion in Potentially Infinite Information Systems

TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Combinators and classes

Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
When are two Effectively given Domains Identical?

Proceedings of the 4th GI-Conference on Theoretical Computer Science
The category-theoretic solution of recursive domain equations

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Constructive and algebraic methods of the theory of rough sets

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to characterize the metric of exact subsets of infinite information systems, [51] studied the asymptotic behaviour of ω–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 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.