A NOTE ON COMPLETELY PRIME IDEALS OF ORE EXTENSIONS

Previous Up Next Article

Citations

From References: 3From Reviews: 0

MR2589423 (2010i:20085)20M20 (08A70)

Jackson, Marcel(5-LTRB); Stokes, Tim(NZ-WAIK)Semigroups with if-then-else and halting programs. (English summary)Internat. J. Algebra Comput.19 (2009),no. 7,937–961.

Summary: “The ‘if-then-else’ construction is one of the most elementary programming commands,and its abstract laws have been widely studied, starting with McCarthy. Possibly the most obviousextension of this is to include the operation of composition of programs, which gives a semigroupof functions (total, partial, or possibly general binary relations) that can be recombined using if-then-else. We show that this particular extension admits no finite complete axiomatization andinstead focus on the case where composition of functions with predicates is also allowed (andwe argue there is good reason to take this approach). In the case of total functions—modelinghalting programs—we give a complete axiomatization for the theory in terms of a finite system ofequations. We obtain a similar result when an operation of equality test and/or fixed point test isincluded.”

References

1. G. M. Bergman, Actions of Boolean rings on sets,Algebra Univers.28 (1991) 153–187.MR1106053 (92g:06021)

2. S. L. Bloom and R. Tindell, Varieties of ”if–then–else”,SIAM J. Comput.12 (1983) 677–707.MR0721007 (85f:68058)

3. M. R. Bulmer, D. Fearnley-Sander and T. Stokes, Towards a calculus of algorithms,Bull.Austral. Math. Soc.50 (1994) 81–89.MR1285662 (95i:08004)

4. E. W. Dijkstra, Guarded commands, nondeterminacy and formal derivation of programs,Comm. ACM18 (1975) 453–457.MR0383808 (52 #4688)

5. I. Guessarian and J. Meseguer, On the axiomatization of ”if–then–else”,SIAM J. Comput.16(1987) 332–357.MR0882535 (89f:68043)

6. C. A. R. Hoare, An axiomatic basis for computer programming,Comm. Assoc. Comput. Mach.12 (1969) 576–580.

7. M. Jackson and T. Stokes, Agreeable semigroups,J. Algebra266(2003) 393–417.MR1995121(2004f:20100)

8. M. Jackson and T. Stokes, Identities in the algebra of partial maps,Internat. J. Algebra Comput.16 (2006) 1131–1159.MR2286426 (2007j:08001)

9. M. Jackson and T. Stokes, Towards an algebra of functions and deterministic computation,submitted.

10. M. Jackson and T. Stokes, Algebras of partial maps, to appear inProc. Special Interest Meetingon Semigroups and Related Mathematics,University of Sydney (2005).

11. A. V. Kelarev and T. Stokes, Interior algebras and varieties,J. Algebra221 (1999) 50–59.MR1722903 (2001b:06024)

12. D. C. Kozen, On Hoare logic and Kleene algebra with tests,ACM Trans. Comput. Logic1(2000) 60–76.MR1858822 (2002j:68053)

13. B. Moller and G. Struth, Algebras of modal operators and partial correctness,Theoret. Comp.Sci.351(2006) 221–239.MR2200402 (2006j:68067)

14. E. G. Manes, Adas and the equational theory of if–then–else,Algebra Univers.30 (1993)373–394.MR1225878 (94d:08006)

15. J. McCarthy, A basis for a mathematical theory of computation, inComputer Programmingand Formal Systems,eds. P. Braffort and D. Hirschberg, (North-Holland, 1963), pp. 33–70.MR0148258 (26 #5766)

16. A. H. Meklar and E. M. Nelson, Equational bases for if–then–else,SIAM J. Comput.16 (1987)465–485.MR0889403 (88g:08004)

17. D. Pigozzi, Equality-test and if–then–else algebras: Axiomatization and specification,SIAM J.Comput.20 (1991) 766–805.MR1105937 (92i:68104)

18. V. R. Pratt, Dynamic algebras: Examples, constructions, applications, Technical ReportMIT/LCS/TM-138, M.I.T. Laboratory for Computer Science, July (1979).

19. B. M. Schein, Relation algebras and function semigroups,Semigroup Forum1 (1970) 1–62.MR0285638 (44 #2856)

20. B. M. Schein, Lectures on semigroups of transformations,Amer. Math. Soc. Translat. Ser. 2.113(1979) 123–181.

21. T. Stokes, Sets withB-action and linear algebra,Algebra Univ.39 (1998) 31–43.MR1633332(2000a:06063)

22. T. Stokes, On Eq-monoids,Acta Sci. Math. (Szeged)72 (2006) 481–506.MR2289749(2007i:06022)

Note: This list reflects references listed in the original paper as accurately as possible with noattempt to correct errors.

c© Copyright American Mathematical Society 2010, 2012