Anuj Dawar  Home/Search
Context Related
| cl.cam.ac.uk/~ad260/papers/banach.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/~ad260/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . This paper is a survey of results on finite variable logics in finite model theory. It focusses on the common underlying techniques that unite many such results. 1. Introduction. Finite variable logics have come to occupy a very important place in finite model theory. This survey examines a number of the results that have been established and the techniques that have been used in this connection. Taking a broad enough view allows a picture to emerge which shows that essentially the same... (Update)
Cited by: More
Logic in the Finite - Weinstein (Correct)
Active bibliography (related documents): More All
1.2: Computational Model Theory: An Overview - Vardi (1998) (Correct)
0.9: Logic and Complexity without Order - Dawar (1997) (Correct)
0.9: Finite Variable Logics In Descriptive Complexity Theory - Grohe (1998) (Correct)
Similar documents based on text: More All
0.7: Finite Models and Finitely Many Variables - Dawar (1999) (Correct)
0.3: Generalising Automaticity to Modal Properties of Finite.. - Dawar, Kreutzer (2002) (Correct)
0.2: Strong Normalization Proofs for Cut Elimination in Gentzen's.. - Bittar (Correct)
BibTeX entry: (Update)
Dawar, A. (1999). Finite models and finitely many variables. In Niwinski, D. and Maron, R., editors, Logic, Algebra and Computer Science, volume 46 of Banach Center Publications, pages 93--117. Polish Academy of Sciences. http://citeseer.ist.psu.edu/article/dawar99finite.html More
@misc{ dawar99finite,
author = "A. Dawar",
title = "Finite models and finitely many variables",
text = "Dawar, A. (1999). Finite models and finitely many variables. In Niwinski,
D. and Maron, R., editors, Logic, Algebra and Computer Science, volume 46
of Banach Center Publications, pages 93--117. Polish Academy of Sciences.",
year = "1999",
url = "citeseer.ist.psu.edu/article/dawar99finite.html" }
Citations (may not include all citations):411 Random Graphs (context) - Bollob'as - 1985 ACM
379 The complexity of relational query languages (context) - Vardi - 1982
245 Relational queries computable in polynomial time - Immerman - 1986 ACM DBLP
210 Generalized first-order spectra and polynomial-time recogniz.. (context) - Fagin - 1974
198 Structure and complexity of relational queries - Chandra, Harel - 1982 DBLP
163 Universality of data retrieval languages (context) - Aho, Ullman - 1979 ACM
149 Logic and the challenge of computer science (context) - Gurevich - 1988
124 Datalog extensions for database queries and updates (context) - Abiteboul, Vianu - 1991 ACM DBLP
120 Elementary Induction on Abstract Structures (context) - Moschovakis - 1974
114 Generic computation and its complexity (context) - Abiteboul, Vianu - 1991 ACM DBLP
97 An introduction to inductive definitions (context) - Aczel - 1977
85 Upper and lower bounds for first-order expressibility (context) - Immerman - 1982
81 Probabilities on finite models (context) - Fagin - 1976 DBLP
78 On Moschovakis closure ordinals (context) - Barwise - 1977 DBLP
59 Reachability is harder for directed than for undirected grap.. (context) - Ajtai, Fagin - 1990
57 Infinitary logic and inductive definability over finite stru.. - Dawar, Lindell et al. - 1995 ACM DBLP
51 the expressive power of Datalog - tools and a case study - Kolaitis, Vardi - 1995
49 Range and degree of realizability of formulas in the restric.. (context) - Glebski, Kogan et al. - 1969
43 Computing with first-order logic - Abiteboul, Vianu - 1995 ACM DBLP
42 infinitary logic in finite-model theory (context) - Kolaitis, Vardi et al. - 1992
37 Feasible Computation through Model Theory - Dawar - 1993 ACM
36 and computational complexity (context) - Abiteboul, Vardi et al. - 1997
35 Information and Computation (context) - Fagin, Stockmeyer et al. - 1995 DBLP
34 The decision problem for the probabilities of higherorder pr.. (context) - Kolaitis, Vardi - 1987
33 Information and Computation (context) - Kolaitis, Vardi et al. - 1992 DBLP
29 Deux ou trois choses que je sais de Ln (context) - Poizat - 1982
20 A restricted second order logic for finite structures (context) - Dawar ACM DBLP
18 The expressive power of finitely many generalized quantifier.. - Dawar, Hella - 1995 ACM DBLP
16 volume 9 of Lecture Notes in Logic (context) - Otto, Logics - 1997
12 Some relationships between logics of programs and complexity.. (context) - Tiuryn, Urzyczyn - 1988 ACM DBLP
11 Implicit definability and infinitary logic in finite model t.. - Dawar, Hella et al. - 1995 ACM DBLP
11 the expressive power of variable confined logics - Kolaitis, Vardi - 1996
11 Large finite structures with few L k -types - Grohe - 1997
10 On finite rigid structures - Gurevich, Shelah - 1996 DBLP
10 McColm's conjecture - Gurevich, Immerman et al. - 1994 DBLP
9 Axiomatizable classes of finite models and definability of l.. (context) - Stolboushkin - 1992 DBLP
8 Equivalence in finite-variable logics is complete for polyno.. - Grohe - 1996 ACM DBLP
7 Types and indiscernibles in finite models (context) - Dawar - 1997
7 Annals of Pure and Applied Logic (context) - McColm, arithmetic - 1990
7 Second-order and inductive definability on finite structures (context) - de Rougemont - 1987 ACM
7 Preservation theorems in finite model theory - Rosen, Weinstein - 1995 ACM DBLP
7 fixed point logic and linear order (context) - Dawar, Lindell et al. - 1996
6 Computer and System Sciences (context) - Afrati, Cosmadakis et al. - 1995
6 On asymptotic probabilities of inductive queries and their d.. (context) - Kolaitis - 1985
5 Formal Languages: Automata and Structures (context) - Engeler - 1968
5 Free Algebras in Von Neumann-Bernays-Godel Set Theory and Po.. (context) - Rubin - 1975
4 Johannes Gutenberg-Universitat Mainz (context) - Durand, Lautemann et al. - 1995
3 Infinitary logics and very sparse random graphs (context) - Lynch - 1993 DBLP
3 On asymptotic probabilities in logics that capture DSPACE - Tyszkiewicz - 1993
2 Parametrization over inductive relations of a bounded number.. (context) - McColm - 1990 DBLP
2 universal finite graphs (context) - Rosen, Shelah et al. - 1997
2 Theories with finitely many models (context) - Thomas - 1986 DBLP
2 invariants is hard (context) - Grohe, the
1 Nonconvergence for sparse random graphs (context) - McArthur, Spencer
1 on sparse random graphs (context) - McArthur, behaviour - 1997
1 Theories with finitely many models II (context) - Thomas - 1989
1 FINITE MODELS AND FINITELY MANY VARIABLES (context) - Abiteboul, Vardi et al. - 1995
1 A zero-one law for logic with a fixed point operator Informa.. (context) - Blass, Gurevich et al. - 1985
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