scientific article; zbMATH DE number 3110190
From MaRDI portal
Publication:5848894
zbMath0065.00301MaRDI QIDQ5848894
Publication date: 1955
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Conservatively Approximable Functions ⋮ Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Degrees of Unsolvability: A Tutorial ⋮ Unnamed Item ⋮ Natural factors of the Muchnik lattice capturing IPC ⋮ Basic subtoposes of the effective topos ⋮ Unnamed Item ⋮ Effectively closed mass problems and intuitionism ⋮ Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes ⋮ Tense logics over lattices ⋮ First-order logic in the Medvedev lattice ⋮ 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) ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ Natural factors of the Medvedev lattice capturing IPC ⋮ Intermediate logics and factors of the Medvedev lattice ⋮ Medvedev Degrees of Generalized R.E. separating Classes ⋮ C-quasi-minimal enumeration degrees below \(\mathbf c'\) ⋮ Constructive logic and the Medvedev lattice ⋮ Highness properties close to PA completeness ⋮ Comparing the degrees of enumerability and the closed Medvedev degrees ⋮ Quasi-minimal enumeration degrees and minimal Turing degrees ⋮ Sets of generator and automorphism bases for the enumeration degrees ⋮ WEIHRAUCH GOES BROUWERIAN ⋮ Point Degree Spectra of Represented Spaces ⋮ A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES
