DocumentCode
1954771
Title
Fixed-point logics on planar graphs
Author
Grohe, Martin
Author_Institution
Inst. fur Math. Logik, Albert-Ludwigs-Univ., Freiburg, Germany
fYear
1998
fDate
21-24 Jun 1998
Firstpage
6
Lastpage
15
Abstract
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
Keywords
computational complexity; formal logic; IFP; IFP+C; expressive power; inflationary fixed-point logic; isomorphism; planar graphs; polynomial time; Logic; Polynomials; Tellurium; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1998. Proceedings. Thirteenth Annual IEEE Symposium on
Conference_Location
Indianapolis, IN
ISSN
1043-6871
Print_ISBN
0-8186-8506-9
Type
conf
DOI
10.1109/LICS.1998.705639
Filename
705639
Link To Document