scientific article; zbMATH DE number 1390012
From MaRDI portal
zbMath0939.03047MaRDI QIDQ4934277
Publication date: 29 June 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Coloring of graphs and hypergraphs (05C15) Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55)
Related Items
The Medvedev lattice of computably closed sets, Prime Model with No Degree of Autostability Relative to Strong Constructivizations, Degrees containing members of thin Π10 classes are dense and co-dense, The \(\forall \exists \)-theory of the effectively closed Medvedev degrees is decidable, Members of thin Π₁⁰ classes and generic degrees, PAC learning, VC dimension, and the arithmetic hierarchy, Infinite dimensional proper subspaces of computable vector spaces, Antibasis theorems for \({\Pi^0_1}\) classes and the jump hierarchy, Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes, On the cardinality of future worldlines in discrete spacetime structures, COMPUTABLY COMPACT METRIC SPACES, Computable symbolic dynamics, Degrees of difficulty of generalized r.e. separating classes, Effectively closed sets and enumerations, A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals, Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees, The upward closure of a perfect thin class, Empiricism, probability, and knowledge of arithmetic: a preliminary defense, Computability of countable subshifts in one dimension, Medvedev Degrees of Generalized R.E. separating Classes, RANK AND RANDOMNESS, Invariance in ℰ* and ℰ_{Π}, Computability of Subsets of Metric Spaces, Effectively closed sets and graphs of computable real functions.
