Completeness problems in verification of programs and program schemes

  • H. Andréka
  • I. Németi
  • I. Sain
Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)


Thm 1 states a negative result about the classical semantics
of program schemes. Thm 2 investigates the reason for this. We conclude that Thm 2 justifies the Henkin-type semantics ⊨ for which the opposite of the present Thm 1 was proved in Andréka-Németi[1],


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Andréka, H. and Németi, I., Completeness of Floyd Logic. Bulletin of Section of Logic 7(1978), 115–121, Wrocław.Google Scholar
  2. 2.
    Andréka, H. and Németi, I., A characterization of Floyd provable programs. Submitted to Proc.Coll.Logic in Programming, Salgótarján 1978. Coll.Math.Soc.J.Bolyai, North Holland.Google Scholar
  3. 3.
    Andréka, H. and Németi, I., Classical many-sorted model theory to turn negative results on program schemes to positive. Preprint 1978.Google Scholar
  4. 4.
    Andréka, H., Németi, I., and Sain, I., Abstract model theory, semantics, logics. Preprint 1979.Google Scholar
  5. 5.
    Chang, C.C. and Keisler, H.J., Model Theory. North Holland, 1973.Google Scholar
  6. 6.
    Davis, M., Hilbert's tenth problem is unsolvable. Amer.Math.Monthly 80(1973), 233–269.Google Scholar
  7. 7.
    Devlin, K.J., Aspects of Constructibility. Lecture Notes in Math. 354, Springer Verlag, 1973.Google Scholar
  8. 8.
    Gergely, T. and Ury, L., Mathematical Programming Theories.Google Scholar
  9. 9.
    Manna, Z., Mathematical Theory of Computation. McGraw Hill, 1974.Google Scholar
  10. 10.
    Monk, J.D., Mathematical Logic. Springer Verlag, 1976.Google Scholar
  11. 11.
    Németi, I. and Sain, I., Connections between Algebraic Logic and Initial Algebra Semantics of CF Languages. Submitted to Proc.Coll. Logic in Programming, cf. [2].Google Scholar
  12. 12.
    Sacks, G.E., Saturated Model Theory. W.A.Benjamin, Inc. Publ., Reading, Massachusetts, 1972.Google Scholar
  13. 13.
    Sain, I., On the General Theory of Semantics of Languages. Preprint 1979.Google Scholar
  14. 14.
    Szöts, M. and Gergely, T., On the incompleteness of proving partial correctness. Acta Cybernetica Tom 4, Fasc 1, Szeged 1978, pp.45–57.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • H. Andréka
    • 1
  • I. Németi
    • 1
  • I. Sain
    • 1
  1. 1.Mathematical Institute of theHungarian Academy of SciencesBudapestHungary

Personalised recommendations