{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T09:03:51Z","timestamp":1774602231077,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319247038","type":"print"},{"value":"9783319247045","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24704-5_9","type":"book-chapter","created":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T05:31:29Z","timestamp":1443072689000},"page":"136-150","source":"Crossref","is-referenced-by-count":1,"title":["Generalised N-ary Relations and Allegories"],"prefix":"10.1007","author":[{"given":"Bartosz","family":"Zieli\u0144ski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,8]]},"reference":[{"key":"9_CR1","unstructured":"Data Mining Extensions (DMX) Reference, https:\/\/msdn.microsoft.com\/en-us\/library\/ms132058.aspx"},{"key":"9_CR2","unstructured":"Barr, M., Wells, C.: Category theory for computing science. Prentice-Hall International Series in Computer Science. Prentice Hall (1995)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Berghammer, R., Haeberer, A., Schmidt, G., Veloso, P.: Comparing two different approaches to products in abstract relation algebra. In: Algebraic Methodology and Software Technology (AMAST 1993), pp. 167\u2013176. Springer (1994)","DOI":"10.1007\/978-1-4471-3227-1_16"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Brown, C., Hutton, G.: Categories, allegories and circuit design. In: Proceedings of the Symposium on Logic in Computer Science, LICS 1994, pp. 372\u2013381. IEEE (1994)","DOI":"10.1109\/LICS.1994.316052"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/3-540-58140-5_7","volume-title":"Logical Foundations of Computer Science","author":"C. Brown","year":"1994","unstructured":"Brown, C., Jeffrey, A.: Allegories of circuits. In: Matiyasevich, Y.V., Nerode, A. (eds.) LFCS 1994. LNCS, vol.\u00a0813, pp. 56\u201368. Springer, Heidelberg (1994)"},{"issue":"6","key":"9_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/362384.362685","volume":"13","author":"E.F. Codd","year":"1970","unstructured":"Codd, E.F.: A relational model of data for large shared data banks. Commun. ACM\u00a013(6), 377\u2013387 (1970), http:\/\/doi.acm.org\/10.1145\/362384.362685","journal-title":"Commun. ACM"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Davey, B., Priestley, H.: Introduction to Lattices and Order. Cambridge mathematical text books. Cambridge University Press (2002)","DOI":"10.1017\/CBO9780511809088"},{"key":"9_CR8","unstructured":"Desharnais, J.: Monomorphic characterization of n-ary direct products. Inf. Sci.\u00a0119(3-4), 275\u2013288 (1999), http:\/\/dx.doi.org\/10.1016\/S0020-02559900020-1"},{"key":"9_CR9","unstructured":"Freyd, P., Scedrov, A.: Categories, Allegories. North-Holland Mathematical Library. Elsevier Science (1990)"},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10817-006-9062-x","volume":"37","author":"S. Givant","year":"2006","unstructured":"Givant, S.: The calculus of relations as a foundation for mathematics. Journal of Automated Reasoning\u00a037(4), 277\u2013322 (2006), http:\/\/dx.doi.org\/10.1007\/s10817-006-9062-x","journal-title":"Journal of Automated Reasoning"},{"key":"9_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-77968-8","volume-title":"Relations and graphs","author":"G. Schmidt","year":"1993","unstructured":"Schmidt, G., Str\u00f6hlein, T.: Relations and graphs. Springer, Heidelberg (1993)"},{"key":"9_CR12","unstructured":"Schmidt, G., Winter, M.: Relational mathematics continued. arXiv:1403.6957 (2014)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Tarski, A., Givant, S.R.: A formalization of set theory without variables, vol.\u00a041. American Mathematical Soc. (1987)","DOI":"10.1090\/coll\/041"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.jlap.2007.10.003","volume":"76","author":"M. Winter","year":"2008","unstructured":"Winter, M.: Products in categories of relations. The Journal of Logic and Algebraic Programming\u00a076(1), 145\u2013159 (2008)","journal-title":"The Journal of Logic and Algebraic Programming"},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"342","DOI":"10.3390\/axioms3040342","volume":"3","author":"B. Zieli\u0144ski","year":"2014","unstructured":"Zieli\u0144ski, B., Ma\u015blanka, P.: Weak n-ary relational products in allegories. Axioms\u00a03(4), 342\u2013357 (2014)","journal-title":"Axioms"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-41366-7_24","volume-title":"Model and Data Engineering","author":"B. Zieli\u0144ski","year":"2013","unstructured":"Zieli\u0144ski, B., Ma\u015blanka, P., Sobieski, \u015a.: Allegories for database modeling. In: Cuzzocrea, A., Maabout, S. (eds.) MEDI 2013. LNCS, vol.\u00a08216, pp. 278\u2013289. Springer, Heidelberg (2013), http:\/\/dx.doi.org\/10.1007\/978-3-642-41366-7_24"},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"260","DOI":"10.3390\/axioms3020260","volume":"3","author":"B. Zieli\u0144ski","year":"2014","unstructured":"Zieli\u0144ski, B., Ma\u015blanka, P., Sobieski, \u015a.: Modalities for an allegorical conceptual data model. Axioms\u00a03(2), 260\u2013279 (2014), http:\/\/www.mdpi.com\/2075-1680\/3\/2\/260","journal-title":"Axioms"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24704-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T19:52:51Z","timestamp":1748634771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24704-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319247038","9783319247045"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24704-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}