Repository | Book | Chapter
(1987) Mathematical logic and its applications, Dordrecht, Springer.
In various studies concerning computer science or artificial intelligence, in which approximation tools could be applied, there appears a need of gradual approximating descending set sequences X = (Xm) (e.g. of documents, objects, points) formed of elements satisfying some stronger and stronger conditions. Gradual approximations (both: lower and upper ones) are determined by a descending sequence (≌ j) of equivalence relations, going to be established progressively. Approximations of grade j+1 are better than those of grade j. Approximations determined by ≌ω, which is the intersection of ≌j for j < ω, are the most precise.
Publication details
DOI: 10.1007/978-1-4613-0897-3_11
Full citation:
Rasiowa, H. (1987)., Logic approximating sequences of sets, in D. G. Skordev (ed.), Mathematical logic and its applications, Dordrecht, Springer, pp. 167-186.
This document is unfortunately not available for download at the moment.