scientific article
From MaRDI portal
Publication:3724316
zbMath0594.03025MaRDI QIDQ3724316
Peter A. Fejer, Richard A. Shore
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Intervals and sublattices of the r.e. weak truth table degrees. I: Density ⋮ Lattice Embeddings in the Recursively Enumerable Truth Table Degrees ⋮ Where join preservation fails in the bounded Turing degrees of c.e. sets ⋮ The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory ⋮ Working below a \(low_ 2\) recursively enumerable degree ⋮ Two Theorems on Truth Table Degrees ⋮ Lattice representations for computability theory
This page was built for publication:
