scientific article
From MaRDI portal
Publication:3905267
zbMath0457.03042MaRDI QIDQ3905267
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
latticeTuring degreesdensegeneric degreedegrees of unsolvabilitymany-one degreesn-quantifier arithmetic
Related Items (38)
A note on the enumeration degrees of 1-generic sets ⋮ Intervals and sublattices of the r.e. weak truth table degrees. I: Density ⋮ Separating weak \(\alpha\)-change and \(\alpha\)-change genericity ⋮ Genericity and measure for exponential time ⋮ HTP-COMPLETE RINGS OF RATIONAL NUMBERS ⋮ Non-p-generic and strongly nonbranching degree ⋮ Members of thin Π₁⁰ classes and generic degrees ⋮ Non-p-generic and strongly nonbranching degree ⋮ On Low for Speed Oracles ⋮ Natural factors of the Muchnik lattice capturing IPC ⋮ The degrees of bi-hyperhyperimmune sets ⋮ Noisy inference and oracles ⋮ Continuous randomness via transformations of 2-random sequences ⋮ An oracle builder's toolkit ⋮ HIGHER RANDOMNESS AND GENERICITY ⋮ Generics for computable Mathias forcing ⋮ The Information Content of Typical Reals ⋮ The weakness of being cohesive, thin or free in reverse mathematics ⋮ Generic degrees are complemented ⋮ Noisy inference and oracles ⋮ The generic oracle hypothesis is false ⋮ On low for speed oracles ⋮ Embedding and coding below a 1-generic degree ⋮ Differences between resource bounded degree structures ⋮ Index sets and universal numberings ⋮ A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE ⋮ Genericity and measure for exponential time ⋮ Extensions of embeddings below computably enumerable degrees ⋮ Approximation methods in inductive inference ⋮ Learning via queries and oracles ⋮ Dynamic notions of genericity and array noncomputability ⋮ Multiple genericity: a new transfinite hierarchy of genericity notions ⋮ 1-generic splittings of computably enumerable degrees ⋮ Non-coding enumeration operators ⋮ Complexity of the \(r\)-query tautologies in the presence of a generic oracle ⋮ Extremes in the degrees of inferability ⋮ Degrees which do not bound minimal degrees ⋮ KL-randomness and effective dimension under strong reducibility
This page was built for publication:
