{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:59:02Z","timestamp":1743087542014,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319608365"},{"type":"electronic","value":"9783319608372"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60837-2_9","type":"book-chapter","created":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T01:13:51Z","timestamp":1498007631000},"page":"109-122","source":"Crossref","is-referenced-by-count":0,"title":["Rough and Near: Modal History of Two Theories"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Wolski","sequence":"first","affiliation":[]},{"given":"Anna","family":"Gomoli\u0144ska","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,22]]},"reference":[{"key":"9_CR1","series-title":"CSLI Lecture Notes","volume-title":"Non-Well-Founded Sets","author":"P Aczel","year":"1988","unstructured":"Aczel, P.: Non-Well-Founded Sets. CSLI Lecture Notes, vol. 14. CSLI Publications, Stanford (1988)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0018361","volume-title":"Category Theory and Computer Science","author":"P Aczel","year":"1989","unstructured":"Aczel, P., Mendler, N.: A final coalgebra theorem. In: Pitt, D.H., Rydeheard, D.E., Dybjer, P., Pitts, A.M., Poign\u00e9, A. (eds.) Category Theory and Computer Science. LNCS, vol. 389, pp. 357\u2013365. Springer, Heidelberg (1989). doi: 10.1007\/BFb0018361"},{"key":"9_CR3","volume-title":"Abstract and Concrete Categories","author":"J Ad\u00e1mek","year":"1990","unstructured":"Ad\u00e1mek, J., Herrlich, H., Strecker, G.: Abstract and Concrete Categories. Wiley-Interscience Publication, London (1990)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-71200-8_1","volume-title":"Transactions on Rough Sets VI","author":"M Banerjee","year":"2007","unstructured":"Banerjee, M., Khan, M.A.: Propositional logics from rough set theory. In: Peters, J.F., Skowron, A., D\u00fcntsch, I., Grzyma\u0142a-Busse, J., Or\u0142owska, E., Polkowski, L. (eds.) Transactions on Rough Sets VI. LNCS, vol. 4374, pp. 1\u201325. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-71200-8_1"},{"key":"9_CR5","first-page":"1","volume":"7","author":"M Bilkova","year":"2008","unstructured":"Bilkova, M., Palmigiano, A., Venema, Y.: Proof systems for the coalgebraic cover modality. Adv. Modal Log. 7, 1\u201323 (2008)","journal-title":"Adv. Modal Log."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2014.06.018","volume":"549","author":"M Bilkova","year":"2014","unstructured":"Bilkova, M., Palmigiano, A., Venema, Y.: Proof systems for Moss\u2019 coalgebraic logic. Theor. Comput. Sci. 549, 36\u201360 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR7","volume-title":"Topological Spaces","author":"E \u010cech","year":"1966","unstructured":"\u010cech, E.: Topological Spaces. Wiley, London (1966)"},{"key":"9_CR8","first-page":"189","volume":"31","author":"V Efremovi\u010d","year":"1951","unstructured":"Efremovi\u010d, V.: The geometry of proximity I. Mat. Sb. 31, 189\u2013200 (1951). (in Russian) MR 14, 1106","journal-title":"Mat. Sb."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0016-660X(74)90021-X","volume":"4","author":"H Herrlich","year":"1974","unstructured":"Herrlich, H.: A concept of nearness. Gen. Topol. Appl. 4, 191\u2013212 (1974)","journal-title":"Gen. Topol. Appl."},{"key":"9_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316823187","volume-title":"Introduction to Coalgebra. Towards Mathematics of States and Observation","author":"B Jacobs","year":"2016","unstructured":"Jacobs, B.: Introduction to Coalgebra. Towards Mathematics of States and Observation. Cambridge University Press, Cambridge (2016)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/3-540-60246-1_160","volume-title":"Mathematical Foundations of Computer Science 1995","author":"D Janin","year":"1995","unstructured":"Janin, D., Walukiewicz, I.: Automata for the modal $$\\mu $$-calculus and related results. In: Wiedermann, J., H\u00e1jek, P. (eds.) MFCS 1995. LNCS, vol. 969, pp. 552\u2013562. Springer, Heidelberg (1995). doi: 10.1007\/3-540-60246-1_160"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-8(3:2)2012","volume":"8","author":"K Kupke","year":"2012","unstructured":"Kupke, K., Kurz, A., Venema, Y.: Completeness for the coalgebraic cover modality. Log. Methods Comput. Sci. 8, 1\u201376 (2012)","journal-title":"Log. Methods Comput. Sci."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0168-0072(98)00042-6","volume":"96","author":"L Moss","year":"1999","unstructured":"Moss, L.: Coalgebraic logic. Ann. Pure Appl. Log. 96, 277\u2013317 (1999)","journal-title":"Coalgebraic logic. Ann. Pure Appl. Log."},{"key":"9_CR14","volume-title":"Proximity Approach to General Topology","author":"S Naimpally","year":"1974","unstructured":"Naimpally, S.: Proximity Approach to General Topology. Lakehead University, Thunder Bay (1974)"},{"key":"9_CR15","doi-asserted-by":"publisher","DOI":"10.1142\/8501","volume-title":"Topology with Applications. Topological Spaces via Near and Far","author":"S Naimpally","year":"2013","unstructured":"Naimpally, S., Peters, J.: Topology with Applications. Topological Spaces via Near and Far. World Scientific, Singapore (2013)"},{"key":"9_CR16","unstructured":"Pawlak, Z.: Classification of Objects by Means of Attributes. Institute of Computer Science, Polish Academy of Sciences PAS 429, Warsaw (1981)"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341\u2013356 (1982)","journal-title":"Int. J. Comput. Inf. Sci."},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-16066-3_18","volume-title":"Computation Theory","author":"Z Pawlak","year":"1985","unstructured":"Pawlak, Z.: Rough sets and decision tables. In: Skowron, A. (ed.) SCT 1984. LNCS, vol. 208, pp. 187\u2013196. Springer, Heidelberg (1985). doi: 10.1007\/3-540-16066-3_18"},{"issue":"5\u20136","key":"9_CR19","first-page":"253","volume":"35","author":"Z Pawlak","year":"1987","unstructured":"Pawlak, Z.: Rough logic. Bull. Pol. Acad. Sci. (Tech. Sci.) 35(5\u20136), 253\u2013258 (1987)","journal-title":"Bull. Pol. Acad. Sci. (Tech. Sci.)"},{"key":"9_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3534-4","volume-title":"Rough Sets: Theoretical Aspects of Reasoning about Data","author":"Z Pawlak","year":"1991","unstructured":"Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publisher, Berlin (1991)"},{"key":"9_CR21","unstructured":"Pawlak, Z.: Wiedza z Perspektywy Zbior\u00f3w Przybli\u017conych. Institute of Computer Science Report 23, Toronto (1992)"},{"issue":"1\u20134","key":"9_CR22","first-page":"407","volume":"75","author":"J Peters","year":"2007","unstructured":"Peters, J.: Near sets. special theory about nearness of objects. Fundam. Inform. 75(1\u20134), 407\u2013433 (2007)","journal-title":"Fundam. Inform."},{"issue":"53","key":"9_CR23","first-page":"2609","volume":"1","author":"J Peters","year":"2007","unstructured":"Peters, J.: Near sets. General theory about nearness of objects. Appl. Math. Sci 1(53), 2609\u20132629 (2007)","journal-title":"Appl. Math. Sci"},{"key":"9_CR24","unstructured":"Peters, J., Skowron, A., Stepaniuk, J.: Nearness in approximation spaces. In: Proceedings of Concurrency, Specification and Programming (CS&P 2006), Humboldt Universitat, pp. 435\u2013445 (2006)"},{"issue":"4","key":"9_CR25","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1090\/noti817.","volume":"59","author":"J Peters","year":"2012","unstructured":"Peters, J., Naimpally, S.: Applications of near sets. Am. Math. Soc. Not. 59(4), 536\u2013542 (2012). doi: 10.1090\/noti817.","journal-title":"Am. Math. Soc. Not."},{"key":"9_CR26","volume-title":"An Introduction to Non-classical Logic","author":"G Priest","year":"2001","unstructured":"Priest, G.: An Introduction to Non-classical Logic. Cambridge University Press, Cambridge (2001)"},{"key":"9_CR27","unstructured":"Riesz, F.: Stetigkeitsbegriff und abstrakte mengenlehre. IV Congresso Internazionale dei Matematici II, pp. 18\u201324 (1908)"},{"issue":"2","key":"9_CR28","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1080\/10798587.1996.10750660","volume":"2","author":"YY Yao","year":"1996","unstructured":"Yao, Y.Y., Lin, T.Y.: Generalization of rough sets using modal logic. Intell. Autom. Soft Comput. 2(2), 103\u2013120 (1996)","journal-title":"Intell. Autom. Soft Comput."}],"container-title":["Lecture Notes in Computer Science","Rough Sets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60837-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T22:23:58Z","timestamp":1659133438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60837-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319608365","9783319608372"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60837-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}