Journal of Formalized Mathematics
Volume 7, 1995
University of Bialystok
Copyright (c) 1995
Association of Mizar Users
Replacement of Subtrees in a Tree
-
Oleg Okhotnikov
-
Ural University, Ekaterinburg
Summary.
-
This paper is based on previous works [1],
[2] in which the operation replacement of subtree in a tree
has been defined. We extend this notion for arbitrary non empty antichain.
MML Identifier:
TREES_A
The terminology and notation used in this paper have been
introduced in the following articles
[5]
[7]
[6]
[8]
[4]
[3]
[1]
[2]
Contents (PDF format)
Acknowledgments
The author wishes to thank to G. Bancerek for his
assistance during the preparation of this paper.
Bibliography
- [1]
Grzegorz Bancerek.
Introduction to trees.
Journal of Formalized Mathematics,
1, 1989.
- [2]
Grzegorz Bancerek.
K\"onig's Lemma.
Journal of Formalized Mathematics,
3, 1991.
- [3]
Grzegorz Bancerek and Krzysztof Hryniewiecki.
Segments of natural numbers and finite sequences.
Journal of Formalized Mathematics,
1, 1989.
- [4]
Czeslaw Bylinski.
Functions and their basic properties.
Journal of Formalized Mathematics,
1, 1989.
- [5]
Andrzej Trybulec.
Tarski Grothendieck set theory.
Journal of Formalized Mathematics,
Axiomatics, 1989.
- [6]
Andrzej Trybulec.
Subsets of real numbers.
Journal of Formalized Mathematics,
Addenda, 2003.
- [7]
Zinaida Trybulec.
Properties of subsets.
Journal of Formalized Mathematics,
1, 1989.
- [8]
Edmund Woronowicz.
Relations and their basic properties.
Journal of Formalized Mathematics,
1, 1989.
Received October 1, 1995
[
Download a postscript version,
MML identifier index,
Mizar home page]