date

Date

speaker

Speaker

topic

Title of the report

18.10.2018

Volodymyr Mykhaylyuk (Chernivtsi)

Compact sets in partially metric spaces

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)

Countably fragmented functions on paracompact spaces

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)

On a problem of Borsik

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)

Complete binary trees in Boolean algebra

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.