Skip to main content
Have a personal or library account? Click to login
Free Term Algebras Cover

Free Term Algebras

Formalized Mathematics
Volume 20 (2012): Issue 3 (September 2012)
By:   
Open Access
|Feb 2013
References

References

  1. [1] Grzegorz Bancerek. Cardinal numbers., 1():377-382, 1990.
    Search in Google Scholar
  2. [2] Grzegorz Bancerek. Introduction to trees., 1():421-427, 1990.
    Search in Google Scholar
  3. [3] Grzegorz Bancerek. K¨onig’s theorem., 1():589-593, 1990.
    Search in Google Scholar
  4. [4] Grzegorz Bancerek. The ordinal numbers., 1():91-96, 1990.
    Search in Google Scholar
  5. [5] Grzegorz Bancerek. Cartesian product of functions., 2():547-552, 1991.
    Search in Google Scholar
  6. [6] Grzegorz Bancerek. K¨onig’s lemma., 2():397-402, 1991.
    Search in Google Scholar
  7. [7] Grzegorz Bancerek. Sets and functions of trees and joining operations of trees., 3():195-204, 1992.
    Search in Google Scholar
  8. [8] Grzegorz Bancerek. Joining of decorated trees., 4():77-82, 1993.
    Search in Google Scholar
  9. [9] Grzegorz Bancerek. Reduction relations., 5():469-478, 1996.
    Search in Google Scholar
  10. [10] Grzegorz Bancerek. Subtrees., 5():185-190, 1996.
    Search in Google Scholar
  11. [11] Grzegorz Bancerek. Terms over many sorted universal algebra., 5():191-198, 1996.
    Search in Google Scholar
  12. [12] Grzegorz Bancerek. Translations, endomorphisms, and stable equational theories., 5():553-564, 1996.
    Search in Google Scholar
  13. [13] Grzegorz Bancerek. Algebra of morphisms., 6():303-310, 1997.
    Search in Google Scholar
  14. [14] Grzegorz Bancerek. Institution of many sorted algebras. Part I: Signature reduct of an algebra., 6():279-287, 1997.
    Search in Google Scholar
  15. [15] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences., 1():107-114, 1990.[16] Grzegorz Bancerek and Artur Korniłowicz. Yet another construction of free algebra., 9():779-785, 2001.
    Search in Google Scholar
  16. [17] Grzegorz Bancerek and Piotr Rudnicki. On defining functions on trees., 4():91-101, 1993.
    Search in Google Scholar
  17. [18] Grzegorz Bancerek and Piotr Rudnicki. The set of primitive recursive functions., 9():705-720, 2001.
    Search in Google Scholar
  18. [19] Grzegorz Bancerek and Andrzej Trybulec. Miscellaneous facts about functions., 5():485-492, 1996.
    Search in Google Scholar
  19. [20] Ewa Burakowska. Subalgebras of many sorted algebra. Lattice of subalgebras., 5():47-54, 1996.
    Search in Google Scholar
  20. [21] Czesław Bylinski. Functions and their basic properties., 1():55-65, 1990.
    Search in Google Scholar
  21. [22] Czesław Bylinski. Functions from a set to a set., 1():153-164, 1990.
    Search in Google Scholar
  22. [23] Czesław Bylinski. Partial functions., 1():357-367, 1990.
    Search in Google Scholar
  23. [24] Czesław Bylinski. Some basic properties of sets., 1():47-53, 1990.
    Search in Google Scholar
  24. [25] Agata Darmochwał. Finite sets., 1():165-167, 1990.
    Search in Google Scholar
  25. [26] Artur Korniłowicz. Some basic properties of many sorted sets., 5():395-399, 1996.
    Search in Google Scholar
  26. [27] Artur Korniłowicz. Equations in many sorted algebras., 6():363-369, 1997.
    Search in Google Scholar
  27. [28] Małgorzata Korolkiewicz. Homomorphisms of many sorted algebras., 5():61-65, 1996.
    Search in Google Scholar
  28. [29] Małgorzata Korolkiewicz. Many sorted quotient algebra., 5():79-84, 1996.
    Search in Google Scholar
  29. [30] Jarosław Kotowicz. Functions and finite sequences of real numbers., 3():275-278, 1992.
    Search in Google Scholar
  30. [31] Adam Naumowicz. On Segre’s product of partial line spaces., 9():383-390, 2001.
    Search in Google Scholar
  31. [32] Andrzej Nedzusiak. Probability., 1():745-749, 1990.
    Search in Google Scholar
  32. [33] Beata Padlewska. Families of sets., 1():147-152, 1990.
    Search in Google Scholar
  33. [34] Beata Perkowska. Free many sorted universal algebra., 5():67-74, 1996.
    Search in Google Scholar
  34. [35] D.M. Gabbay S. Abramsky and T.S.E. Maibaum, editors., chapter Term Rewriting Systems, pages 1-116. Oxford University Press, New York, 1992. http://www.informatik.uni-bremen.de/agbkb/lehre/-rbs/texte/Klop-TR.pdf.
    Search in Google Scholar
  35. [36] Andrzej Trybulec. Binary operations applied to functions., 1():329-334, 1990.
    Search in Google Scholar
  36. [37] Andrzej Trybulec. Many sorted sets., 4():15-22, 1993.
    Search in Google Scholar
  37. [38] Andrzej Trybulec. Many sorted algebras., 5():37-42, 1996.
    Search in Google Scholar
  38. [39] Andrzej Trybulec. A scheme for extensions of homomorphisms of many sorted algebras., 5():205-209, 1996.
    Search in Google Scholar
  39. [40] Zinaida Trybulec. Properties of subsets., 1():67-71, 1990.
    Search in Google Scholar
  40. [41] Edmund Woronowicz. Many argument relations., 1():733-737, 1990.
    Search in Google Scholar
  41. [42] Edmund Woronowicz. Relations and their basic properties., 1():73-83, 1990.
    Search in Google Scholar
  42. [43] Edmund Woronowicz and Anna Zalewska. Properties of binary relations., 1():85-89, 1990.
    Search in Google Scholar
DOI: https://doi.org/10.2478/v10037-012-0029-6 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 239 - 256
Published on: Feb 2, 2013
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Related subjects:
Computer sciences,
Artificial intelligence,
Computer sciences, other,
Mathematics,
Logic and set theory,
General mathematics

© 2013 Grzegorz Bancerek, published by University of Białystok
This work is licensed under the Creative Commons License.

Volume 20 (2012): Issue 3 (September 2012)
Previous article