We investigate the notion of final derivability. Specifically, we describe the maximal recursion-theoretic complexity of the set of final consequences of decidable sets of premises formulated in the language of propositional logic. Our results show that taking the final consequences of a decidable theory is a powerful operation: (1) the set of final inconsistency-adaptive consequences according to the Reliability Calculus of a decidable premise set can be $Pi0_2$-complete; (2) the set of final inconsistency-adaptive consequences according to the Minimal Abnormality Calculus of a decidable premise set can be $Sigma0_3$-complete. Some philosophical consequences are drawn from these results. (joint work with Philip Welch, Bristol University)