Pages that link to "Item:Q4897042"
From MaRDI portal
The following pages link to Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets (Q4897042):
Displaying 14 items.
- On \(n\)-tardy sets (Q435200) (← links)
- Extending and interpreting Post's programme (Q636317) (← links)
- Computably enumerable sets and related issues (Q695800) (← links)
- Descriptive set theoretic methods in automata theory. Decidability and topological complexity (Q737116) (← links)
- Definable properties of the computably enumerable sets (Q1295410) (← links)
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems (Q1919534) (← links)
- The definability of \(\mathbb{E}\) in self-iterable mice (Q2105098) (← links)
- Degree invariance in the Π<sub>1</sub><sup>0</sup>classes (Q3107350) (← links)
- On orbits, of prompt and low computably enumerable sets (Q3149988) (← links)
- (Q3365576) (← links)
- Automorphisms, definable relations, and covers of elements of the computability potential scale for all finite algebras (Q3546129) (← links)
- ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS (Q4799379) (← links)
- Dynamic properties of computably enumerable sets (Q4863241) (← links)
- The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$ (Q4913812) (← links)
