Erich Gradel Yuri Gurevich February 17, 1997  Home/Search
Context Related
Links: ACM DBLP | mgi.informatik.rwthaachen...infcomp.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: mgi.informatik.rwthaachen.de/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Motivated by computer science challenges, we suggest to extend the approach and methods of finite model theory beyond finite structures. We study definability issues and their relation to complexity on metafinite structures which typically consist of (i) a primary part, which is a finite structure, (ii) a secondary part, which is a (usually infinite) structure that can be viewed as a structured domain of numerical objects, and (iii) a set of "weight" functions from the first part into the... (Update)
Cited by: More
A Decision Procedure for Semantical Equivalence of Thin FM.. - Piessens, Steegmans (1999) (Correct)
Similar documents (at the sentence level):
69.6%: Metafinite Model Theory - Erichgradel Yuri Gurevich (Correct)
Active bibliography (related documents): More All
0.5: The Complexity of Query Reliability - Erich Gradel Universityoftechnology (1998) (Correct)
0.4: Optimization Problems with Approximation Schemes - Malmström (Correct)
0.4: Towards a Theory of Recursive Structures - Harel (1998) (Correct)
Similar documents based on text: More All
0.4: Descriptive Complexity Theory over the Real Numbers - Grädel, Meer (1996) (Correct)
0.2: Tailoring Recursion for Complexity - Grädel, Gurevich (1995) (Correct)
0.2: Evolving Algebras - Mini-Course - Gurevich, Börger (1995) (Correct)
BibTeX entry: (Update)
Erich Gradel and Yuri Gurevich. Metafinite model theory. In D. Leivant, editor, Logic and Computational Complexity. Springer Verlag, 1995. http://citeseer.ist.psu.edu/article/gradel95metafinite.html More
@article{ gradel98metafinite,
author = "Erich Gradel and Yuri Gurevich",
title = "Metafinite Model Theory",
journal = "Information and Computation",
volume = "140",
number = "1",
pages = "26-81",
year = "1998",
url = "citeseer.ist.psu.edu/article/gradel95metafinite.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994 ACM
775 Foundations of Databases (context) - Abiteboul, Hull et al. - 1994 ACM DBLP
379 Complexity of Relational Query Languages (context) - Vardi - 1982
315 Constraint Query Languages - Kanellakis, Kuper et al. - 1990 ACM DBLP
294 Finite Model Theory (context) - Ebbinghaus, Flum - 1995
250 Computer Science Press (context) - Ullman, Knowledge-Base et al. - 1989
245 Relational Queries Computable in Polynomial Time - Immerman - 1986
213 a theory of computation and complexity over the real numbers.. (context) - Blum, Shub et al. - 1989
210 Generalized first-order spectra and polynomial-time recogniz.. (context) - Fagin - 1974
189 Computable Queries for Relational Data Bases - Chandra, Harel - 1980 DBLP
173 Proof verification and intractability of approximation probl.. (context) - Arora, Lund et al. - 1992
163 The complexity of enumeration and reliability problems (context) - Valiant - 1979
149 Logic and the Challenge of Computer Science (context) - Gurevich - 1988
114 Generic Computation and Its Complexity (context) - Abiteboul, Vianu - 1991 ACM DBLP
107 Topological Graph Theory (context) - Gross, Tucker - 1987 ACM
98 An Optimal Lower Bound on the Number of Variables for Graph .. - Cai, Furer et al. - 1989 ACM DBLP
95 Fixed Point Extensions of First Order Logic (context) - Gurevich, Shelah - 1986
88 Elements of Relational Database Theory (context) - Kanellakis - 1990 ACM DBLP
85 Upper and lower bounds for first-order expressibility (context) - Immerman - 1982
84 Evolving Algebras (context) - Gurevich ACM DBLP
78 On Moschovakis closure ordinals (context) - Barwise - 1977 DBLP
72 Finitely representable databases - Grumbach, Su - 1994
70 The Classical Decision Problem (context) - Borger, Gradel et al. - 1997
66 Describing Graphs: A First Order Approach to Graph Canonizat.. - Immerman, Lander - 1990
61 Descriptive and Computational Complexity - Immerman - 1989 ACM DBLP
60 Handling Infinite Temporal Data - Kabanza, Stevenne et al. - 1990 ACM DBLP
39 Expressibility as a Complexity Measure: Results and Directio.. (context) - Immerman - 1987
37 Feasible Computation through Model Theory - Dawar - 1993 ACM
36 La Sapienza (context) - Crescenzi, Kann et al. - 1995
31 Laws in Logic and Combinatorics (context) - Compton - 1988
29 Deux ou trois choses que je sais de Ln (context) - Poizat - 1982
26 Annotated Bibliography on Evolving Algebras (context) - Borger - 1995 ACM
26 Inductive Definability with Counting on Finite Structures - Gradel, Otto ACM DBLP
23 Descriptive Complexity Theory over the Real Numbers - Gradel, Meer ACM DBLP
23 Extended order-generic queries - Belegradek, Stolboushkin et al. - 1996 DBLP
18 The Expressive Power of Fixed-Point Logic with Counting (context) - Otto - 1996 DBLP
13 Register machine proof of the theorem of exponential diophan.. (context) - Jones, Matijasevich - 1984
13 order constraint queries over rational databases (context) - Stolboushkin, Taitslin et al. - 1996
13 Completeness Results for Recursive Databases - Hirst, Harel - 1993
12 approximization and complexity classes (context) - Papadimitriou, Yannakakis - 1991
10 Annals of Mathematical Logic (context) - Lynch, theories - 1980
6 Hilbert's Tenth Problem (context) - Matijasevich - 1993 ACM
6 Towards recursive model theory (context) - Stolboushkin - 1996
6 The very weak zero-one law for random graphs with order and .. - Shelah - 1994
5 Annals of Pure and Applied Logic (context) - Compton, Henson et al. - 1987
5 Diophantine Complexity (context) - Adleman, Manders - 1976 ACM DBLP
3 Toward logic tailord for computational complexity (context) - Gurevich - 1984
3 An arithmetical characterization of NP (context) - Kent, Hodgson - 1982 DBLP
3 More about Recursive Structures: Zero-One Laws and Expressib.. (context) - Hirst, Harel - 1996
3 A Normal form for Arithmetical Representation of NP-sets (context) - Hodgson, Kent - 1983
3 Computational complexity of decision problems for polynomial.. (context) - Adleman, Manders - 1975
3 Logic and Approximation (context) - Malmstrom - 1996
2 on Principles of Database Systems PODS (context) - Benedikt, Dong et al. - 1996
2 Nonconvergence in the theory of random orders (context) - Spencer - 1991
2 Bounded Variable Logic with Counting (context) - Otto - 1997
2 on Principles of Database Systems PODS (context) - de Rougemont, of et al. - 1995
2 Finite model theory -- A personal retrospective (context) - Fagin - 1993
2 Generalized Quantifiers for Simple Properties - Otto - 1994 DBLP
2 to appear in Archive of Mathematical Logic (context) - Gradel, Malmstrom et al. - 1997
2 private communication (context) - Tyszkiewicz
Documents on the same site (http://www-mgi.informatik.rwth-aachen.de/Publications/): More
Game Logic is Strong Enough for Parity Games - Berwanger (Correct)
Why Are Modal Logics So Robustly Decidable? - Grädel (Correct)
Prefix-Recognisable Graphs and Monadic Second-Order Logic - Blumensath (2001) (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