Skip to main content

Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus

  • Contributions
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1991 (MFCS 1991)

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7 References

  • Barringer H., Cheng J.H., Jones C.B., [84] A logic covering undefinedness in program proofs, Acta Informatica 21 (1984), 251–269.

    Google Scholar 

  • Beth E.W., [59] The foundations of mathematics, North Holland 1959

    Google Scholar 

  • Blikle A., [81 a] On the devlopment of correctly specified programs, IEEE Trans. on Soft. Eng. SE-7 (1981), 519–527

    Google Scholar 

  • [81 b] The clean termination of iterative programs, Acta Informatica 16 (1981), 199–217

    Google Scholar 

  • [87] MetaSoft Primer, Towards a Metalanguage for Applied Denotational Semantics, LNCS 288, Springer-Verlag 1985

    Google Scholar 

  • [88] Three-valued predicates for software specification and validation, Proceedings of the VDM 88 Symposium, LNCS 328, 243–266, Springer-Verlag 1988

    Google Scholar 

  • Hogevijs A., [79] On a formalization of the non-definedness notion, Zeitscrift f. Math. Logik u. Grundlagen d. Math., Vol. 25 (1979), 213–221.

    Google Scholar 

  • [83] A partial predicate calculus in two-valued logic, ibid., Vol. 29 (1983), 239–243

    Google Scholar 

  • [87] Partial predicate logic in computer science, Acta Informatica 24, (1987), 381–393

    Google Scholar 

  • Jones C.B., [86] Systematic software development using VDM, Prentice-Hall International Series in Computer Science, 1986

    Google Scholar 

  • , [87] VDM proof obligations and their justifications, Proc. VDM Symposium 1987, 260–286, LNCS 252, Springer-Verlag, 1987.

    Google Scholar 

  • Kleene S.C., [52] Introduction to Metamathematics, North Holland 1952

    Google Scholar 

  • Konikowska B., Tarlecki A., Blikle A., [88] A three-valued logic for software specification and validation, Proceedings of the VDM 88 Symposium, LNCS 328, 218–242, Springer-Verlag 1988; a revised and extended version is to appear in Fundamenta Informatica

    Google Scholar 

  • McCarthy J., [61] A basis for a mathematical theory of computation, Western Joint Conference, 1961, later published in Computer Programming and Formal Systems, North Holland 1967, 33–70

    Google Scholar 

  • Owe O., [85] An approach to program reasoning based on first order logic for partial functions, Res. Rep. Institute of Informatics, University of Oslo, no. 89, 1985.

    Google Scholar 

  • Rasiowa H., Sikorski R., [63] The mathematics of metamathematics, Polish Scientific Publishers, Warsaw 1963.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Konikowska, B. (1991). Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus. In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_71

Download citation

  • DOI: https://doi.org/10.1007/3-540-54345-7_71

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47579-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics