Skip to main content
SpringerLink
Log in

Proof system for weakest prespecification and its applications

  • Communications
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1988 (MFCS 1988)

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

  • 140 Accesses

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. Buszkowski, W. and Orlowska, E. (1986a) On the logic of database dependencies. Bulletin of the PAS 34, Mathematics, 345–354.

    Google Scholar 

  2. Buszkowski, W. and Orlowska, E. (1986b) Relational calculus and data dependencies. ICS PAS Reports 578, Warsaw.

    Google Scholar 

  3. Codd, E.F. (1970) A relational model for large shared data banks. Communications of ACM 13, 377–387.

    Google Scholar 

  4. Hoare, C.A.R. and He Jifeng (1986) The weakest prespecification. Fundamenta Informaticae IX, Part I 51–84, Part II 217–252.

    Google Scholar 

  5. Iwinski, T. (1987) Contraction of attributes. Bulletin of the PAS, Mathematics, to appear.

    Google Scholar 

  6. Mrozek,A. (1986) private communication.

    Google Scholar 

  7. Orlowska,E. (1984) Reasoning about database constraints. ICS PAS Reports 543, Warsaw.

    Google Scholar 

  8. Orlowska, E. (1987) Algebraic approach to database constraints. Fundamenta Informaticae X, 57–68.

    Google Scholar 

  9. Orlowska,E. (1987) Relational interpretation of modal logics. Bulletin of the Section of Logic, to appear.

    Google Scholar 

  10. Pawlak, Z. (1981) Information systems-theoretical foundations. Information Systems 6, 205–218.

    Google Scholar 

  11. Rasiowa, H. and Sikorski, R. (1963) Mathematics of metamathematics. Polish Scientific Publishers, Warsaw.

    Google Scholar 

  12. Tarski, A. (1941) On the calculus of relations. Journal of Symbolic Logic 6, 73–89.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Polish Academy of Sciences, P.O.Box 22, 00-901, Warsaw, Poland

    Ewa Orlowska

Authors
  1. Ewa Orlowska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Orlowska, E. (1988). Proof system for weakest prespecification and its applications. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017169

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50110-7

  • Online ISBN: 978-3-540-45926-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation