Comparing sets of the Baire space by means of general recursive operators
Complexity of some natural problems on the class of computable -algebras.
Computable categoricity versus relative computable categoricity
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. We show that every 1 decidable computably categorical structure is relatively Δ⁰₂ categorical. We study the complexity of various index sets associated with computable categoricity and relative computable categoricity. We also introduce and study a variation of relative computable categoricity, comparing it to both computable...
Computable families of superatomic Boolean algebras.
Computable solutions of equations over endomorphisms of negative numberings.
Computably rigid models with enumerable submodels.