(Enter summary)
Abstract: We consider L | first order logic restricted to k variables, and interpreted in finite structures. The study of classes of finite structures axiomatisable with finitely many variables has assumed importance through connections with computational complexity. In particular, we investigate the relationship between the size of a finite structure and the number of distinct types it realizes, with respect to L . Some open questions, formulated as finitary Löwenheim-Skolem properties, are presented... (Update)
Cited by: More
Logic in the Finite - Weinstein
(Correct)
Active bibliography (related documents): More All
0.8: Implicit Definability and Infinitary Logic in Finite Model.. - Dawar, al.
(Correct)
0.3: Ordering Finite Variable Types with Generalized Quantifiers - Dawar, Hella
(Correct)
0.3: Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws - Stewart
(Correct)
Similar documents based on text: More All
0.7: Finite Models And Finitely Many Variables - Dawar (1999)
(Correct)
0.6: Inflationary Fixed Points in Modal Logic - Dawar, Grädel, Kreutzer (2001)
(Correct)
0.6: Modal and Guarded Characterisation Theorems over Finite Transition .. - Otto (2002)
(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/dawar99finite.html More
@incollection{ dawar99finite,
author = "A. Dawar",
title = "Finite models and finitely many variables",
editor = "D. Niwinski and R. Maron",
booktitle = "Logic, Algebra and Computer Science",
volume = "46",
series = "Banach Center Publications",
pages = "93--117",
publisher = "Polish Academy of Sciences",
year = "1999",
url = "citeseer.ist.psu.edu/dawar99finite.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
124
Datalog extensions for database queries and updates (context) - Abiteboul, Vianu - 1991
110
Ramsey Theory (context) - Graham, Rothschild et al. - 1980
78
On Moschovakis closure ordinals (context) - Barwise - 1977
63
Toward logic tailored for computational complexity
- Gurevich - 1984
37
Feasible Computation through Model Theory
- Dawar - 1993
36
and computational complexity (context) - Abiteboul, Vardi et al. - 1992
29
Deux ou trois choses que je sais de Ln (context) - Poizat - 1982
17
Generalized rst-order spectra and polynomial-time recognizab.. (context) - Fagin - 1974
10
Computing with rst-order logic (context) - Abiteboul, Vianu - 1995
9
Ptime canonization for two variables with counting
- Otto - 1995
8
Upper and lower bounds for rst-order expressibility (context) - Immerman - 1982
5
A restricted second order logic for nite structures (context) - Dawar - 1995
3
Personal Communication (context) - Luczak - 1995
1
xed point logic and linear order (context) - Dawar, Lindell et al. - 1996
1
Implicit de nability and in nitary logic in nite model theor.. (context) - Dawar, Hella et al. - 1995
Documents on the same site (http://www.cl.cam.ac.uk/users/ad260/pubs.html): More
Implicit Definability and Infinitary Logic in Finite Model.. - Dawar, al.
(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