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 $$\Pi_1^1$$ -complete. So, the complexity results in (Horsten and Welch, Synthese 158:41–60, 2007) are mistaken for adaptive logics using the minimal abnormality strategy.

[1]  Diderik Batens,et al.  A Universal Logic Approach to Adaptive Logics , 2007, Logica Universalis.

[2]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[3]  Diderik Batens.  The Need for Adaptive Logics In Epistemology , 2004, Logic, Epistemology, and the Unity of Science.

[4]  Dexter Kozen,et al.  On the complexity of reasoning in Kleene algebra , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[5]  Diderik Batens,et al.  Towards a Dialogic Interpretation of Dynamic Proofs , 2009 .

[6]  Philip D. Welch,et al.  The Undecidability of Propositional Adaptive Logic , 2006, Synthese.

[7]  George Boolos,et al.  Computability and logic , 1974 .

[8]  Shahid Rahman,et al.  Logic, Epistemology, and the Unity of Science , 2004, Logic, Epistemology, and the Unity of Science.

[9]  Diderik Batens,et al.  Yes fellows, most human reasoning is complex , 2007, Synthese.