18.10.2018
Volodymyr Mykhaylyuk (Chernivtsi)
It is proved that a complete binary tree in σ-complete Boolean algebra is equivalent to a tree of binary intervals if and only if this tree is infinitely small and inactive.
01.11.2018
Olena Karlova (Chernivtsi)
It is proved that a complete binary tree in σ-complete Boolean algebra is equivalent to a tree of binary intervals if and only if this tree is infinitely small and inactive.
15.11.2018
Oleksandr Maslyuchenko (Chernivtsi)
It is proved that a complete binary tree in σ-complete Boolean algebra is equivalent to a tree of binary intervals if and only if this tree is infinitely small and inactive.
13.12.2018
Popov M. M. (Chernivtsi)
It is proved that a complete binary tree in σ-complete Boolean algebra is equivalent to a tree of binary intervals if and only if this tree is infinitely small and inactive.
20.02.2020
Volodymyr Mykhaylyuk
We study the existence of an equivalent bounded complete partial metric r on a complete (compact) partial metric (X,p).