论文信息 - Representation Theorem for Stacks

Representation Theorem for Stacks

Representation Theorem for Stacks In the paper the concept of stacks is formalized. As the main result the Theorem of Representation for Stacks is given. Formalization is done according to [13].

Grzegorz Bancerek | G. Bancerek

[1] Edmund Woronowicz. Relations Defined on Sets , 1990 .

[2] A. Trybulec. Domains and Their Cartesian Products , 1990 .

[3] Konrad Raczkowski,et al. Equivalence Relations and Classes of Abstraction 1 , 1990 .

[4] G. Bancerek. The Fundamental Properties of Natural Numbers , 1990 .

[5] Czeslaw Bylinski. Functions and Their Basic Properties , 2004 .

[6] G. Bancerek. Filters - Part II. Quotient Lattices Modulo Filters and Direct Product of Two Lattices , 1991 .

[7] Andrzej Salwicki,et al. Algorithmic Logic , 1987 .

[8] Andrzej Trybulec,et al. Miscellaneous Facts about Functions , 1996 .

[9] A. Zalewska,et al. Properties of Binary Relations , 1990 .

[10] Czesław Bylí. Finite Sequences and Tuples of Elements of a Non-empty Sets , 1990 .

[11] Czesław Bylí,et al. Binary Operations , 2019, Problem Solving in Mathematics and Beyond.

[12] Grzegorz Bancerek,et al. Reduction Relations , 2004 .

[13] Wojciech A. Trybulec. Partially Ordered Sets , 1990 .

[14] Czeslaw Bylinski. Functions from a Set to a Set , 2004 .

[15] Edmund Woronowicz. Relations and Their Basic Properties , 2004 .

[16] Grzegorz Bancerek,et al. Segments of Natural Numbers and Finite Sequences , 1990 .

[17] Czeslaw Bylinski. Some Basic Properties of Sets , 2004 .

[18] Wojciech A. Trybulec. Non-contiguous Substrings and One-to-one Finite Sequences , 1990 .