Skip to main content

Deductive normal forms of relations

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Methods of Specification and Synthesis of Software Systems '85 (MMSSS 1985)

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

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.

References

  1. C.L. Chang, R.C.-T. Lee: Symbolic logic and mechanical theorem proving. Academic press, New York 1973.

    Google Scholar 

  2. N. Goodman, Y.C. Tay: A characterization of multivalued dependencies equivalent to a join dependency. Information Processing Letters 18 (1984), 261–266.

    Google Scholar 

  3. J. Minker, J.-M. Nicolas: On recursive axioms in deductive databases. Information Systems 8, 1, 1–13, 1983.

    Google Scholar 

  4. B. Thalheim: Dekompositionsabhängigkeiten in Relationen. Manuscript, Dresden 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wolfgang Bibel Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thalheim, B. (1986). Deductive normal forms of relations. In: Bibel, W., Jantke, K.P. (eds) Mathematical Methods of Specification and Synthesis of Software Systems '85. MMSSS 1985. Lecture Notes in Computer Science, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16444-8_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-16444-8_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39784-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics