Referenced Items are not available for this document.
We study the expressive power of inflationary fixed-point logic IFP and inflationary fixed-point logic with counting IFP+C on planar graphs. We prove the following results: (1) IFP captures polynomial time on 3-connected planar graphs, and IFP+C captures polynomial time on arbitrary planar graphs. (2) Planar graphs can be characterized up to isomorphism in a logic with finitely many variables and counting. This answers a question of Immerman (1987). (3) The class of planar graphs is definable in IFP. This answers a question of Dawar and Gradel
Published in:
Logic in Computer Science, 1998. Proceedings. Thirteenth Annual IEEE Symposium on
Date of Conference: 21-24 Jun 1998
- Page(s):
- 6 - 15
- Meeting Date :
- 21 Jun 1998-24 Jun 1998
- ISSN :
- 1043-6871
- Print ISBN:
- 0-8186-8506-9
- INSPEC Accession Number:
- 5992413
- Conference Location :
- Indianapolis, IN
- Digital Object Identifier :
- 10.1109/LICS.1998.705639
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
