scientific article; zbMATH DE number 3110190

Cited in

(29)

Sets of generator and automorphism bases for the enumeration degrees
Quasi-minimal enumeration degrees and minimal Turing degrees
Two measures of difficulty
Highness properties close to PA completeness
Comparing the degrees of enumerability and the closed Medvedev degrees
Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
C-quasi-minimal enumeration degrees below c'
Constructive logic and the Medvedev lattice
Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
Degrees of unsolvability: a tutorial
Conservatively approximable functions
Natural factors of the Muchnik lattice capturing IPC
Basic subtoposes of the effective topos
Effectively closed mass problems and intuitionism
Coding true arithmetic in the Medvedev degrees of ^0_1 classes
Natural factors of the Medvedev lattice capturing IPC
Medvedev degrees of generalized r.e. separating classes
A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES
scientific article; zbMATH DE number 7092101 (Why is no real title available?)
Weihrauch goes Brouwerian
Point Degree Spectra of Represented Spaces
eT-reducibility of sets
Theory and Applications of Models of Computation
Tense logics over lattices
PA RELATIVE TO AN ENUMERATION ORACLE
Some theorems on the algorithmic approach to probability theory and information theory (1971 dissertation directed by A. N. Kolmogorov)
Kolmogorov's Calculus of Problems and its Legacy
First-order logic in the Medvedev lattice
Intermediate logics and factors of the Medvedev lattice

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5848894)