Metafinite Model Theory
- 1 January 1998
- journal article
- Published by Elsevier in Information and Computation
- Vol. 140 (1) , 26-81
- https://doi.org/10.1006/inco.1997.2675
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Completeness Results for Recursive Data BasesJournal of Computer and System Sciences, 1996
- Finite-model theory - a personal perspectiveTheoretical Computer Science, 1993
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Nonconvergence, undecidability, and intractability in asymptotic problemsAnnals of Pure and Applied Logic, 1987
- Fixed-point extensions of first-order logicAnnals of Pure and Applied Logic, 1986
- Relational queries computable in polynomial timeInformation and Control, 1986
- A normal form for arithmetical representation of N P-setsJournal of Computer and System Sciences, 1983
- Upper and lower bounds for first order expressibilityJournal of Computer and System Sciences, 1982
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- On Moschovakis closure ordinalsThe Journal of Symbolic Logic, 1977