Skip to main content
SpringerLink
Log in

A First-Order Calculus for Allegories

  • Conference paper
Relational and Algebraic Methods in Computer Science (RAMICS 2011)

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

Abstract

In this paper we present a language and first-order calculus for formal reasoning about relations based on the theory of allegories. Since allegories are categories, the language is typed in Church-style. We show soundness and completeness of the calculus and demonstrate its usability by presenting the RelAPS system; a proof assistant for relational categories based on the calculus presented here.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aameri, B.: Extending RelAPS to First-Order Logic. MSc. Thesis, Brock University (2010)

    Google Scholar 

  2. Asperti, A., Longo, G.: Categories, Types, and Structures. Foundation of Computing Series. MIT Press, Cambridge (1991)

    MATH  Google Scholar 

  3. Berghammer, R., Hattensperger, C., Schmidt, G.: RALF:A Relation Algebraic Formula manipulation system and proof checker. In: Nivat, M., Rattray, C., Rus, T., Scollo, G. (eds.) Proc. 3rd Conference on Algebraic Methodology and Software Technology, Workshops in Computing, pp. 407–408. Springer, Heidelberg (1994)

    Google Scholar 

  4. Bird, R., de Moor, O.: Algebra of Programming. Prentice-Hall, Englewood Cliffs (1997)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  6. Gentzen, G.: Untersuchungen über das logische Schließen I. Mathematische Zeitschrift 39(2), 176–210 (1934)

    MathSciNet  MATH  Google Scholar 

  7. Glanfield J.: RelAPS: A Proof System for Relational Categories. Presented at RelMICS/AKA: Relations and Kleene Algebra in Computer Science. Manchester, UK. August (2006).

    Google Scholar 

  8. Glanfield, J.: Towards Automated Derivation in the Theory of Allegories. MSc. Thesis, Brock University (2008)

    Google Scholar 

  9. Gutiérrez, C.: The Arithmetic and Geometry of Allegories - normal forms and complexity of a fragment of the theory of relations. PhD thesis, Wesleyan University (1999)

    Google Scholar 

  10. Johnstone, P.T.: Sketches of an Elephant, A Topos Theory Compendium, vol. 1, p. 42. Oxford Logic Guides (2002)

    Google Scholar 

  11. Kahl, W.: Refactoring Heterogeneous Relation Algebras around Ordered Categories and Converse. J. Rel. Meth. Comp. Sci. (JoRMiCS) 1, 277–313 (2004)

    Google Scholar 

  12. Kozen, D., Kreitz, C., Richter, E.: Automating Proofs in Category Theory. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 392–407. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  13. McCune, W.: Prover9: Automated Theorem Prover for First Order and Equational Logic, http://www.cs.unm.edu/~mccune/prover9

  14. Oheim, D.V., Gritzner, T.F.: RALL: Machine Supported Proofs for Relation Algebra. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249, pp. 380–394. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  15. Olivier, J.P., Sarrato, D.: Catégories de Dedekind. Morphismes Dans Les Categories de Schröder. C. R. Acad. Sci. Paris 290, 939–941 (1980)

    Google Scholar 

  16. Schmidt, G., Ströhlein, T.: Relationen und Graphen. Springer, Heidelberg (1989); English version: Relations and Graphs. Discrete Mathematics for Computer Scientists. EATCS Monographs on Theoret. Comput. Sci. Springer, Heidelberg (1989)

    Google Scholar 

  17. Schmidt, G., Hattensperger, C., Winter, M.: Heterogeneous Relation Algebras. In: Brink, C., Kahl, W., Schmidt, G. (eds.) Relational Methods in Computer Science, Advances in Computing Science, pp. 39–53. Springer, Vienna (1997)

    Chapter  Google Scholar 

  18. Schmidt, G.: Relational Mathematics. Cambridge University Press (2010), Cambridge (2010)

    Book  MATH  Google Scholar 

  19. Winter, M.: A new algebraic approach to L-fuzzy relations convenient to study crispness. Information Science 139, 233–252 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  20. Winter, M.: Goguen categories. A categorical approach to L-fuzzy relations. Trend in Logic 25 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, Toronto, Ontario, Canada, M5S 3G8

    Bahar Aameri

  2. Department of Computer Science, Brock University, St. Catharines, Ontario, Canada, L2S 3A1

    Michael Winter

Authors
  1. Bahar Aameri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Winter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Philosophy, Tilburg University, P.O. Box 90153, 5000, Tilburg, LE, The Netherlands

    Harrie de Swart

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aameri, B., Winter, M. (2011). A First-Order Calculus for Allegories. In: de Swart, H. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2011. Lecture Notes in Computer Science, vol 6663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21070-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21070-9_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21069-3

  • Online ISBN: 978-3-642-21070-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation