Abstract
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.
Similar content being viewed by others
References
Batens D. (2004). The need for adaptive logics in epistemology. In: Gabbay D., Rahman S., Symons J., Bendegem J.P.V. (eds). Logic, epistemology and the unity of science. Dordrecht, Kluwer Academic Publishers, pp. 459–485
Batens D. (2007). A universal logic approach to adaptive logics. Logica Universalis 1:221–242
Batens, D. Towards a dialogic interpretation of dynamic proofs. Festschrift for Shahid Rahman (to appear).
Batens, D., Clercq, K. D., Verdee, P., & Meheus. J. (2007). Yes fellows, most human reasoning is complex. Synthese (to appear).
Boolos G.S., Burgess J.P., Jeffrey R.C. (2002). Computability and logic. London, Cambridge University Press
Horsten L., Welch P. (2007). The undecidability of propositional adaptive logic. Synthese 158:41–60
Kozen D. (2002). On the complexity of reasoning in Kleene algebra. Information and Computation 179:152–162
Rogers H. (1967). Theory of recursive functions and effective computability. New York, McGraw-Hill
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Verdée, P. Adaptive logics using the minimal abnormality strategy are \(\Pi^1_1\) -complex. Synthese 167, 93–104 (2009). https://doi.org/10.1007/s11229-007-9291-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11229-007-9291-5