Anuj Dawar, et al.  Home/Search
Context Related
| cl.cam.ac.uk/users/ad260/pap...icalp.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cl.cam.ac.uk/users/ad260/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Anuj Dawar ?1 , Lauri Hella , Phokion G. Kolaitis ??3 Dept. of Comp. Science, Univ. of Wales, Swansea, Swansea SA2 8PP, U.K. (Update)
Context of citations to this paper: More
...modification R 0 of R such that any other regular modification of R is bigger, in the sense of the hyper graph on the feet. Following [DHK95], we compare two orders R and R 0 as follows. Let a 1 ; a 2 ; a r and b 1 ; b 2 ; b r be the feet ordered according R...
.... a large number of complexity theoretic questions can be reproduced as questions about fragments of the infinitary logic L 1 (see [2, 15, 18]) Below, we exhibit one such set of results which concerns an effective fragment of L 1 that is not obtained by fixed point...
Cited by: More
Finite Variable Logics In Descriptive Complexity Theory - Grohe (1998) (Correct)
Finite Models And Finitely Many Variables - Dawar (1999) (Correct)
Finite Variable Logics - Hodkinson (1993) (Correct)
Active bibliography (related documents): More All
0.8: Finite Models and Finitely Many Variables - Dawar (1999) (Correct)
0.6: Infinitary Logics and 0-1 Laws - Kolaitis, Vardi (1992) (Correct)
0.5: Vectorization Hierarchies of Some Graph Quantifiers - Hella, Nurmonen (Correct)
Similar documents based on text: More All
1.0: Is Multiplication Harder than Addition? Arithmetical Definability.. - Lee (2001) (Correct)
1.0: Logics with Aggregate Operators - Hella, Libkin, Nurmonen, Wong (Correct)
0.9: Partial Fixed-Point Logic on Infinite Structures - Kreutzer (Correct)
Related documents from co-citation: More All
11: Structure and complexity of relational queries - Chandra, Harel - 1982
10: The complexity of relational query languages (context) - Vardi - 1982
9: Generalized First-Order Spectra and Polynomial-Time Recognizable Sets (context) - Fagin - 1974
BibTeX entry: (Update)
A. Dawar, L. Hella and Ph.G. Kolaitis. Implicit definability and infinitary logic in finite model theory. Proc. 22nd International Colloquium on Automata, Languages and Programming - ICALP 95, Lecture Notes in Computer Science, Springer-Verlag, to appear. http://citeseer.ist.psu.edu/511995.html More
@incollection{ dawar95implicit,
author = "Anuj Dawar and Lauri Hella and Phokion Kolaitis",
title = "Implicit Definability and Infinitary Logic in Finite Model Theory",
booktitle = "Proceedings 22nd Int'l Coll.\ on Automata, Languages, and Programming, {ICALP}'95, Szeged, Hungary, 10--14 July 1995",
volume = "944",
publisher = "Springer-Verlag",
address = "Berlin",
editor = "Z. F{\"u}l{\"o}p and F. G{\'e}cseg",
pages = "624--635",
year = "1995",
url = "citeseer.ist.psu.edu/511995.html" }
Citations (may not include all citations):379 The complexity of relational query languages (context) - Vardi - 1982
245 Relational queries computable in polynomial time - Immerman - 1986
227 North Holland (context) - Chang, Keisler - 1990
198 Structure and complexity of relational queries - Chandra, Harel - 1982
149 Logic and the challenge of computer science (context) - Gurevich - 1988
114 Generic computation and its complexity (context) - Abiteboul, Vianu - 1991
78 On Moschovakis closure ordinals (context) - Barwise - 1977
63 Toward logic tailored for computational complexity - Gurevich - 1984
61 Descriptive and computational complexity - Immerman - 1989
56 Information Processing Letters (context) - Valiant, of et al. - 1976
49 Theory of database queries (context) - Chandra - 1988
37 Feasible computation through model theory - Dawar - 1993
36 and computational complexity (context) - Abiteboul, Vardi et al. - 1992
8 Upper and lower bounds for rst-order expressibility (context) - Immerman - 1982
4 Fixpoint logic vs (context) - Kolaitis, Vardi - 1992
2 On nite rigid structures (context) - Gurevich, Shelah - 1994
2 Fixpoint extensions of rst-order logic and Datalog-like lang.. (context) - Abiteboul, Vianu - 1989
2 order spectra and polynomial{time recognizable sets (context) - Fagin - 1974
1 Implicit de nability on nite structures and unambiguous comp.. (context) - Kolaitis - 1990
1 An analysis of xed point queries on binary trees (context) - Lindell - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cl.cam.ac.uk/users/ad260/pubs.html): More
Finite Models and Finitely Many Variables - Dawar (1999) (Correct)
Ordering Finite Variable Types with Generalized Quantifiers - Dawar, Hella (Correct)
Fixed-Point Logics with Nondeterministic Choice - Anuj Dawar And (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC