FPRAS on #P complete problems and self reducibility

I am quoting a phrase of Martin Dyer in his paper Approximate Counting by Dynamic Programming:

Since 0-1 knapsack is self-reducible, existence of an fpras for the problem now follows indirectly from a general result of Sinclair and Jerrum[19]

In that paper of Sinclair and Jerrum it is stated that:

It follows that, for self-reducible structures, polynomial time randomised algorithms for counting to within factors of the form (1 +$n^{-\beta}$) are available either for all $\beta \in R$ or for no $\beta \in R$.

Question 1: Does statement 2 mean that counting self reducible structures might have an FPRAS?

Question 2: What is the indirect method Dyer is talking about? Is it some folklore method considered well known?

THEOREM 4.6. Let $R\subseteq \Sigma^*\times\Sigma^*$ be self-reducible. If there exists a polynomially time-bounded randomised approximate counter for $R$ within ratio $1 + O(n^\alpha)$ for some $\alpha\in\mathbb R$, then there exists a fully polynomial randomised approximation scheme for $\#R$.
Note the quantification over $R$. Your first question asks if "counting self-reducible structures might have an FPRAS", but this theorem is looking at particular $R$'s and showing that if $R$ has a weak kind of approximation algorithm, then $R$ also has a stronger kind of approximation algorithm.