Abstract
We study a modal system ¯T, that extends the classical (prepositional) modal system T and whose language is provided with modal operators M inn (nεN) to be interpreted, in the usual kripkean semantics, as “there are more than n accessible worlds such that...”. We find reasonable axioms for ¯T and we prove for it completeness, compactness and decidability theorems.
Similar content being viewed by others
References
G. S. Boolos, The Unprovability of Consistency. An Essay in Modal Logic, Cambridge University Press, Cambridge 1978.
C. C. Chang and H. J. Keisler, Model Theory, North-Holland, Amsterdam 1973.
B. F. Chellas, Modal Logic. An Introduction, Cambridge University Press, Cambridge 1980.
D. M. Gabbay, Decidability results in non classical logics, Annals of Mathematical Logic 8 (1975), pp. 237–295.
L. F. Goble, Grades of modality, Logique et Analyse 13 (1970), pp. 323–334.
G. E. Hughes and M. J. Cresswell, An Introduction to Modal Logic Methuen and Co. Ltd., London 1968.
C. Karp, Languages with Expressions of Infinite Length, North-Holland, Amsterdam 1964.
M. O. Rabin, Decidability of second order theories and automata on infinite trees, Transactions of the American Mathematical Society 141 (1969), pp. 1–35.
Author information
Authors and Affiliations
Additional information
The authors are very indebted to the referee for Ms consideration and appreciation of their work.
Rights and permissions
About this article
Cite this article
Fattorosi-Barnaba, M., De Caro, F. Graded modalities. I. Stud Logica 44, 197–221 (1985). https://doi.org/10.1007/BF00379767
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00379767