<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Verdée, Peter</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Adaptive Logics using the Minimal Abnormality strategy are \$\textbackslashPi\^ 1\_1\$-complex</style></title><secondary-title><style face="normal" font="default" size="100%">Synthese</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s11229-007-9291-5</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">167</style></volume><pages><style face="normal" font="default" size="100%">93–104</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract></record></records></xml>