Metafinite model theory

Metafinite model theory (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Yuri Gurevich

Venue:	Information and Computation
Citations:	61 - 10 self

BibTeX

@ARTICLE{Gurevich98metafinitemodel,
    author = {Yuri Gurevich},
    title = {Metafinite model theory},
    journal = {Information and Computation},
    year = {1998},
    volume = {140},
    pages = {26--81}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

996	JD: Principles of database and knowledge-base systems, Vol 1 - Ullman - 1988
505	Optimization, approximation, and complexity classes - Papadimitriou, Yannakakis - 1988
485	The Complexity of Relational Query Languages - Vardi - 1982
431	Finite Model Theory - Ebbinghaus, Flum - 1999
334	The complexity of enumeration and reliability problems - Valiant - 1979
325	On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines - Blum, Shub, et al. - 1989
318	P.Z.: Constraint Query Languages - Kanellakis, Kuper, et al. - 1995
239	Y.: The Classical Decision Problem - Börger, Grädel, et al. - 1996
239	Topological graph theory - Gross, Tucker - 2001
149	Logic and the challenge of computer science - Gurevich - 1988
119	An Optimal Lower Bound on the Number of Variables for Graph Identi cation - Cai, Furer, et al. - 1989
111	Generic computation and its complexity', in - Abiteboul, Vianu - 1991
108	Computable queries for relational data bases - Chandra, Harel
103	Elements of relational database theory - Kanellakis - 1990
71	Relational expressive power of constraint query languages - Benedikt, Dong, et al. - 1998
62	On Moschovakis closure ordinals - Barwise
54	Finitely Representable Databases., in "J - GRUMBACH, SU - 1997
48	Descriptive and computational complexity - Immerman - 1989
38	Expressibility as a complexity measure: Results and directions - Immerman - 1987
36	Feasible Computation through Model Theory - Dawar - 1993
23	Descriptive complexity theory over the real numbers - Gradel, Meer - 1996
21	Describing Graphs: A First Order Approach to Graph Canonization - Immerman, Lander - 1990
17	Deux ou trois choses que je sais de Ln - Poizat
15	Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets - Jones, Matiyasevich - 1984
15	Almost sure theories - Lynch - 1980
15	The Expressive Power of Fixed-Point Logic with Counting - Otto - 1996
11	Non-convergence, Undecidability and Intractability in asymptotic problems, Annals of Pure and Applied Logic 36(1987):207–224 - Compton, Henson, et al.
10	The fix point extensions of first order logic - Gurevich, Shelah - 1985
10	Relational Queries Computable - Immerman - 1986
10	Hilbert’s Tenth Problem - Matijasevich - 1993
10	Very weak zero one law for random graphs with order and random binary functions, Random Struct. Algorithms 9 - Shelah - 1996
9	Evolving Algebras 1993: Lipari Guide, in: E. Borger (Ed.), Speci cation and Validation Methods - Gurevich - 1995
9	Linear vs. Order Constraint Queries Over Relational Databases - Stolboushkin, Taitslin - 1996
6	Proof veri cation and intractability of approximation Problems - Arora, Lund, et al. - 1998
6	Upper and lower bounds for rst-order expressibility - Immerman - 1982
5	Computational complexity of decision problems for polynomials - Adleman, Manders - 1975
5	Diophantine Complexity - Adleman, Manders - 1976
5	Rougemont, The reliability of queries - de - 1995
5	0-1 laws for recursive structures - Grädel, Malmström - 1999
4	Toward logic tailord for computational complexity, in: M. M. Richter et al - Gurevich - 1984
3	Extended order-generic queries, preprint - Belegradek, Stolboushkin, et al. - 1996
3	Completeness results for recursive databases - Hirst, Harel - 1993
3	More about Recursive Structures: Zero-One Laws and Expressibility vs - Hirst, Harel - 1996
3	A Normal form for Arithmetical Representation of NP-sets - Hodgson, Kent - 1983
3	An arithmetical characterization of NP, Theoretical Computer Science 12 - Kent, Hodgson - 1982
2	Generalized rst-order spectra andpolynomial-time recognizable sets - Fagin - 1974
2	Inductive De nability with Counting on Finite Structures - Gradel, Otto - 1993
2	Logic and Approximation - Malmstrom - 1996
2	Bounded Variable Logic with Counting. A Study on Finite Models - Otto - 1997
1	Annotated Bibliography on Evolving Algebras, in:E.Borger (Ed.), Speci cation and Validation Methods - Borger - 1995