Adaptive logics using the minimal abnormality strategy are $$Pi^1_1$$ -complex

In this article complexity results for adaptive logics using the minimal abnormality strategy are presented. It is proven here that the consequence set of some recursive premise sets is -complete. So, the complexity results in (Horsten and Welch, Synthese 158:41–60, 2007) are mistaken for adaptive logics using the minimal abnormality strategy.