Pages that link to "Item:Q3235358"
From MaRDI portal
The following pages link to Arithmetical representation of recursively enumerable sets (Q3235358):
Displaying 10 items.
- Computing degrees of unsolvability (Q770790) (← links)
- A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets (Q790804) (← links)
- Arithmetical representations of enumerable sets with a small number of quantifiers (Q1245954) (← links)
- Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets (Q1887829) (← links)
- Diophantine complexity (Q2276953) (← links)
- Three universal representations of recursively enumerable sets (Q3048819) (← links)
- Reductions of Hilbert's tenth problem (Q3256317) (← links)
- Martin Davis and Hilbert’s Tenth Problem (Q3305315) (← links)
- In Memoriam: Raphael Mitchel Robinson (Q4858807) (← links)
- Some representations of Diophantine sets (Q5680116) (← links)
