Lauri Hella, Juha Nurmonen  Home/Search
Context Related
| math.helsinki.fi/~hella/HeNu.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: math.helsinki.fi/~hel...preprints (more) Homepages: L.Hella |
Rate this article:      (best)Comment on this article |
Abstract: We give a sufficient condition for the inexpressibility of the k-th extended vectorization of a generalized quantifier Q in FO(Q_k), the extension of first-order logic by all k-ary quantifiers. The condition is based on a model construction which, given two FO(Q_1)-equivalent models with certain additional structure, yields a pair of FO(Q_k)-equivalent models. We also consider some applications of this condition to quantifiers that correspond to graph properties, such as connectivity and... (Update)
Context of citations to this paper: More
.... a class C and its complement are closed under stretching, and there are A 2 C and B 62 C as above, then C is not definable in L1 (Q u ) [26]. This argument shows that graph properties such as planarity and 3 colorability are not definable in L1 (Q u ) Hanf s technique...
Cited by: More
Counting and Locality over Finite Structures: a Survey - Libkin, Nurmonen (1999) (Correct)
Similar documents (at the sentence level):
16.2%: Vectorization Hierarchies of Some Graph Quantifiers - Hella, Nurmonen (Correct)
Active bibliography (related documents): More All
0.4: Logical Characterizations of Complexity Classes - Stewart (1997) (Correct)
0.3: Quantifiers and Congruence Closure - Flum, Schiehlen, Väänänen (Correct)
0.3: Definability of Polyadic Lifts of Generalized Quantifiers - Hella, Väänänen.. (1999) (Correct)
Similar documents based on text: More All
0.5: Logics with Aggregate Operators - Hella, Libkin, Nurmonen, Wong (1999) (Correct)
0.4: Notions of Locality and Their Logical Characterizations.. - Hella, Libkin, al. (1997) (Correct)
0.4: On Winning Strategies With Unary Quantifiers - Nurmonen (1996) (Correct)
Related documents from co-citation: More All
2: and logarithmic space (context) - Etessami, successor - 1995
BibTeX entry: (Update)
L. Hella and J. Nurmonen. Vectorization hierarchies of some graph quantifiers. Archive for Mathematical Logic, to appear. http://citeseer.ist.psu.edu/210375.html More
@misc{ hella-vectorization,
author = "L. Hella and J. Nurmonen",
title = "Vectorization hierarchies of some graph quantifiers",
note = "Archive for Mathematical Logic, to appear.",
url = "citeseer.ist.psu.edu/210375.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
210 Generalized first-order spectra and polynomial-time recogniz.. (context) - Fagin - 1974
98 On optimal lower bound on the number of variables for graph .. - Cai, Furer et al. - 1992
66 Describing graphs: a first-order approach to graph canonizat.. - Immermann, Lander - 1990
49 Model-theoretic methods in the study of elementary logic (context) - Hanf - 1965
45 Perspectives in Mathematical Logic (context) - Ebbinghaus, Flum et al. - 1995
44 Information and Computation (context) - Hella, in - 1996
38 Languages which capture complexity classes (context) - Immerman - 1987
36 Graph Theory (context) - Tutte - 1984
36 Generalized quantifiers and pebble games on finite structure.. (context) - Kolaitis, Vaananen - 1995
35 Information and Computation (context) - Fagin, Stockmeyer et al. - 1995
34 Journal of Symbolic Logic (context) - Mostowski, of
32 First order predicate logic with generalized quantifiers (context) - Lindstrom - 1966
29 On winning strategies with unary quantifiers - Nurmonen - 1996
20 Definability hierarchies of generalized quantifiers (context) - Hella - 1989
18 The expressive power of finitely many generalized quantififi.. - Dawar, Hella - 1995
17 Generalized quantifiers and logical reducibilities (context) - Dawar - 1995
16 Comparing the expressibility of languages formed using NP-co.. (context) - Stewart - 1991
13 Using the hamiltonian path operator to capture NP (context) - Stewart - 1992
10 On finite rigid structures - Gurevich, Shelah - 1996
9 Computable quantifiers and logics over finite structures - Makowsky, Pnueli - 1995
3 Stationary logic and its friends II (context) - Mekler, Shelah - 1986
2 Double arity hierarchies for transitive closure logics (context) - Grohe, Hella - 1996
1 Zeitschrift fur Mathematische Logik und Grundlagen der Mathe.. (context) - Krynicki, interpretation et al. - 1988
Documents on the same site (http://www.math.helsinki.fi/~hella/preprints.html): More
How to Define a Linear Order on Finite Models - Hella, Kolaitis, Luosto (1997) (Correct)
Enhancing Fixed Point Logic With Cardinality Quantifiers - Hella, Imhof (1996) (Correct)
Capturing Relativized Complexity Classes without Order - Dawar, Gottlob, Hella (1997) (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