Skip to main content
SpringerLink
Log in

Nonstandard Dynamic Logic

  • Conference paper
  • First Online:
Book cover Logics of Programs (Logic of Programs 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 131))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andréka,H. and Németi,I., Completeness of Floyd's program verification method w.r.t. nonstandard time models, Seminar Notes, Math. Inst.H.A.Sci.-SZKI 1977 (in Hungarian). This was abstracted in [2].

    Google Scholar 

  2. Andréka, H. and Németi, I., Completeness of Floyd Logic, Bull. Section of Logic Wroclaw Vol 7, No 3, 1978, pp. 115–121.

    Google Scholar 

  3. Andréka,H. Németi,I. and Sain,I., A complete logic for reasoning about programs via nonstandard model theory. Part I, Part II. Theoret.Comput.Sci. 17(1982) no.2 and no.3.

    Google Scholar 

  4. Andréka, H. Németi, I. and Sain, I., A complete first order dynamic logic. Preprint No. 810318, Math.Inst.H.A.S., Budapest, 1980.

    Google Scholar 

  5. Andréka,H. Németi,I. and Sain,I., Henkin-type semantics for program schemes to turn negative results to positive. In: Fundamentals of Computation Theory'79 (Proc.Conf. Berlin 1979), Ed.: L. Budach, Akademie Verlag Berlin 1979. Band 2. pp. 18–24.

    Google Scholar 

  6. Andréka, H. Németi, I. and Sain, I., A characterization of Floyd provable programs. In: Mathematical Foundations of Computer Science'81 (Proc.Conf. Strbské Pleso Czechoslovakia 1981) Lecture Notes in Computer Science, Springer Verlag, 1981.

    Google Scholar 

  7. Blok,W.J., The lattice of modal logics. J. Symbolic Logic. To appear.

    Google Scholar 

  8. Bowen, K.A., Model theory for modal logic. D.Reidel Publ.Co., Boston 1979, x+127 pp.

    Google Scholar 

  9. Burstall, R.M., Program proving as hand simulation with a little induction. IFIP Congress, Stockholm, August 3–10, 1974.

    Google Scholar 

  10. Chang,C.C. and Keisler,H.J., Model Theory. North-Holland, 1973.

    Google Scholar 

  11. Csirmaz, L., A survey of semantics of Floyd-Hoare derivability. CL&CL — Comput.Linguist.Comput.Lang. 14(1980)pp.21–42.

    Google Scholar 

  12. Csirmaz,L., On the completeness of proving partial correctness. Acta Cybernet. To appear.

    Google Scholar 

  13. Csirmaz,L. and Paris,J.B., A property of 2-sorted Peano models and program verification. Preprint Math.Inst.H.A.S. Budapest, 1981.

    Google Scholar 

  14. Gabbay,D. Pnuely,A. Shelah,S. and Stavi,J., On the temporal analysis of fairness. Preprint, Weizmann Inst. of Science, Dept. of Applied Math., May 1981.

    Google Scholar 

  15. Gergely,T. and Ury,L., Time models for programs. In: Mathematical Logic in Computer Science (Proc.Coll.Salgótarján 1978)Colloq.Math. Soc.J.Bolyai 26 Ed.s: Gergely,T. Dömölki,B. North-Holland, 1981. pp.359–427.

    Google Scholar 

  16. Hájek, P., Making dynamic logic first-order. In: Mathematical Foundations of Computer Science'81 (Proc.Conf. Strbské Pleso Czechoslovakia 1981) Lecture Notes in Computer Science, Springer Verlag, 1981.

    Google Scholar 

  17. Kfoury, D.J. and Park, D.M.R., On the termination of program schemas. Information & Control 29(1975),pp.243–251.

    Google Scholar 

  18. Manna, Z. and Waldinger, R., Is "Sometime" sometimes better than "Always"? Intermittent assertions in proving program correctness. Preprint No. Z173, Stanford Research Inst., Menlo Park, June 1976.

    Google Scholar 

  19. Monk,J.D., Mathematical Logic. Springer Verlag, 1976.

    Google Scholar 

  20. Németi, I., Nonstandard runs of Floyd provable programs. Preprint, Math.Inst.H.A.S., Budapest, 1980.

    Google Scholar 

  21. Németi, I., Hilbert style axiomatization of nonstandard dynamic logic. Preprint, Math.Inst.H.A.S., Budapest, 1980.

    Google Scholar 

  22. Németi, I., Results on the lattice of dynamic logics. Preprint, Math.Inst.H.A.S., Budapest, 1981.

    Google Scholar 

  23. Richter,M.M. and Szabo,M.E., Towards a nonstandard analysis of programs. In: Proc. 2nd Victoria Symp. on Nonstandard Analysis (Victoria, British Columbia, June 1980) Lecture Notes in Mathematics, Ed.: A. Hurd, Springer Verlag, 1981.

    Google Scholar 

  24. Sain, I., There are general rules for specifying semantics: Observations on abstract model theory. CL&CL — Comput.Linguist.Comput.Lang. 13(1979),pp.251–282.

    Google Scholar 

  25. Sain, I., First order dynamic logic with decidable proofs and workeable model theory. In: Fundamentals of Computation Theory'81 (Proc.Conf. Szeged 1981) Lecture Notes in Computer Science, Springer Verlag, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Math. Inst. Hungar. Acad. Sci. Budapest, Reáltanoda u. 13-15, H-1053, Hungary

    I. Németi

Authors
  1. I. Németi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dexter Kozen

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Németi, I. (1982). Nonstandard Dynamic Logic. In: Kozen, D. (eds) Logics of Programs. Logic of Programs 1981. Lecture Notes in Computer Science, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025789

Download citation

  • DOI: https://doi.org/10.1007/BFb0025789

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11212-9

  • Online ISBN: 978-3-540-39047-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation