Abstract
We establish that the quantifier alternation hierarchy of formulae of second-order propositional modal logic (SOPML) induces an infinite corresponding semantic hierarchy over the class of finite directed graphs. This solves an open problem of van Benthem (1985) [5] and ten Cate (2006) [11]. We also identify modal characterizations of the expressive power of second-order logic (SO) and monadic second-order logic (MSO) in terms of extensions of modal logic with second-order quantification.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
