{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:30:25Z","timestamp":1648866625059},"reference-count":41,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5737,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1016\/s0304-3975(96)00299-x","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"211-220","source":"Crossref","is-referenced-by-count":2,"title":["A short proof of representability of fork algebras"],"prefix":"10.1016","volume":"188","author":[{"given":"Viktor","family":"Gyuris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00299-X_BIB1","doi-asserted-by":"crossref","first-page":"671","DOI":"10.2307\/2000932","article-title":"On stone-type representation theorem for algebras of relations of higher rank","volume":"309","author":"Andr\u00e9ka","year":"1988","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(96)00299-X_BIB2","series-title":"Document 731-HKO-4, 47th Meeting of the IFIP Working Group 2.1 \u201cAlgorithmic Languages and Calculi\u201d","article-title":"From specifications to programs: a fork algebraic approach to bridge the gap","author":"Baum","year":"1995"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB3","first-page":"3","article-title":"On the representability of the \u25bd-abstract relational algebra","volume":"1","author":"Baum","year":"1992","journal-title":"J. IGPL"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB4","series-title":"Proc. 3rd Internat. Conf. on Algebraic Methodology and Software Technology, AMAST'93","first-page":"167","article-title":"Comparing the different approaches to products in abstract relation algebras","author":"Berghammer","year":"1993"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB5","series-title":"Proc. SOFSEM'94","article-title":"Natural specifications vs. abstract specifications. A relational approach","author":"Frias","year":"1994"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB6","series-title":"Proc. XIX Latinamerican Conf. on Informatics","first-page":"529","article-title":"Development of graph algorithms with fork algebras","author":"Frias","year":"1993"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB7","article-title":"A representation theorem for fork algebras","author":"Frias","year":"1993","journal-title":"Research report of Pontificia Universidade Cat\u00f3lico do Rio de Janeiro MCC 29"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB8","first-page":"64","article-title":"Fork algebras are representable","volume":"24","author":"Frias","year":"1995","journal-title":"Bull. Section Logic"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB9","series-title":"Proc. Winter Meeting of the ASL","article-title":"On the metalogical properties of fork algebras","author":"Frias","year":"1995"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB10_1","series-title":"Proc. Logic Coll.'94","first-page":"51","article-title":"Representability of fork algebras","author":"Frias","year":"1994"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB10_2","first-page":"234","volume":"1","author":"Frias","year":"1995","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB11","doi-asserted-by":"crossref","DOI":"10.1090\/conm\/156","article-title":"The structure of relation algebras generated by relativizations","volume":"156","author":"Givant","year":"1994","journal-title":"Amer. Math. Soc. Contemporary Math."},{"key":"10.1016\/S0304-3975(96)00299-X_BIB12","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1093\/jigpal\/3.5.791","article-title":"A short proof of representability of fork algebras","volume":"3","author":"Gyuris","year":"1995","journal-title":"J. IGPL"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB13","series-title":"Proc. Internat. Conf. on Formal Methods in Programming and their Application","first-page":"281","article-title":"On the smooth calculation of relational recursive expressions out of first-order non-constructive specifications involving quantifiers","volume":"Vol. 735","author":"Haeberer","year":"1993"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB14","series-title":"Constructing Programs for Specifications \u2014Proc. IFIP TC2, North-Holland","first-page":"319","article-title":"Partial relations for program derivation: adequacy, inevitability and expressiveness","author":"Haeberer","year":"1991"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB15","series-title":"Cylindric Algebras Part I","author":"Henkin","year":"1971"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB16","series-title":"Cylindric Algebras Part II","author":"Henkin","year":"1985"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB17","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/BF02485385","article-title":"Some sufficient conditions for the representability of relation algebras","volume":"8","author":"Maddux","year":"1978","journal-title":"Algebra Universalis"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB18","first-page":"103","article-title":"Complexity of equational theory of relation algebras with projection elements","volume":"21","author":"Mikul\u00e1s","year":"1992","journal-title":"Bull. Section Logic"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB19","article-title":"Strong representability of fork algebras, a set theoretic foundation","volume":"4","author":"N\u00e9meti","year":"1996","journal-title":"J. IGPL"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB20","first-page":"29","article-title":"Ontology can turn negative results to positive","volume":"25","author":"N\u00e9meti","year":"1996","journal-title":"Bull. Section Logic"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB21","article-title":"Simple, finitizable extensions of first-order logic in some non-well-founded set theories","author":"N\u00e9meti","year":"1994","journal-title":"Tech. Report, Math. Inst. Hungarian Academy of Sciences"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB22_1","article-title":"Algebraizations of quantifier logics, an introductory overview","author":"N\u00e9meti","year":"1995","journal-title":"Tech. Report, Math. Inst. Hungarian Academy of Sciences"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB22_2","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF00370684","volume":"50","author":"N\u00e9meti","year":"1991","journal-title":"Studia Logica"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB23","series-title":"Weakly higher order cylindric algebras and finite schema axiomatization of the representables","author":"N\u00e9meti","year":"1995"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB24_1","unstructured":"I. Sain, On the search for a finitizable algebraization of first order logic (shortened version a), Tech. Report, Math. Inst. Hungarian Academy of Sciences, Budapest."},{"key":"10.1016\/S0304-3975(96)00299-X_BIB24_2","series-title":"Logic Colloquium'92","article-title":"On the problem of finitizing first order logic and its algebraic counterpart (a survey of results and methods)","author":"Sain","year":"1995"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB25","article-title":"Finite schematizable algebraic logic","author":"Sain","year":"1995","journal-title":"Tech. Report, Math. Inst. Hungarian Academy of Sciences"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB26_1","article-title":"Fork algebras in usual as well as in non-well-founded set theories","author":"Sain","year":"1994","journal-title":"Tech. Report, Math. Inst. Hungarian Academy of Sciences"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB26_2","series-title":"Relational Methods in Computer Science","first-page":"17","year":"1994"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB26_3","volume":"24","year":"1995","journal-title":"Bull. Section Logic"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB27","article-title":"The complexity of equational theory of relational algebras with projection elements","author":"Sain","year":"1991","journal-title":"Tech. Report, Math. Inst. Hungarian Academy of Sciences"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB28","article-title":"What the Finitization problem is Not","volume":"Vol. 28","author":"Simon","year":"1993"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB29","series-title":"A simple, cylindric algebraic proof for the representability of quasi-projective relation algebras","author":"Simon","year":"1995"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB30","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2307\/2268577","article-title":"On the calculus of relations","volume":"6","author":"Tarski","year":"1941","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB31","article-title":"Some metalogical results concerning the calculus of relations","volume":"18","author":"Tarski","year":"1953","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB32","article-title":"A formalization of set theory without variables","volume":"Vol. 41","author":"Tarski","year":"1988"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB33","first-page":"52","article-title":"A finitary relational algebra for first order logic","volume":"20","author":"Veloso","year":"1991","journal-title":"Bull. Section Logic (Warsaw-L\u00f3dz)"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB34","series-title":"Methodology and Philosophy of Science, 9th Internat. Congress on Logic","article-title":"A new algebra of first order logic","author":"Veloso","year":"1991"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB35","article-title":"Fork algebras as algebras of logic","author":"Veloso","year":"1994"},{"key":"10.1016\/S0304-3975(96)00299-X_BIB36","unstructured":"Bull. Section Logic, to appear."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759600299X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759600299X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:26:02Z","timestamp":1556508362000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759600299X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":41,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S030439759600299X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00299-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}