Skip to main content

Armstrong’s Inference Rules in Dedekind Categories

  • Conference paper
  • 451 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5827))

Abstract

It is well-known that Armstrong’s inference rules are sound and complete for functional dependencies of relational data bases and for implication in the theory of formal concepts by Wille and Ganter. In this paper the authors treat Armstrong’s inference rules and the implication as (binary) relations in an upper semi lattice in a Dedekind category, and give a relation algebraic proof of the completeness theorem for Armstrong’s inference rules in a Schröder category.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Codd, E.: A Relational Model of Data for Large Shared Data Banks. Communications of the ACM 13, 377–387 (1970)

    Article  MATH  Google Scholar 

  2. Beeri, C., Fagin, R., Howard, J.: A Complete Axiomatization for Functional and Multivalued Dependencies in Database Relations. In: Proceedings of the 1977 ACM SIGMOD International Conference on Management of Data, Toronto, Canada, pp. 47–61 (1977)

    Google Scholar 

  3. Armstrong, W.W.: Dependency Structures in Database Relationships. In: IFIP Congress, pp. 580–583 (1974)

    Google Scholar 

  4. Ishida, T., Honda, K., Kawahara, Y.: Implication and Functional Dependency in Intensional Contexts. Bulletin of Informatics and Cybernetics 40, 101–111 (2008)

    MathSciNet  Google Scholar 

  5. Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  6. Olivier, J., Serrato, D.: Catégories de Dedekind. Morphismes dans les Catégories de Schröder. C. R. Acad. Sci. Paris 260, 939–941 (1980)

    Google Scholar 

  7. Freyd, P., Scedrov, A.: Categories, Allegories. North-Holland, Amsterdam (1990)

    MATH  Google Scholar 

  8. Yasuo, K.: Urysohn’s lemma in Schröder categories. Bulletin of Informatics and Cybernetics 39, 69–81 (2007)

    MathSciNet  Google Scholar 

  9. Kawahara, Y., Tanaka, K.: Closure Systems and Closure Operations in Dedekind Categories. Bulletin of Informatics and Cybernetics 40, 89–99 (2008)

    MathSciNet  Google Scholar 

  10. Kawahara, Y.: Theory of Relations. Kyushu University (2007)

    Google Scholar 

  11. Ishida, T., Honda, K., Kawahara, Y.: Formal Concepts in Dedekind Categories. In: Berghammer, R., Möller, B., Struth, G. (eds.) RelMiCS/AKA 2008. LNCS, vol. 4988, pp. 221–233. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ishida, T., Honda, K., Kawahara, Y. (2009). Armstrong’s Inference Rules in Dedekind Categories. In: Berghammer, R., Jaoua, A.M., Möller, B. (eds) Relations and Kleene Algebra in Computer Science. RelMiCS 2009. Lecture Notes in Computer Science, vol 5827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04639-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04639-1_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04638-4

  • Online ISBN: 978-3-642-04639-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics