Preview
Unable to display preview. Download preview PDF.
References
Chen K.H., Raś Z., Skowron A., Attributes and rough properties in information systems, Proc. of the 1984 Conf. on Information Sciences and Systems, March 14–16, 1984, Princeton pp. 362–366
Fagin R., Generalized first-order spectra and polynomial recognizable sets, "Complexity of Computation," SIAM-AMS Proc. 7, 1974
Orłowska E., Pawlak Z., Representation of nondeterministic information, Theoretical Computer Science 29, 1984
Pawlak Z., Rough relations, ICS PAS Reports 435 (1981)
Pawlak Z., Rough sets, International Journal of Information and Computer Science, 11 (5), 341–356, 1982
Pawlak Z., Rough classification, Int. J. Man-Machine Studies 20, 469–483, 1984
Rasiowa H., Sikorski R., The mathematics of metamathematics, Warsaw PWN 1970
Stockmeyer L., Chandra A.K., Provably difficult combinatorial games, SIAM Journal Comput., 8 (2), 151–174, 1979
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rasiowa, H., Skowron, A. (1985). Rough concepts logic. In: Skowron, A. (eds) Computation Theory. SCT 1984. Lecture Notes in Computer Science, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16066-3_24
Download citation
DOI: https://doi.org/10.1007/3-540-16066-3_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16066-3
Online ISBN: 978-3-540-39748-9
eBook Packages: Springer Book Archive