Skip to main content
Have a personal or library account? Click to login
Program Algebra over an Algebra Cover

Program Algebra over an Algebra

Formalized Mathematics
Volume 20 (2012): Issue 4 (December 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. Algebra of morphisms., 6():303-310, 1997.
    Search in Google Scholar
  8. [8] Grzegorz Bancerek. Institution of many sorted algebras. Part I: Signature reduct of an algebra., 6():279-287, 1997.
    Search in Google Scholar
  9. [9] Grzegorz Bancerek. Mizar analysis of algorithms: Preliminaries., 15():87-110, 2007, doi:10.2478/v10037-007-0011-x.
    Open DOISearch in Google Scholar
  10. [10] Grzegorz Bancerek. Sorting by exchanging., 19():93-102, 2011, doi: 10.2478/v10037-011-0015-4.
    Open DOISearch in Google Scholar
  11. [11] Grzegorz Bancerek. Free term algebras., 20():239-256, 2012, doi: 10.2478/v10037-012-0029-6.
    Open DOISearch in Google Scholar
  12. [12] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences., 1():107-114, 1990.
    Search in Google Scholar
  13. [13] Grzegorz Bancerek and Piotr Rudnicki. The set of primitive recursive functions., 9():705-720, 2001.
    Search in Google Scholar
  14. [14] Grzegorz Bancerek and Andrzej Trybulec. Miscellaneous facts about functions., 5():485-492, 1996.
    Search in Google Scholar
  15. [15] Ewa Burakowska. Subalgebras of the universal algebra. Lattices of subalgebras., 4():23-27, 1993.
    Search in Google Scholar
  16. [16] Czesław Bylinski. Binary operations., 1():175-180, 1990.
    Search in Google Scholar
  17. [17] Czesław Bylinski. Finite sequences and tuples of elements of a non-empty sets., 1():529-536, 1990.
    Search in Google Scholar
  18. [18] Czesław Bylinski. Functions and their basic properties., 1():55-65, 1990.
    Search in Google Scholar
  19. [19] Czesław Bylinski. Functions from a set to a set., 1():153-164, 1990.
    Search in Google Scholar
  20. [20] Czesław Bylinski. The modification of a function by a function and the iteration of the composition of a function., 1():521-527, 1990.
    Search in Google Scholar
  21. [21] Czesław Bylinski. Partial functions., 1():357-367, 1990.
    Search in Google Scholar
  22. [22] Czesław Bylinski. Some basic properties of sets., 1():47-53, 1990.
    Search in Google Scholar
  23. [23] Agata Darmochwał. Finite sets., 1():165-167, 1990.
    Search in Google Scholar
  24. [24] Artur Korniłowicz. On the group of automorphisms of universal algebra & many sorted algebra., 5():221-226, 1996.
    Search in Google Scholar
  25. [25] Artur Korniłowicz and Marco Riccardi. The Borsuk-Ulam theorem., 20():105-112, 2012, doi: 10.2478/v10037-012-0014-0.
    Open DOISearch in Google Scholar
  26. [26] Małgorzata Korolkiewicz. Homomorphisms of many sorted algebras., 5():61-65, 1996.
    Search in Google Scholar
  27. [27] Jarosław Kotowicz, Beata Madras, and Małgorzata Korolkiewicz. Basic notation of universal algebra., 3():251-253, 1992.
    Search in Google Scholar
  28. [28] Yatsuka Nakamura and Grzegorz Bancerek. Combining of circuits., 5():283-295, 1996.
    Search in Google Scholar
  29. [29] Andrzej Nedzusiak. Probability., 1():745-749, 1990.
    Search in Google Scholar
  30. [30] Beata Perkowska. Free many sorted universal algebra., 5():67-74, 1996.
    Search in Google Scholar
  31. [31] Andrzej Trybulec. Binary operations applied to functions., 1():329-334, 1990.
    Search in Google Scholar
  32. [32] Andrzej Trybulec. Enumerated sets., 1():25-34, 1990.
    Search in Google Scholar
  33. [33] Andrzej Trybulec. Many sorted sets., 4():15-22, 1993.
    Search in Google Scholar
  34. [34] Andrzej Trybulec. Many sorted algebras., 5():37-42, 1996.
    Search in Google Scholar
  35. [35] Andrzej Trybulec. A scheme for extensions of homomorphisms of many sorted algebras., 5():205-209, 1996.
    Search in Google Scholar
  36. [36] Andrzej Trybulec. On the sets inhabited by numbers., 11():341-347, 2003.
    Search in Google Scholar
  37. [37] Michał J. Trybulec. Integers., 1():501-505, 1990.
    Search in Google Scholar
  38. [38] Wojciech A. Trybulec. Pigeon hole principle., 1():575-579, 1990.
    Search in Google Scholar
  39. [39] Zinaida Trybulec. Properties of subsets., 1():67-71, 1990.
    Search in Google Scholar
  40. [40] Tetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences., 9():825-829, 2001.
    Search in Google Scholar
  41. [41] Edmund Woronowicz. Many argument relations., 1():733-737, 1990.
    Search in Google Scholar
  42. [42] Edmund Woronowicz. Relations and their basic properties., 1():73-83, 1990.
    Search in Google Scholar
DOI: https://doi.org/10.2478/v10037-012-0037-6 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 309 - 341
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 4 (December 2012)
Previous article
Next article