Have a personal or library account? Click to login
Representation Theorem for Stacks Cover

Representation Theorem for Stacks

Formalized Mathematics
Volume 19 (2011): Issue 4 (December 2011)
By: Grzegorz Bancerek  
Open Access
|Apr 2012

References

  1. Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.
    Search in Google Scholar
  2. Grzegorz Bancerek. Filters - part II. Quotient lattices modulo filters and direct product of two lattices. Formalized Mathematics, 2(3):433-438, 1991.
    Search in Google Scholar
  3. Grzegorz Bancerek. Reduction relations. Formalized Mathematics, 5(4):469-478, 1996.
    Search in Google Scholar
  4. Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.
    Search in Google Scholar
  5. Grzegorz Bancerek and Andrzej Trybulec. Miscellaneous facts about functions. Formalized Mathematics, 5(4):485-492, 1996.
    Search in Google Scholar
  6. Czesław Byliński. Binary operations. Formalized Mathematics, 1(1):175-180, 1990.
    Search in Google Scholar
  7. Czesław Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990.
    Search in Google Scholar
  8. Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.
    Search in Google Scholar
  9. Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.
    Search in Google Scholar
  10. Czesław Byliński. The modification of a function by a function and the iteration of the composition of a function. Formalized Mathematics, 1(3):521-527, 1990.
    Search in Google Scholar
  11. Czesław Byliński. Partial functions. Formalized Mathematics, 1(2):357-367, 1990.
    Search in Google Scholar
  12. Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.
    Search in Google Scholar
  13. Grażyna Mirkowska and Andrzej Salwicki. Algorithmic Logic. PWN-Polish Scientific Publisher, 1987.
    Search in Google Scholar
  14. Konrad Raczkowski and Paweł Sadowski. Equivalence relations and classes of abstraction. Formalized Mathematics, 1(3):441-444, 1990.
    Search in Google Scholar
  15. Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1):115-122, 1990.
    Search in Google Scholar
  16. Wojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569-573, 1990.
    Search in Google Scholar
  17. Wojciech A. Trybulec. Partially ordered sets. Formalized Mathematics, 1(2):313-319, 1990.
    Search in Google Scholar
  18. Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.
    Search in Google Scholar
  19. Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.
    Search in Google Scholar
  20. Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990.
    Search in Google Scholar
  21. Edmund Woronowicz and Anna Zalewska. Properties of binary relations. Formalized Mathematics, 1(1):85-89, 1990.
    Search in Google Scholar
DOI: https://doi.org/10.2478/v10037-011-0033-2 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 241 - 250
Published on: Apr 26, 2012
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Related subjects:
Computer sciences,
Computer sciences, other,
Mathematics,
General mathematics

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

Volume 19 (2011): Issue 4 (December 2011)