Pages that link to "Item:Q802550"
From MaRDI portal
The following pages link to The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical (Q802550):
Displaying 11 items.
- Undecidability and 1-types in the recursively enumerable degrees (Q688787) (← links)
- Model-theoretic properties of Turing degrees in the Ershov difference hierarchy (Q744306) (← links)
- The density of the nonbranching degrees (Q1055403) (← links)
- Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games (Q1196208) (← links)
- Undecidability and 1-types in intervals of the computably enumerable degrees (Q1591201) (← links)
- Turing computability: structural theory (Q2036465) (← links)
- Annual Meeting of the Association for Symbolic Logic, Berkeley, 1990 (Q3352991) (← links)
- Degree Structures: Local and Global Investigations (Q3412461) (← links)
- Lattice embeddings into the recursively enumerable degrees. II (Q4205431) (← links)
- The ∀∃-theory of ℛ(≤,∨,∧) is undecidable (Q4813796) (← links)
- Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees (Q6119790) (← links)
