2009/05/27 by Yanjing Wang, Wang, Yanjing, Francien Dechesne +1
Computer Science · #F.4.1 #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #cs.LO
paper · pdf · doi:10.48550/arxiv.0905.4332
18 pages
arxiv created 2009/05/27 · openalex publication_date 2009/05/27 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In computer science, various logical languages are defined to analyze properties of systems. One way to pinpoint the essential differences between those logics is to compare their expressivity in terms of distinguishing power and expressive power. In this paper, we study those two concepts by regarding the latter notion as the former lifted to classes of models. We show some general results on lifting an invariance relation on models to one on classes of models, such that when the former corresponds to the distinguishing power of a logic, the latter corresponds to its expressive power, given certain compactness requirements. In particular, we introduce the notion of class bisimulation to capture the expressive power of modal logics. We demonstrate the application of our results by revisiting modal definability with our new insights.