Skip to main content
SpringerLink
Log in

An effectively given initial semigroup

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The notion of effectively given domains is extended to semigroups. We show that the initial algebra for the semigroups with finite generators is effectively given. The initial algebra we describe uses expressions and trees of symbols of generators and the partial order in the algebra is defined using a formal system on expressions. The main body of the paper lies in the demonstration of the decidability of this formal system.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adámek, J., Nelson, E., Reterman, J.: Tree Constructions of Free Continuous Algebras. J. Comput. Syst. Sci. 24, 114–146 (1982)

    Article  MathSciNet  Google Scholar 

  2. Bloom, S.L.: Varieties of Ordered Algebras. J. Comput. Syst. Sci. 13, 200–212 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  3. Engelfriet, J.: Bottom-up and Top-down Tree Transformations-A Comparison. Math. Syst. Theory 9, 193–231 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  4. Goguen, J.A., Thatcher, J.A., Wagner, E.G., Wright, J.B.: Initial Algebra Semantics and Continuous Algebras. J. Assoc. Comput. Mach. 24, 68–95 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kamimura, T., Tang, A.: Algebraic Relations and Presentations. Theor. Comput. Sci. 27, 39–60 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kamimura, T., Tang, A.: Effectively Given Spaces. Theor. Comput. Sci. 29, 155–166 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kanda, A.: Effective Solutions of Recursive Domain Equations. Ph.D. Thesis, Warwick University 1980

  8. Lehmann, D.J.: On the Algebra of Order. Proc. 19th Symp. Found. Comput. Sci. pp. 214–220. IEEE Computer Society 1978

  9. Meseguer, J.: On the Order-Complete Universal Algebra and Enriched Functorial Semantics. Lect. Notes Comput. Sci. 56, 294–301 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  10. Scott, D.: Data Types as Lattices. SIAM J. Comput. 5, 522–587 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  11. Scott, D.: Lecture on a mathematical theory of computation. Oxford University Comput. Laboratory, Technical monograph PRG-19, 1981

  12. Smyth, M.: Effectively Given Domains. Theor. Comput. Sci. 5, 257–274 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  13. Takeuti, G.: Proof Theory. Amsterdam: North-Holland 1975

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Kansas, 66045, Lawrence, KS, USA

    Tsutomu Kamimura

Authors
  1. Tsutomu Kamimura
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by University of Kansas General Research allocation 3530-20-0038

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kamimura, T. An effectively given initial semigroup. Acta Informatica 22, 203–227 (1985). https://doi.org/10.1007/BF00264231

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00264231

Keywords

Search

Navigation