scientific article; zbMATH DE number 3954890
From MaRDI portal
Publication:3724316
zbMATH Open0594.03025MaRDI QIDQ3724316FDOQ3724316
Authors: Peter A. Fejer, Richard A. Shore 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
- Lattice Embeddings in the Recursively Enumerable Truth Table Degrees
- Embedding Lattices with Top Preserved Below Non‐GL2 Degrees
- Embedding lattices into the wtt-degrees below 0′
- Undecidability and initial segments of the (r.e.) tt-degrees
- The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Cited In (16)
- Initial segments of the lattice of ideals of r.e. degrees
- Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees
- Lattice representations for computability theory
- A nonlow\(_2\) r. e. degree with the extension of embeddings properties of a low\(_2\) degree
- Working below a \(low_ 2\) recursively enumerable degree
- The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory
- Lattice Embeddings into the R.E. Degrees Preserving 0 and 1
- Title not available (Why is that?)
- Embedding lattices into the wtt-degrees below 0′
- Intervals and sublattices of the r.e. weak truth table degrees. I: Density
- Title not available (Why is that?)
- Two Theorems on Truth Table Degrees
- Lattice Embeddings in the Recursively Enumerable Truth Table Degrees
- Where join preservation fails in the bounded Turing degrees of c.e. sets
- Interpreting true arithmetic in the theory of the r.e. truth table degrees
- The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility
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 Q3724316)
