Add to ORKGWe investigate differences in the elementary theories and isomorphism types of Rogers semilattices of computable numberings of families of sets lying in different levels of the arithmetical hierarchy
Aimed at graduate students and research logicians and mathematicians, this much-awaited text covers ...
In this paper some of the basics of classification theory for abstract elementary classes are discus...
We prove that a partially ordered set of all computably enumerable (c. e.) degrees that are the leas...
We investigate differences in the elementary theories and isomorphism types of Rogers semilattices ...
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 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 isomorphism types of Rogers semilat-tices of computable numberings...
We investigate initial segments and intervals of Rogers semilattices of arithmetical families. We p...
Abstract We investigate initial segments and intervals of Rogers semilattices of arithmetical famili...
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ o...
© 2018, Springer-Verlag GmbH Germany, part of Springer Nature. A major theme in the study of degree ...
Let $a$ be a Kleene's ordinal notation of a nonzero computable ordinal. We give a sufficient conditi...
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 ...
In this paper some of the basics of classification theory for abstract elementary classes are discus...
We prove that a partially ordered set of all computably enumerable (c. e.) degrees that are the leas...
We investigate differences in the elementary theories and isomorphism types of Rogers semilattices ...
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 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 isomorphism types of Rogers semilat-tices of computable numberings...
We investigate initial segments and intervals of Rogers semilattices of arithmetical families. We p...
Abstract We investigate initial segments and intervals of Rogers semilattices of arithmetical famili...
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ o...
© 2018, Springer-Verlag GmbH Germany, part of Springer Nature. A major theme in the study of degree ...
Let $a$ be a Kleene's ordinal notation of a nonzero computable ordinal. We give a sufficient conditi...
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 ...
In this paper some of the basics of classification theory for abstract elementary classes are discus...
We prove that a partially ordered set of all computably enumerable (c. e.) degrees that are the leas...