The following pages link to (Q4285797):
Displaying 13 items.
- Undecidability and 1-types in the recursively enumerable degrees (Q688787) (← links)
- Semilattices of disjunctive and linear degrees (Q1081599) (← links)
- Undecidability results for low complexity time classes (Q1567411) (← links)
- Elementary theories and hereditary undecidability for semilattices of numberings (Q1734277) (← links)
- Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees (Q1840456) (← links)
- Interpreting true arithmetic in the theory of the r.e. truth table degrees (Q1902619) (← links)
- Undecidable fragments of elementary theories (Q1906521) (← links)
- On the structural properties of the set of fixpoints for nondeterministic recursive definitions (Q1915506) (← links)
- Undecidability of elementary theories of Rogers semilattices of analytical hierarchies (Q2630488) (← links)
- (Q3365576) (← links)
- Degrees of presentability of structures. I (Q3546105) (← links)
- Recursively Enumerable Equivalence Relations Modulo Finite Differences (Q4315325) (← links)
- Definability with a predicate for a semi-linear set (Q4457736) (← links)
