ﻻ يوجد ملخص باللغة العربية
A Polish space is not always homeomorphic to a computably presented Polish space. In this article, we examine degrees of non-computability of presenting homeomorphic copies of Polish spaces. We show that there exists a $0$-computable low$_3$ Polish space which is not homeomorphic to a computable one, and that, for any natural number $n$, there exists a Polish space $X_n$ such that exactly the high$_{2n+3}$-degrees are required to present the homeomorphism type of $X_n$. We also show that no compact Polish space has an easiest presentation with respect to Turing reducibility.
We investigate the effectivizations of several equivalent definitions of quasi-Polish spaces and study which characterizations hold effectively. Being a computable effectively open image of the Baire space is a robust notion that admits several chara
We study the bi-embeddability and elementary bi-embeddability relation on graphs under Borel reducibility and investigate the degree spectra realized by this relations. We first give a Borel reduction from embeddability on graphs to elementary embedd
We prove existence of wide types in a continuous theory expanding a Banach space, and density of minimal wide types among stable types in such a theory. We show that every minimal wide stable type is generically isometric to an l_2 space. We conclude
We present the (Lascar) Galois group of any countable theory as a quotient of a compact Polish group by an $F_sigma$ normal subgroup: in general, as a topological group, and under NIP, also in terms of Borel cardinality. This allows us to obtain simi
Higher inductive types are a class of type-forming rules, introduced to provide basic (and not-so-basic) homotopy-theoretic constructions in a type-theoretic style. They have proven very fruitful for the synthetic development of homotopy theory withi