Аннотация:
The roots of computable analysis go back to the seminal work of Turing (1936). One of the main directions in contemporary computable analysis studies computability aspects of Polish spaces. A computable Polish space is a Polish space equipped with a distinguished dense countable sequence of points such that the distances between these points are uniformly computable.
In the talk, we focus on Stone spaces. Recall that a Stone space is a compact and totally disconnected Hausdorff space. The classical result of Stone established a duality between the category of Stone spaces and the category of Boolean algebras. We give an overview of some recent results on the computability-theoretic properties of separable Stone spaces. In particular, we discuss effective versions of the Stone duality.
Язык доклада: английский
Website:
https://us02web.zoom.us/j/81866745751?pwd=bEFqUUlZM1hVV0tvN0xWdXRsV2pnQT09
|
