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 < ω, are the most precise.
This is a modified and — in a sense — expounded version of the paper by Rasiowa 1986, prepared for 16th ISMVL, Blacksburg, VA, USA
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Creswell M.J. and Hughes G.E., 1980, An introduction to modal logic. London: Metheuen and Go. Ltd.
Epstein G., The lattice theory of Post algebras, 1960, Trans. Amer. Math. Soc. 95, 63–74
Hunter G.M. and Steiglitz K., 1979, Operations on images using quadtrees, IEEE Trans. Pattern Eecog. Mach. Int., 145–153
Maksimova L. and Vakarelov D., 1974, Representation Theorems for Generalized Post Algebras of Order co ω+, Bull. Pol. Acad. Sci., Ser. Math. Astron. Phys. 22, 757–764
Marek W. and Rasiowa H., 1986, Approximating Sets with Equivalence Relations, Proc. Int. Symp. on Methodologies for Intelligent Systems, October 23–25, Knoxville — Tennessee, USA, to appear
Pawlak Z., 1982, Rough Sets, Int. Journ. of Comp, and Information Science 11(5), 341–356
Rasiowa H., 1973, On generalized Post algebras of order ω+ and ω+-valued predicate calculi, Bul. Ac. Pol. Sci., Ser. Math. Astr. Phys. 21 No 3, 209–219
Rasiowa H., 1985, Topological Representations of Post Algebras of Order ω+ and Open Theories Based on ω+-Valued Post Logic, Studia Logica 44 No 4, 353–368
Rasiowa H., 1986, Rough Concepts and ω+-Valued Logic, Proc. 16th Int. Symp. Multiple-Valued Logic, Blacksburg, VA, USA, Computer Society Press, 282–288
Rasiowa H. and Skowron A., 1985, Rough Concepts Logic, in: Computation Theory, ed. A. Skovuron, LNCS 208, 288–297
Rasiowa H. and Skowron A., 1986, Approximation Logic, in: Mathematical Methods of Specification and Synthesis of Software Systems’85, ed. W. Bibel and K.P. Jantke, Mathematical Research 31, Akademie Verlag, Berlin, 123–139
Ullman J.D., 1983, Principles of Database Systems, Computer Science Press, Rockville MD
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Plenum Press, New York
About this chapter
Cite this chapter
Rasiowa, H. (1987). Logic Approximating Sequences of Sets. In: Skordev, D.G. (eds) Mathematical Logic and Its Applications. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0897-3_11
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0897-3_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8234-1
Online ISBN: 978-1-4613-0897-3
eBook Packages: Springer Book Archive