Abstract
Some of my favorite open problems concern fixed-point logic with counting, FPC. It is known that counting logic with k + 1 variables, C k +1 , has exactly the same expressive power as the classic k-dimensional Weisfeiler-Leman Algorithm, k -WL. Furthermore, the quantifier-depth of a C k +1 formula needed to express the color of a k -tuple of vertices is equal to the number of iterations of k -WL needed to derive that color.
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.
