Abstract
The link between modal logic and non-well-founded sets has been shown by P. Aczel [1988], and systematically by J. Barwise and L. Moss [1996]. A. Baltag [1998] also proved some important theorems about characterizing sets by modal sentences. The aim of this paper is to explore the relationship between modal logic and sets more deeply in the expressive power of modal languages and modal definability over sets. Let’s consider both basic and infinitary modal languages.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aczel, P.: Non-Well-Founded Sets. Stanford CSLI publications (1988)
Baltag, A.: STS: A Structural Theory of Sets. Ph.D. dissertation, Indiana University (1998)
Blackburn, P., de Rijke, M., de Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)
Segerberg, K.: An Essay in Classical Modal Logic. Filosofiska Studier 13, University of Uppsala (1971)
Jech, T.: Set Theory. Springer, Heidelberg (2003)
Barwise, J., Moss, L.: Vicious Circles: On the Mathematics of Non-Well-Founded Phenomena. CSLI publications, Stanford (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shi, J. (2009). Modal Expressivity and Definability over Sets. In: He, X., Horty, J., Pacuit, E. (eds) Logic, Rationality, and Interaction. LORI 2009. Lecture Notes in Computer Science(), vol 5834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04893-7_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-04893-7_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04892-0
Online ISBN: 978-3-642-04893-7
eBook Packages: Computer ScienceComputer Science (R0)