Finite Variable Logics In Descriptive Complexity Theory

Finite Variable Logics In Descriptive Complexity Theory (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Martin Grohe

Venue:	Bulletin of Symbolic Logic
Citations:	8 - 1 self

BibTeX

@ARTICLE{Grohe98finitevariable,
    author = {Martin Grohe},
    title = {Finite Variable Logics In Descriptive Complexity Theory},
    journal = {Bulletin of Symbolic Logic},
    year = {1998},
    volume = {4},
    pages = {345--398}
}

Bookmark

OpenURL

Abstract

this article.

Citations

431	Finite Model Theory - Ebbinghaus, Flum - 1999
242	Generalized first-order spectra and polynomial-time recognizable sets - Fagin - 1974
239	Y.: The Classical Decision Problem - Börger, Grädel, et al. - 1996
233	Structure and complexity of relational queries - Chandra, Harel - 1982
119	An Optimal Lower Bound on the Number of Variables for Graph Identi cation - Cai, Furer, et al. - 1989
111	Generic computation and its complexity', in - Abiteboul, Vianu - 1991
71	Combinatorics: Topics, Techniques, Algorithms - Cameron - 1994
69	Toward logic tailored for computational complexity - Gurevich - 1984
62	On Moschovakis closure ordinals - Barwise
56	Canonical labeling of graphs - Babai, Luks - 1983
55	Infinitary logic and inductive definability over finite structures - Dawar, Lindell, et al. - 1995
54	Twovariable logic with counting is decidable - Grädel, Otto, et al. - 1997
43	Random graph isomorphism - Babai, Erdős, et al. - 1980
41	On the decision problem for two-variable first-order logic. Bulletin of Symbolic Logic 3(1):53–69 - Grädel, Kolaitis, et al. - 1997
36	Feasible Computation through Model Theory - Dawar - 1993
33	On logics with two variables - Graedel, Otto - 1999
33	Fixpoint logics, relational machines, and computational complexity - Abiteboul, Vardi - 1997
31	Extended logics: The general framework - Ebbinghaus - 1985
29	A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus - Filotti, Mayer - 1980
28	Fixed-point logics on planar graphs - Grohe - 1998
28	Inductive definability with counting on finite structures - Grädel, Otto - 1993
26	Generalized quantifiers and logical reducibilities - Dawar - 1995
25	E.Rosen. Undecidability results on two-variable logics - Grädel, Otto - 1999
24	On the decision problem for two-variable firstorder logic - Kolaitis - 1997
22	Definability and descriptive complexity on databases of bounded tree-width - Grohe, Marino - 1999
18	The Classical Decision Problem - örger, ädel, et al. - 1997
16	A restricted second order logic for finite structures - Dawar - 1998
13	A zero-one law for logic with a fixed-point operator - Blass, Gurevich, et al.
10	Equivalence in finite-variable logics is complete for polynomial time - Grohe - 1996
9	Inductive definability with counting on finite structures - Gradel, Otto - 1993
7	Large finite structures with few L k -types - Grohe - 1997
6	Types and indiscernibles in finite models - Dawar - 1998
6	Implicit definability and infinitary logic in finite model theory - Kolaitis - 1995
5	Fixpoint logics, relational machines, and computational complexity - Abiteboul, Vardi, et al. - 1997
5	Extended Logics: The General Framework, in Model-Theoretic Logics - Ebbinghaus - 1985
5	On logics with two variables’, Theoretical Computer Science 224, 73–113 - Grädel, Otto - 1997
4	and forth through infinitary logic - Back - 1973
4	Implicit definability and infinitary logic in finite model theory - Dawar, Hella, et al. - 1995
4	Private communication - Flum, Ziegler - 2004
3	Canonization for L k -equivalence is hard - Grohe - 1998
3	and forth through infinitary logic, Studies in model theory - Barwise, Back - 1973
2	Moschovakis closure ordinals - On - 1977
1	quantifiers and logical reducibilities - Generalized - 1995
1	and indiscernibles in finite models, Logic colloquium '95 - Types - 1998
1	results on two-variable logics, Proceedings of the 14th annual symposium on theoretical aspects of computer science - Undecidability - 1997