Logic of Programs 1985: Logics of Programs pp 153-166 | Cite as

On asymptotic probabilities of inductive queries and their decision problem

  • Phokion G. Kolaitis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 193)


Equivalence Class Disjoint Union Connected Structure Winning Strategy Finite Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. A. Aho and J. Ullman [1979]: Universality of data retrieval languages, Proc. 6th ACM Symposium of Programming Languages, 1979, 110–120.Google Scholar
  2. J. Barwise [1977]: On Moschovakis closure ordinals, J. Symbolic Logic 42 (1977), 292–296.Google Scholar
  3. A. Blass, Y. Gurevich, D. Kozen [1984]: A zero-one law for logic with a fixed-point operator, Technical Report CRL-TR-38-84, University of Michigan, 1984.Google Scholar
  4. A. Chandra and D. Harel [1982]: Structure and complexity of relational queries, J. Comp. System Sci. 25 (1982), 99–128.Google Scholar
  5. K. Compton [1980]: Applications of logic to finite combinatorics, Ph.D. Thesis, University of Wisconsin, Madison, 1980.Google Scholar
  6. K. Compton [1984a]: A logical approach to asymptotic combinatorics I: First order properties, to appear in: Advances in Mathematics.Google Scholar
  7. K. Compton [1984b]: A logical approach to asymptotic combinatorics II: Monadic second order properties, to appear in: Advances in Mathematics.Google Scholar
  8. R. Fagin [1976]: Probabilities on finite models, J. Symbolic Logic 41 (1976), 50–58.Google Scholar
  9. E. Grandjean [1983]: Complexity of the first-order theory of almost all structures, Information and Control 57 (1983), 180–204.Google Scholar
  10. D. Harel and D. Kozen [1984]: A programming language for the inductive sets and applications, to appear in: Information and Control.Google Scholar
  11. N. Immerman [1982a]: Relational queries computable in polynomial time, Proc. 14th ACM Symposium on Theory of Computing, 1982, 147–152.Google Scholar
  12. N. Immerman [1982b]: Upper and lower bounds for first-order expressibility, J. Comp. System Sci. 25 (1982), 76–98.Google Scholar
  13. Y. N. Moschovakis [1974]: Elementary Induction on Abstract Structures, North-Holland, 1974.Google Scholar
  14. R. L. Tenney [1975]: Second-order Ehrenfeuct games and the decidability of the second-order theory of an equivalence relation, J. Austral. Math. Soc. 20 (Series A) 1975, 323–331.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Phokion G. Kolaitis
    • 1
    • 2
  1. 1.Department of MathematicsOccidental CollegeLos Angeles
  2. 2.Department of MathematicsUniversity of CaliforniaLos Angeles

Personalised recommendations