Academia.eduAcademia.edu

Outline

Title
Abstract
Related Approaches
An Excursion: Reliability of Database Queries
The Uncountable Case
The Countable Case
References
All Topics
Mathematics
Mathematical Logic

Metafinite Model Theory

Profile image of Erich GrädelErich Grädel

1998, Information and Computation

https://doi.org/10.1006/INCO.1997.2675
visibility

…

description

56 pages

link

1 file

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 second. We discuss model-theoretic properties of metafinite structures, present results on descriptive complexity, and sketch some potential applications.

Related papers

On the Expressive Power of Logics on Finite Models
Erich Grädel

Texts in Theoretical Computer Science an EATCS Series, 2007

View PDFchevron_right
Classification in Finite Model Theory
Paweł Idziak
View PDFchevron_right
Effective Model Theory via the Σ-Definability Approach
Alexey Stukachev

2008

We present an approach to abstract computability based on the notion of Σ-definability, and survey some results on effective model theory which are obtained within this framework.

View PDFchevron_right
Reflections on Finite Model Theory
Phokion Kolaitis

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Advances in finite model theory have appeared in LICS proceedings since the very beginning of the LICS Symposium. The goal of this paper is to reflect on finite model theory by highlighting some of its successes, examining obstacles that were encountered, and discussing some open problems that have stubbornly resisted solution.

View PDFchevron_right
Descriptive complexity of finite structures: Saving the quantifier rank
O. Pikhurko

The Journal of Symbolic Logic, 2005

We say that a first order formula Φ distinguishes a structure M over a vocabulary L from another structure M ′ over the same vocabulary if Φ is

View PDFchevron_right
Automata-based presentations of infinite structures
Vince Bárány

Finite and Algorithmic Model Theory (volume 379 of London Mathematical Society Lecture Notes Series), 2011

View PDFchevron_right
Pseudo-finite model theory
Jouko Väänänen

2003

We consider the restriction of first-order logic to models, called pseudofinite, with the property that every first-order sentence true in the model is true in a finite model. We argue that this is a good framework for studying first-order logic on finite structures. We prove a Lindström Theorem for extensions of first order logic on pseudo-finite structures. * I am indebted to John Baldwin, Lauri Hella, Tapani Hyttinen, Phokion Kolaitis and Kerkko Luosto for useful suggestions.

View PDFchevron_right
On the Complexity of Model Expansion
David Mitchell

Logic Programming and Automated Reasoning/Russian Conference on Logic Programming, 2010

We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a given formula. This is the logical task underlying many practical constraint languages and systems for representing and solving search problems, and our work is motivated by the need to provide theoretical foundations

View PDFchevron_right
Decidability and the finite model property
Alasdair Urquhart

Journal of Philosophical Logic, 1981

View PDFchevron_right
Approximating the Expressive Power of Logics in Finite Models
Argimiro Arratia

Lecture Notes in Computer Science, 2004

We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order formula) which, on the one hand, captures uniform circuit classes such as AC 0 and TC 0 over arithmetic models, namely, finite structures with linear order and arithmetic relations, and, on the other hand, their semantics, with respect to our arithmetic models, can be closely approximated by giving interpretations of their formulas on finite structures where all relations (including the order) are restricted to be "modular" (i.e. to act subject to an integer modulo). In order to give a precise measure of the proximity between satisfaction of a formula in an arithmetic model and satisfaction of the same formula in the "approximate" model, we define the approximate formulas and work on a notion of approximate truth. We also indicate how to enhance the expressive power of our probability logic in order to capture polynomial time decidable queries, There are various motivations for this work. As of today, there is not known logical description of any computational complexity class below NP which does not requires a built-in linear order. Also, it is widely recognized that many model theoretic techniques for showing definability in logics on finite structures become almost useless when order is present. Hence, if we want to obtain significant lower bound results in computational complexity via the logical description we ought to find ways of by-passing the ordering restriction. With this work we take steps towards understanding how well can we approximate, without a true order, the expressive power of logics that capture complexity classes on ordered structures.

View PDFchevron_right

References (61)

  1. Proposition 6.1. Let R=(R, 0, 1, 1 REFERENCES
  2. Abiteboul, S., Hull, R., and Vianu, V. (1994), ``Foundations of Databases,'' Addison Wesley, Reading, MA.
  3. Abiteboul, S., and Vianu, V. (1991), Generic computation and its complexity, in ``Proceedings of 23rd ACM Symposium on Theory of Computing,'' pp. 209 219.
  4. Adleman, L., and Manders, K. (1975), Computational complexity of decision problems for poly- nomials, in ``Proceedings of 16th IEEE Symposium on Foundations of Computer Science,'' pp. 169 177.
  5. Adleman, L., and Manders, K. (1976), Diophantine complexity, in ``Proceedings of 17th IEEE Sym- posium on Foundations of Computer Science,'' pp. 81 88.
  6. Arora, S., Lund, C., Motwani, R, Sudan, M., and Szegedy, M. (1992), Proof verification and intrac- tability of approximation problems, in ``Proceedings of 33rd IEEE Symposium on Foundations of Computer Science,'' pp. 210 214.
  7. Barwise, J. (1977), On Moschovakis closure ordinals, J. Symbolic Logic 42, 292 296.
  8. Bo rger, E., Gra del, E., and Gurevich, Y. (1997), ``The Classical Decision Problem,'' Springer-Verlag, Berlin.
  9. Belegradek, O., Stolboushkin, A., and Taitslin, M. (1996), Extended order-generic queries, preprint.
  10. Benedikt, M., Dong, G., Libkin, L., and Wong, L. (1996). Relational expressive power of constraint query languages, in ``Proc. 15th ACM Symp. on Principles of Database Systems PODS,'' pp. 5 16.
  11. Blum, L., Shub, M., and Smale, S. (1989), On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. 21, 1 46.
  12. Bo rger, E., and Huggins, J. (1998), Annotated bibliography on abstract state machines (ASMs), Bull. EATCS 64.
  13. Cai, J., Fu rer, M., and Immerman, N. (1989), An optimal lower bound on the number of variables for graph identification, in ``Proceedings of 30th IEEE Symposium on Foundations of Computer Science,'' pp. 612 617.
  14. Chandra, A., and Harel, D. (1980), Computable queries for relational data bases, J. Comput. System Sci. 21, 156 178.
  15. Compton, K. (1988), 0 1 laws in logic and combinatorics, in ``NATO Adv. Study Inst. on Algo- rithms and Order'' (I. Rival, Ed.), pp. 353 383.
  16. Compton, K., Henson, C., and Shelah, S. (1987), Nonconvergence, undecidability and intractability in asymptotic problems, Ann. Pure Appl. Logic 36, 207 224.
  17. Crescenzi, P., and Kann, V. (1995), ``A Compendium of NP Optimization Problems,'' Technical Report SIÂRR-95Â-02, Dipartimento di Scienze dell'Informazione, UniversitaÁ di Roma ``La Sapienza''.
  18. Dawar, A. (1993), ``Feasible Computation through Model Theory,'' Ph.D. thesis, University of Pennsylvania.
  19. de Rougemont, M. (1995), The reliability of queries, in ``Proc. 14th ACM Symp. on Principles of Database Systems PODS.''
  20. Ebbinghaus, H.-D., and Flum, J. (1995), ``Finite Model Theory,'' Springer-Verlag, Berlin.
  21. Fagin, R. (1974), Generalized first-order spectra and polynomial-time recognizable sets, SIAM AMS Proc. 7, 43 73.
  22. Fagin, R. (1993), Finite model theory A personal retrospective, Theoret. Comput. Sci. 116, 3 31.
  23. Gra del, E., and Malmstro m, A. (1997), 0 1 laws for recursive structures, Archive Math. Logic, in press.
  24. Gra del, E., and Meer, K. (1995), Descriptive complexity theory over the real numbers, in ``Proceedings of 27th ACM Symposium on Theory of Computing, STOC '95, Las Vegas'' [An expanded version appeared in Renegar, J., Shub, M., and Smale, S. (Eds.) (1996), ``Mathematics of Numerical Analysis: Real Number Algorithms,'' AMS Lectures in Applied Mathematics 32, pp. 381 403].
  25. Gra del, E., and Otto, M. (1993), Inductive definability with counting on finite structures, in ``Selected Papers, 6th Workshop on Computer Science Logic CSL 92, San Miniato 1992,'' Lecture Notes in Computer Science, Vol. 702, pp. 231 247, Springer-Verlag, Berlin.
  26. Gross, J., and Tucker, T. (1987), ``Topological Graph Theory,'' Wiley, New York.
  27. Grumbach, S., and Su, J. (1994), Finitely representable databases, in ``Proceedings of 13th ACM Symposium on Principles of Database Systems.''
  28. Gurevich, Y. (1984), Toward logic tailord for computational complexity, in ``Computation and Proof Theory'' (M. M. Richter et al., Eds.), Lecture Notes in Mathematics, Vol. 1104, pp. 175 216, Springer-Verlag, Berlin.
  29. Gurevich, Y. (1988), Logic and the challenge of computer science, in ``Trends in Theoretical Com- puter Science, Computer'' (E. Bo rger, Ed.), pp. 1 57, Computer Science Press.
  30. Gurevich, Y. (1995), Evolving algebras 1993: Lipari guide, in ``Specification and Validation Methods'' (E. Bo rger, Ed.), Oxford Univ. Press, London.
  31. Gurevich, Y., and Shelah, S. (1986), Fixed point extensions of first order logic, Ann. Pure Appl. Logic 32, 265 280.
  32. Hirst, T., and Harel, D. (1996), Completeness results for recursive databases, J. Comput. System Sci. 52, 522 536.
  33. Hirst, T., and Harel, D. (1996), More about recursive structures: Zero-one laws and expressibility vs complexity, in ``Proceedings of 11th IEEE Symposium on Logic in Computer Science.''
  34. Hodgson, B., and Kent, C. (1983), A normal form for arithmetical representation of NP-sets, J. Comput. System Sci. 27, 378 388.
  35. Immerman, N. (1982), Upper and lower bounds for first-order expressibility, J. Comput. Systems Sci. 25, 86 104.
  36. Immerman, N. (1986), Relational queries computable in polynomial time, Information Control 68, 86 104.
  37. Immerman, N. (1987), Expressibility as a complexity measure: results and directions, in ``Proc. of 2nd Conf. on Structure in Complexity Theory,'' pp. 194 202.
  38. Immerman, N. (1989), Descriptive and computational complexity, in ``Computational Complexity Theory'' (J. Hartmanis, Ed.), Proc. of AMS Symposia in Appl. Math., Vol. 38, pp. 75 91.
  39. Immerman, N., and Lander, E. (1990), Describing graphs: A first order approach to graph canoniza- tion, in ``Complexity Theory Retrospective. (In Honor of Juris Hartmanis)'' (A. Selman, Ed.), pp. 59 81, Springer-Verlag, New York.
  40. Jones, J., and Matijasevich, Y. (1984), Register machine proof of the theorem of exponential diophantine representation of enumerable sets, J. Symbolic Logic 49, 818 829.
  41. Kabanza, F., Ste venne, J., and Wolper, P. (1995), Handling infinite temporal data, J. Comput. System Sci. 51, 3 17.
  42. Kanellakis, P. (1990), Elements of relational database theory, in ``Handbook of Theoretical Com- puter Science'' (J. van Leeuwen, Ed.), Vol. B, pp. 1073 1156, North-Holland, Amsterdam.
  43. Kanellakis, P., Kuper, G., Revesz, P. (1990), Constraint query languages, in ``Proceedings of 9th ACM Symposium on Principles of Database Systems,'' pp. 299 313.
  44. Kent, C., and Hodgson, B. (1982), An arithmetical characterization of NP, Theoret. Comput. Sci. 12, 255 267.
  45. Lynch, J. (1980), Almost sure theories, Ann. Math. Logic 18, 91 135.
  46. Malmstro m, A. (1996), ``Logic and Approximation,'' Ph.D. thesis, RWTH Aachen.
  47. Matijasevich, Y. (1993), ``Hilbert's Tenth Problem,'' MIT Press, Cambridge, MA.
  48. Otto, M. (1994), Generalized quantifiers for simple properties, in ``Proceedings of IEEE Symposium on Logic in Computer Science,'' pp. 30 39.
  49. Otto, M. (1996), The expressive power of fixed-point logic with counting, J. Symbolic Logic 61, 147 176.
  50. Otto, M. (1997), ``Bounded Variable Logic with Counting. A Study on Finite Models,'' Lecture Notes in Logic 9, Springer-Verlag, Berlin.
  51. Papadimitriou, C. (1994), ``Computational Complexity,'' Addison Wesley, Reading, MA.
  52. Papadimitriou, C., and Yannakakis, M. (1991), Optimization, approximization and complexity classes, J. Comput. System Sci. 43, 425 440.
  53. Poizat, B. (1982), Deux ou trois choses que je sais de L n , J. Symbolic Logic 47, 641 658.
  54. Shelah, S. (1994), The very weak zero-one law for random graphs with order and random binary functions, preprint.
  55. Spencer, J. (1991), Nonconvergence in the theory of random orders, Order 7, 341 348.
  56. Stolboushkin, A. (1996), Towards recursive model theory, preprint.
  57. Stolboushkin, A., and Taitslin, M. (1996), Linear vs. order constraint queries over rational databases, in ``Proc. 15th ACM Symp. on Principles of Database Systems PODS,'' pp. 17 27.
  58. Tyszkiewicz, J., private communication.
  59. Ullman, J. D. (1989), ``Database and Knowledge-Base Systems, Vol. I and II,'' Computer Science Press.
  60. Valiant, L. (1979), The complexity of enumeration and reliability problems, SIAM J. Comput. 8, 410 421.
  61. Vardi, M. (1982), Complexity of relational query languages, in ``Proc. of 14th Symposium on Theory of Computing,'' pp. 137 146.

Related papers

1 Definability in classes of finite structures
Charles Steinhorn

2011

This paper provides an overview of recent work by the authors and others on two topics in the model theory of finite structures. The point of view here differs from that usually associated with the term ‘finite model theory’, as presented for example in [21] or [46], in which the emphasis and motivation come primarily from computer science. Instead, the inspiration for this work has its origins in contemporary (infinite) model theoretic themes such as dimension, independence, and various measures of the complexity of definable sets. Each of the topics deals with classes of finite structures for first-order logic that are isolated by conditions that are drawn from these model-theoretic considerations. Moreover, in both cases, connections exist to areas in infinite model theory such as stability and simplicity theory, and o-minimality. This survey is intended for both mathematical logicians and computer scientists whose work focuses on logical aspects of the subject. The first theme c...

View PDFchevron_right
Finite-model theory - a personal perspective
Ronald Fagin

Theoretical Computer Science, 1993

Fagin. R., Finite-mode1 theory -a personal perspective, Theoretical Computer Science 116 (1993) 3-31.

View PDFchevron_right
Computable model theory
Valentina Harizanov

Developments from Turing's Ideas in Logic, 2009

Introduction and preliminaries. 2. Degrees and jump degrees of structures and their isomorphism types. 3. Theories, types, models, and diagrams. 4. Small theories and their models. 5. Effective categoricity. 6. Automorphisms of effective structures. 7. Degree spectra of relations. 8. Families of relations on a structure. 9. Classes of structures and equivalence relations.

View PDFchevron_right
Unifying Themes in Finite Model Theory
Erich Grädel

Texts in Theoretical Computer Science an EATCS Series, 2007

One of the fundamental insights of mathematical logic is that our understanding of mathematical phenomena is enriched by elevating the languages we use to describe mathematical structures to objects of explicit study. If mathematics is the science of pattern, then the media through which we discern patterns, as well as the structures in which we discern them, command our attention. It is this aspect of logic which is most prominent in model theory, "the branch of mathematical logic which deals with the relation between a formal language and its interpretations" . No wonder, then, that mathematical logic, in general, and finite model theory, the specialization of model theory to finite structures, in particular, should find manifold applications in computer science: from specifying programs to querying databases, computer science is rife with phenomena whose understanding requires close attention to the interaction between language and structure.

View PDFchevron_right
Finite Model Theory and its applications
Moshe Vardi

2007

This book gives a comprehensive overview of central themes of finite model theory–expressive power, descriptive complexity, and zero-one laws–together with selected applications relating to database theory and artificial intelligence, especially constraint databases and constraint satisfaction problems. The final chapter provides a concise modern introduction to modal logic, emphasizing the continuity in spirit and technique with finite model theory.

View PDFchevron_right

Related topics

  • Model Theory
  • Finite Model Theory

    • Cited by

    Finite state machines for strings over infinite alphabets
    Frank Neven

    ACM Transactions on Computational Logic, 2004

    Motivated by formal models recently proposed in the context of XML, we study automata and logics on strings over infinite alphabets. These are conservative extensions of classical automata and logics defining the regular languages on finite alphabets. Specifically, we consider register and pebble automata, and extensions of first-order logic and monadic second-order logic. For each type of automaton we consider one-way and two-way variants, as well as deterministic, non-deterministic, and alternating control. We investigate the expressiveness and complexity of the automata, their connection to the logics, as well as standard decision problems. Some of our results answer open questions of Kaminski and Francez on register automata.

    View PDFchevron_right
    Evolving concurrent systems
    Flavio Ferrarotti

    Proceedings of the Australasian Computer Science Week Multiconference, 2017

    A concurrent system can be characterised by autonomously acting agents, where each agent executes its own program, uses shared resources and communicates with the others, but otherwise is totally oblivious to the behaviour of the other agents. In an evolving concurrent system agents may change their programs, enter or leave the collection at any time thereby changing the behaviour of the overall system. In this paper we present a behavioural theory of evolving concurrent systems, i.e. we provide (1) a small set of postulates that characterise evolving concurrent systems in a precise conceptual way without any reference to a particular language, (2) an abstract machine model together with a plausibility proof that the abstract machines satisfy the postulates, and (3) a characterisation proof that any system stipulated by the postulates can be step-by-step simulated by an abstract machine. The theory integrates the behavioural theories for unbounded (synchronous) parallel algorithms, asynchronous concurrent systems, and reflective algorithms, respectively. However, in the latter two theories only sequential agents and sequential reflective algorithms were considered. Furthermore, linguistic reflection has not been integrated with parallelism. We will show how these research gaps can be closed.

    View PDFchevron_right
    Polynomials of Bounded Tree Width (Extended Abstract)
    Klaus Meer

    Springer eBooks, 2000

    We introduce a new sparsity conditions on multivariate polynomials in n variables (over some ring R) and show that under this condition many otherwise intractable computational problems involving these polynomials become solvable in polynomial (even linear) time in n (in the BSS-model over R). To de ne our sparsity condition we associate with these polynomials a hypergraph and study classes of polynomials where this hypergraph has tree width at most k for some xed k 2 N. We are interested in three cases: (1) The evaluation of multivariate polynomials where the number of monomials is O(2 n). (2) The question whether a system of n polynomials pi(x) 2 R x] of xed degree d in n variables has a root in R n. (3) For in nite ordered rings Rord, a polynomial of xed degree d in n variables p(x) 2 Rord x] and a nite subset A Rord we want to know whether p(a) > 0 for all a 2 R n ord. Our method uses graph theoretic and model theoretic tools developed in the last 15 years and applies them to the algebraic setting. This work is an extension of work by B. Courcelle, J.A. Makowsky and U. Rotics.

    View PDFchevron_right
    On polynomial time computation over unordered structures
    Andreas Blass

    Journal of Symbolic Logic, 2002

    This paper is motivated by the question whether there exists a logic capturing polynomial time computation over unordered structures. We consider several algorithmic problems near the border of the known, logically defined complexity classes contained in polynomial time. We show that fixpoint logic plus counting is stronger than might be expected, in that it can express the existence of a complete matching in a bipartite graph. We revisit the known examples that separate polynomial time from fixpoint plus counting. We show that the examples in a paper of Cai, Fürer, and Immerman, when suitably padded, are in choiceless polynomial time yet not in fixpoint plus counting. Without padding, they remain in polynomial time but appear not to be in choiceless polynomial time plus counting. Similar results hold for the multipede examples of Gurevich and Shelah, except that their final version of multipedes is, in a sense, already suitably padded. Finally, we describe another possible candidat...

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved