Logic Approximating Sequences of Sets

Helena Rasiowa
Additional contact information
Helena Rasiowa: University of Warsaw, Institute of Mathematics

A chapter in Mathematical Logic and Its Applications, 1987, pp 167-186 from Springer

Abstract: Abstract 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

Date: 1987
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0897-3_11

Ordering information: This item can be ordered from
http://www.springer.com/9781461308973

DOI: 10.1007/978-1-4613-0897-3_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().