We investigate differences in the elementary theories of Rogers semilattices of arithmetical numberings, depending on structural invariants of the given families of arithmetical sets. It is shown that at any fixed level of the arithmetical hierarchy there exist infinitely many families with pairwise elementary different Rogers semilattices
© 2018, Springer-Verlag GmbH Germany, part of Springer Nature. A major theme in the study of degree ...
We outline the general approach to the notion of a computable numeration in the frames of which com...
We show that for every ordinal notation \xi of a nonzero computable ordinal, there exists a Sigma_...
We investigate differences in the elementary theories of Rogers semilattices of arithmetical number...
It is proved that for every level of the arithmetic hierarchy, there exist infinitely many families ...
We investigate differences in the elementary theories and isomorphism types of Rogers semilattices ...
We investigate initial segments and intervals of Rogers semilattices of arithmetical families. We p...
We investigate differences in isomorphism types and elementary theories of Rogers semilattices of a...
Abstract We investigate initial segments and intervals of Rogers semilattices of arithmetical famili...
We investigate differences in isomorphism types for Rogers semilattices of computable numberings of ...
We investigate differences in the isomorphism types of Rogers semilat-tices of computable numberings...
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ o...
Let $a$ be a Kleene's ordinal notation of a nonzero computable ordinal. We give a sufficient conditi...
© 2018, Springer-Verlag GmbH Germany, part of Springer Nature. A major theme in the study of degree ...
We outline the general approach to the notion of a computable numeration in the frames of which com...
We show that for every ordinal notation \xi of a nonzero computable ordinal, there exists a Sigma_...
We investigate differences in the elementary theories of Rogers semilattices of arithmetical number...
It is proved that for every level of the arithmetic hierarchy, there exist infinitely many families ...
We investigate differences in the elementary theories and isomorphism types of Rogers semilattices ...
We investigate initial segments and intervals of Rogers semilattices of arithmetical families. We p...
We investigate differences in isomorphism types and elementary theories of Rogers semilattices of a...
Abstract We investigate initial segments and intervals of Rogers semilattices of arithmetical famili...
We investigate differences in isomorphism types for Rogers semilattices of computable numberings of ...
We investigate differences in the isomorphism types of Rogers semilat-tices of computable numberings...
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ o...
Let $a$ be a Kleene's ordinal notation of a nonzero computable ordinal. We give a sufficient conditi...
© 2018, Springer-Verlag GmbH Germany, part of Springer Nature. A major theme in the study of degree ...
We outline the general approach to the notion of a computable numeration in the frames of which com...
We show that for every ordinal notation \xi of a nonzero computable ordinal, there exists a Sigma_...