<?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%">Batens, Diderik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Procedural Criterion for Final Derivability in Inconsistency-Adaptive Logics</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Applied Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><volume><style face="normal" font="default" size="100%">3</style></volume><pages><style face="normal" font="default" size="100%">221–250</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This paper concerns a (prospective) goal directed proof procedure for the propositional fragment of the inconsistency-adaptive logic &lt;strong&gt;ACLuN1&lt;/strong&gt;. At the propositional level, the procedure forms an algorithm for final derivability. If extended to the predicative level, it provides a \emph{criterion} for final derivability. This is essential in view of the absence of a positive test. The procedure may be generalized to all flat adaptive logics.&lt;/p&gt;</style></abstract></record></records></xml>