03 Mathematical logic and foundations
03Dxx Computability and recursion theory
03D25 Recursively (computably) enumerable sets and degrees (7 articles)
-
Demuth, Osvald:
Remarks on the structure of tt-degrees based on constructive measure theory.
(English).
Commentationes Mathematicae Universitatis Carolinae,
vol. 29
(1988),
issue 2,
pp. 233-247
-
Demuth, Osvald:
A notion of semigenericity.
(English).
Commentationes Mathematicae Universitatis Carolinae,
vol. 28
(1987),
issue 1,
pp. 71-84
-
Demuth, Osvald; Kučera, Antonín:
Remarks on 1-genericity, semigenericity and related concepts.
(English).
Commentationes Mathematicae Universitatis Carolinae,
vol. 28
(1987),
issue 1,
pp. 85-94
-
Calude, Cristian; Chiţescu, Ion:
Representability of recursive P. Martin-Löf tests.
(English).
Kybernetika,
vol. 19
(1983),
issue 6,
pp. 526-536
-
Kučera, Antonín:
On recursive measure of classes of recursive sets.
(English).
Commentationes Mathematicae Universitatis Carolinae,
vol. 23
(1982),
issue 1,
pp. 117-121
-
Kučera, Antonín:
Об aлгopифмичecкoй неапроксимируемости точных верхних гpaниц конструктивных пceвдоceчeний.
(Russian) [The algorithmic nonapproximability of the least upper bounds of constructive pseudosections].
Commentationes Mathematicae Universitatis Carolinae,
vol. 18
(1977),
issue 3,
pp. 445-453
-
Hořejš, Jiří:
On generalizations of a theorem on recursive sets.
(English).
Archivum Mathematicum,
vol. 1
(1965),
issue 4,
pp. 221-227