Abstract
The main aim of this paper is to present a survey of results on the logic with rough quantifier. Besides, a classification of simplicity of formulas of the logic with rough quantifier is defined and a criterion for placing a formula on the exact simplicity level is given.
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
Barwise, J.: On Moskovakis closure ordinals. The Journal of Symbolic Logic, 42, (1977), 292–296
Bell, J.L. and Slomson, A.B.: Models and Ultraproducts. An Introduction. North-Holland Publ. Co., (1969)
Chang, C.C. and Keisler, H.J.: Model Theory. North-Holland, Publ. Comp., (1973)
Ehrenfeucht, A.: An applications of games to the completeness problem for formalized theories. Fundamenta Mathematicae, 49, (1961), 129–141
Fraïssé, R.J.: Sur quelques classifications des systémes des relations. Publ. Sci. Univ. Alger, A 1, (1954), 35–182
Immerman, N.: Upper and lower bounds for first—order logic. Information and Control, 68, (1982), 76–98
Kell Keisler, H.J.: Logic with the quantifier “there exist uncountably many” Annals of Mathematical Logic, 1, (1970), 1–93
Kolaitis, P.G. and Väänänen, J.: Generalized quantifiers and pebble games on finite structures Annals of Pure and Applied Logic, 74, (1995), 23–75
Krawczyk, A. and Krynicki, M.: Ehrenfeucht games for generalized quantifiers. In: Set Theory and Hierarchy Theory, Lecture Notes in Mathematics, 537, Springer, (1976), 145–152
Krynicki, M.: A note on rough concepts logic. Fundamenta Informaticae, 13, (1990), 227–235
Krynicki, M.: Relational Quantifiers. Dissertationes Mathematicae, 347, (1995)
Krynicki, M., Szczerba, L.W.: On simplicity of formulas. Studia Logica, 49, (1990), 401–419
Krynicki, M. and Tuschik, H-P.: An axiomatization of the logic with the rough quantifier. The Journal of Symbolic Logic, 56, (1991), 608–617
Makowsky, J.A. and Tulipani, S.: Some model theory for monotone quanti- fiers. Archive fur Math. Logik und Grundlagenforschung, 18, (1977), 115–134
Rasiowa, H. and Skowron, A.: Rough concepts logic. In: Computation Theory, A.Skowron (ed.), Lecture Notes in Computer Science, 208, Springer, (1985), 288–297
Szczerba, L.W.: Rough Quantifiers. Bulletin of the Polish Academy of Science, Mathematics, 35, (1987), 251–254
Szczerba, L.W.: Rough Quantifiers have no Tarski property. Bulletin of the Polish Academy of Science, Mathematics, 35, (1987), 663–665
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Krynicki, M., Szczerba, L.W. (1998). On the Logic with Rough Quantifier. In: Orłowska, E. (eds) Incomplete Information: Rough Set Analysis. Studies in Fuzziness and Soft Computing, vol 13. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1888-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1888-8_19
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-2457-5
Online ISBN: 978-3-7908-1888-8
eBook Packages: Springer Book Archive