A short proof of representability of fork algebras

Theoretical Computer Science

Volumn 188, Issue 1-2, 1997, Pages 211-220

  Gyuris, Viktor ^a  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

THEOREM PROVING;

FORK ALGEBRAS; QUASI PROJECTIVE RELATION ALGEBRAS;

ALGEBRA;

EID: 0031273809     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00299-X     Document Type: Article

References (40)

1. H. Andréka and R.J. Thompson, On stone-type representation theorem for algebras of relations of higher rank, Trans. Amer. Math. Soc. 309 (1988) 671-682.
2. G.A. Baum, M.F. Frias, A.M. Haeberer and P.E.M. López, From specifications to programs: a fork algebraic approach to bridge the gap, Document 731-HKO-4, 47th Meeting of the IFIP Working Group 2.1 "Algorithmic Languages and Calculi"; Hong Kong, January 1995.
3. G.A. Baum, A.M. Haeberer and P.A.S. Veloso, On the representability of the ▽-abstract relational algebra, J. IGPL 1 (1992) 3-4.
4. R. Berghammer, A.M. Haeberer, G. Schmidt and F.A.S. Veloso, Comparing the different approaches to products in abstract relation algebras, in: Proc. 3rd Internat. Conf. on Algebraic Methodology and Software Technology, AMAST'93 (Springer, Berlin, 1993) 167-176.
5. M.F. Frias and N.G. Aguayo, Natural specifications vs. abstract specifications. A relational approach, in: Proc. SOFSEM'94, Milovy, Czech Republic, November 1994.
6. M.F. Frias, N.G. Aguayo and B. Novak, Development of graph algorithms with fork algebras, in: Proc. XIX Latinamerican Conf. on Informatics (1993) 529-554.
7. M.F. Frias, G.A. Baum, A.M. Haeberer and P.A.S. Veloso, A representation theorem for fork algebras, Research report of Pontifícia Universidade Católico do Rio de Janeiro MCC 29, 1993
8. M.F. Frias, G.A. Baum, A.M. Haeberer and P.A.S. Veloso, Fork algebras are representable, Bull. Section Logic 24 (1995) 64-75.
9. M.F. Frias, A.M. Haeberer and P.A.S. Veloso, On the metalogical properties of fork algebras, in: Proc. Winter Meeting of the ASL, San Francisco, CA, January 1995, to appear.
10. M.F. Frias, A.M. Haeberer, F.A.S. Veloso and G.A. Baum, Representability of fork algebras, in: Proc. Logic Coll.'94 (1994) 51. Also in J. Symbolic Logic 1 (1995) 234.
11. M.F. Frias, A.M. Haeberer, F.A.S. Veloso and G.A. Baum, Representability of fork algebras, in: Proc. Logic Coll.'94 (1994) 51. Also in J. Symbolic Logic 1 (1995) 234.
12. S.R. Givant, The structure of relation algebras generated by relativizations, Amer. Math. Soc. Contemporary Math. 156 (1994).
13. V. Gyuris, A short proof of representability of fork algebras, J. IGPL 3 (1995) 791-796.
14. A.M. Haeberer, G.A. Baum and G. Schmidt, On the smooth calculation of relational recursive expressions out of first-order non-constructive specifications involving quantifiers, in: Proc. Internat. Conf. on Formal Methods in Programming and their Application, Lecture Notes in Computer Science, Vol. 735 (Springer, Berlin, 1993) 281-298.
15. A.M. Haeberer and P.A.S. Veloso, Partial relations for program derivation: adequacy, inevitability and expressiveness, in: B. Müller, ed., Constructing Programs for Specifications - Proc. IFIP TC2, North-Holland, IFIP WG 2.1 (1991) 319-371.
16. L. Henkin, J.D. Monk and A. Tarski, Cylindric Algebras Part I (North-Holland, Amsterdam 1971).
17. L. Henkin, J.D. Monk and A. Tarski, Cylindric Algebras Part II (North-Holland, Amsterdam, 1985).
18. R. Maddux, Some sufficient conditions for the representability of relation algebras, Algebra Universalis 8 (1978) 162-172.
19. Sz. Mikulás, I. Sain and A. Simon, Complexity of equational theory of relation algebras with projection elements, Bull. Section Logic 21 (1992) 103-111.
20. I. Németi, Strong representability of fork algebras, a set theoretic foundation, J. IGPL 4 (1996), in press.
21. I. Németi, Ontology can turn negative results to positive, Bull. Section Logic 25 (1996) 29-40.
22. I. Németi, Simple, finitizable extensions of first-order logic in some non-well-founded set theories, Tech. Report, Math. Inst. Hungarian Academy of Sciences, Budapest, 1994, submitted.
23. I. Németi, Algebraizations of quantifier logics, an introductory overview, Tech. Report, Math. Inst. Hungarian Academy of Sciences, Budapest, 1995; shortened version in Studia Logica 50 (1991) 485-570.
24. I. Németi, Algebraizations of quantifier logics, an introductory overview, Tech. Report, Math. Inst. Hungarian Academy of Sciences, Budapest, 1995; shortened version in Studia Logica 50 (1991) 485-570.
25. I. Németi and A. Simon, Weakly higher order cylindric algebras and finite schema axiomatization of the representables, preprint, Math. Inst. Hungarian Academy of Sciences, Budapest, 1995.
26. 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. An extended abstract version of this is: On the problem of finitizing first order logic and its algebraic counterpart (a survey of results and methods). in: L. Csirmaz, D.M. Gabbay and M. de Rijke, eds., Logic Colloquium'92 (CSLI Publications, Stanford, CA, 1995).
27. I. Sain and V. Gyuris, Finite schematizable algebraic logic, Tech. Report, Math. Inst. Hungarian Academy of Sciences, Budapest, 1995.
28. I. Sain and I. Németi, Fork algebras in usual as well as in non-well-founded set theories, Tech. Report, Math. Inst. Hungarian Academy of Sciences, Budapest, 1994. Shortened version in: C. Brink and G. Schmidt, eds., Relational Methods in Computer Science, Dagstuhl Seminar Report No. 80 (1994) 17-19. Extended abstract in Bull. Section Logic 24 (1995).
29. I. Sain and I. Németi, Fork algebras in usual as well as in non-well-founded set theories, Tech. Report, Math. Inst. Hungarian Academy of Sciences, Budapest, 1994. Shortened version in: C. Brink and G. Schmidt, eds., Relational Methods in Computer Science, Dagstuhl Seminar Report No. 80 (1994) 17-19. Extended abstract in Bull. Section Logic 24 (1995).
30. I. Sain and I. Németi, Fork algebras in usual as well as in non-well-founded set theories, Tech. Report, Math. Inst. Hungarian Academy of Sciences, Budapest, 1994. Shortened version in: C. Brink and G. Schmidt, eds., Relational Methods in Computer Science, Dagstuhl Seminar Report No. 80 (1994) 17-19. Extended abstract in Bull. Section Logic 24 (1995).
31. I. Sain and A. Simon, The complexity of equational theory of relational algebras with projection elements, Tech. Report, Math. Inst. Hungarian Academy of Sciences, Budapest, 1991.
32. A. Simon, What the Finitization problem is Not, Banach Center Publications, Vol. 28 (Polish Academic Publishers, 1993).
33. A. Simon, A simple, cylindric algebraic proof for the representability of quasi-projective relation algebras, preprint, Math. Inst. Hungarian Academy of Sciences, Budapest, 1995.
34. A. Tarski, On the calculus of relations, J. Symbolic Logic 6 (1941) 73-89.
35. A. Tarski, Some metalogical results concerning the calculus of relations, J. Symbolic Logic 18 (1953).
36. A. Tarski and S. Givant, A formalization of set theory without variables. AMS Colloquium Publications, Vol. 41 (1988).
37. P.A.S. Veloso and A.M. Haeberer, A finitary relational algebra for first order logic, Bull. Section Logic (Warsaw-Lódz) 20 (1991) 52-62.
38. P.A.S. Veloso and A.M. Haeberer, A new algebra of first order logic, in: Methodology and Philosophy of Science, 9th Internat. Congress on Logic, Uppsala, Sweden, 1991.
39. P.A.S. Veloso, A.M. Haeberer and M.F. Frias, Fork algebras as algebras of logic, in: Proc. Logic Colloq.'94 (1994); Bull. Section Logic, to appear.
40. P.A.S. Veloso, A.M. Haeberer and M.F. Frias, Fork algebras as algebras of logic, in: Proc. Logic Colloq.'94 (1994); Bull. Section Logic, to appear.