Existential fixed-point logic

  • Andreas Blass
  • Yuri Gurevich
Part of the Lecture Notes in Computer Science book series (LNCS, volume 270)


The purpose of this paper is to draw attention to existential fixed-point logic. Among other things, we show that: (1) If a structure A satisfies an existential fixed-point formula φ, then A has a finite subset F such that every structure B with A|F = B|F satisfies φ. (2) Using existential fixed-point logic instead of first-order logic removes the expressivity hypothesis in Cook's completeness theorem for Hoare logic. (3) In the presence of a successor relation, existential fixed-point logic captures polynomial time.


Atomic Formula Predicate Symbol Satisfiability Problem Existential Quantifier Weak Precondition 
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. Apt, K. (1981) Ten years of Hoare's logic: A survey — Part I. ACM Trans. Program. Lang. Syst. 3 pp. 431–483.Google Scholar
  2. Barwise, K. J. (1975) Admissible Sets and Structures. Springer-Verlag.Google Scholar
  3. Chang, C. C. and Keisler, H. J. (1973) Model Theory. North-Holland.Google Scholar
  4. Cook, S. A. (1978) Soundness and completeness of an axiom system for program verification. SIAM J. Computing 7 pp.70–90.Google Scholar
  5. Dijkstra, E. W. (1975) Guarded commands, nondeterminacy, and the formal derivation of programs. Comm. ACM 18 pp.453–457.Google Scholar
  6. Hoare, C. A. R. (1969) An axiomatic basis for computer programming. Comm. ACM 12 pp.576–580, 583.Google Scholar
  7. Immerman, N. (1982) Relational queries computable in polynomial time. 14th ACM STOC pp.147–152.Google Scholar
  8. Mal'cev, A. I. (1959) Modelniye sootvetstviya (Model correspondences). Izv. Akad. Nauk SSSR Ser. Mat. 23 pp.313–336 (Russian).Google Scholar
  9. Vardi, M. (1982) Complexity of relational query languages 14th ACM STOC pp. 137–146.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Andreas Blass
    • 1
  • Yuri Gurevich
    • 1
  1. 1.Mathematics Department and Electrical Engineering and Computer Science DepartmentUniversity of MichiganAnn ArborU.S.A.

Personalised recommendations