论文信息 - A Finite Axiomatization for Fork Algebras

A Finite Axiomatization for Fork Algebras

Proper fork algebras are algebras of binary relations over a structured set. The underlying set has changed from a set of pairs to a set closed under an injective function. In this paper we present a representation theorem for their abstract counterpart, that entails that proper fork algebras — whose underlying set is closed under an injective function — constitute a finitely based variety.1

Marcelo F. Frias | Paulo A. S. Veloso | Armando Martin Haeberer

[1] Gunther Schmidt,et al. Comparing Two Different Approaches to Products in Abstract Relation Algebra , 1993, AMAST.

[2] Alfred Tarski,et al. Relational selves as self-affirmational resources , 2008 .

[3] Viktor Gyuris. A Short Proof of Representability of Fork Algebras , 1995, Log. J. IGPL.

[4] András Simon,et al. Complexity of equational theory of relational algebras with projection elements , 1992 .

[5] Marcelo F. Frias,et al. From Specifications to Programs: A Fork-Algebraic Approach to Bridge the Gap , 1996, MFCS.

[6] Roger D. Maddux. Finitary Algebraic Logic , 1989, Math. Log. Q..

[7] A. Tarski,et al. A Formalization Of Set Theory Without Variables , 1987 .

[8] Gunther Schmidt,et al. Relations and Graphs , 1993, EATCS Monographs on Theoretical Computer Science.

[9] Alfred Tarski,et al. Distributive and Modular Laws in the Arithmetic of Relation Algebras , 1953 .

[10] Gunther Schmidt,et al. On the Smooth Calculation of Relational Recursive Expressions out of First-Order Non-Constructive Specifications Involving Quantifiers , 1993, Formal Methods in Programming and Their Applications.

[11] E. C. Capen. A referee's report , 1978, IEEE Transactions on Professional Communication.

[12] Silvia E. Gordillo,et al. Semantic Optimization of Queries in Deductive Object-Oriented Database , 1995, ADBIS.

[13] Paulo A. S. Veloso,et al. A finitary relational algebra for classical first-order logic , 1991 .