We investigate differences in isomorphism types for Rogers semilattices of computable numberings of families of sets lying in different levels of the arithmetical hierarchy
Let $a$ be a Kleene's ordinal notation of a nonzero computable ordinal. We give a sufficient conditi...
Abstract. We investigate the problem of type isomorphisms in the presence of higher-order references...
We investigate the problem of type isomorphisms in a programming language with higher-order referenc...
We investigate differences in isomorphism types for Rogers semilattices of computable numberings of ...
We investigate differences in isomorphism types and elementary theories of Rogers semilattices of a...
We investigate differences in the isomorphism types of Rogers semilat-tices of computable numberings...
We investigate differences in the elementary theories and isomorphism types of Rogers semilattices ...
We investigate differences in the elementary theories of Rogers semilattices of arithmetical number...
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ o...
Abstract We investigate initial segments and intervals of Rogers semilattices of arithmetical famili...
We investigate initial segments and intervals of Rogers semilattices of arithmetical families. We p...
It is proved that for every level of the arithmetic hierarchy, there exist infinitely many families ...
© 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...
Aimed at graduate students and research logicians and mathematicians, this much-awaited text covers ...
Let $a$ be a Kleene's ordinal notation of a nonzero computable ordinal. We give a sufficient conditi...
Abstract. We investigate the problem of type isomorphisms in the presence of higher-order references...
We investigate the problem of type isomorphisms in a programming language with higher-order referenc...
We investigate differences in isomorphism types for Rogers semilattices of computable numberings of ...
We investigate differences in isomorphism types and elementary theories of Rogers semilattices of a...
We investigate differences in the isomorphism types of Rogers semilat-tices of computable numberings...
We investigate differences in the elementary theories and isomorphism types of Rogers semilattices ...
We investigate differences in the elementary theories of Rogers semilattices of arithmetical number...
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ o...
Abstract We investigate initial segments and intervals of Rogers semilattices of arithmetical famili...
We investigate initial segments and intervals of Rogers semilattices of arithmetical families. We p...
It is proved that for every level of the arithmetic hierarchy, there exist infinitely many families ...
© 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...
Aimed at graduate students and research logicians and mathematicians, this much-awaited text covers ...
Let $a$ be a Kleene's ordinal notation of a nonzero computable ordinal. We give a sufficient conditi...
Abstract. We investigate the problem of type isomorphisms in the presence of higher-order references...
We investigate the problem of type isomorphisms in a programming language with higher-order referenc...
DOI
Add to ORKG