Pages that link to "Item:Q3337459"
From MaRDI portal
The following pages link to DEFINABILITY OF RECURSIVELY ENUMERABLE SETS IN ABSTRACT COMPUTATIONAL COMPLEXITY THEORY (Q3337459):
Displaying 14 items.
- Ordinal complexity of recursive definitions (Q1193596) (← links)
- Arithmetic complexity of first-order definable subsets of recursive Boolean algebras (Q1284381) (← links)
- A representation of recursively enumerable sets through Horn formulas in higher recursion theory (Q1677584) (← links)
- (Q3032239) (← links)
- (Q3365576) (← links)
- (Q3487329) (← links)
- (Q3509174) (← links)
- (Q4285797) (← links)
- (Q4383591) (← links)
- Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time (Q4608731) (← links)
- Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets (Q4897042) (← links)
- Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time (Q5278405) (← links)
- On reduction of the decision problem of recursively enumerable sets to the separability problem (Q5582335) (← links)
- Complexity properties of recursively enumerable sets and \(bsQ\)-completeness (Q5942014) (← links)