Fork Algebras in Usual and in Non-Well-Founded Set Theories1 Part I
Ildik¶oSain Istv¶anN¶emeti FORK ALGEBRAS IN USUAL AND IN NON-WELL-FOUNDED SET THEORIES1 PART I Due to their high expressive power and applicability in computer sci- ence, fork algebras have intensively been studied lately. In particular, they have been fruitfully applied e.g. in the theory of programming (speci¯ca- tion, semantics etc.). The literature of fork algebras has been alive and active for at least ¯ve years by now. Some references are: [34], [35], [18], [36], [10], [11], [14], [8], [9], [15], [16] and [17]. Analogously to the situation with Boolean algebras, groups, semi- groups, polyadic algebras etc., it is considered desirable to develop a rep- resentation theory for fork algebras, too (cf. e.g. [14, [10]). This would consist of ² de¯ning a \concrete" class of, say, \set (or proper) fork algebras" (analogously to Boolean set algebras, transformation semigroups, polyadic set algebras), and ² an axiomatic class FA, de¯ned by ¯nitely many equations (or perhaps quasi-equations), of \abstract fork algebras"; and then ² a \representation" theorem stating that every member of FA is iso- morphic to a set fork algebra. Here, among others, we look at various possible choices for the con- crete class that could play the r^oleof set or proper fork algebras in such a representation theorem. Some of the candidate classes for this r^olewere investigated in [26], [29], [23]. In [26], [29] and [23], the following results were proved in usual set theory (ZFC). The equational theory Eq(TPA) of True Pairing Algebras (TPA's) and the equational theory Eq(SFA) of Proper (or Set) Fork Alge- 1 bras (SFA's) are not recursively enumerable, moreover, they both are ¦1- hard.
[Show full text]