<?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%">Towards the Unification of Inconsistency Handling Mechanisms</style></title><secondary-title><style face="normal" font="default" size="100%">Logic and Logical Philosophy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year></dates><volume><style face="normal" font="default" size="100%">8</style></volume><pages><style face="normal" font="default" size="100%">5–31</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;It is shown that the (flat) consequence relations defined from the Rescher-Manor Mechanism (that is: in terms of maximal consistent subsets of the premises) are all inconsistency-adaptive logics combined with a specific interpretation schema for the premises. Each of the adaptive logics is obtained by applying a suitable adaptive strategy to the paraconsistent logic &lt;strong&gt;CLuN&lt;/strong&gt;.&lt;br /&gt;&lt;br /&gt; This result provides all those consequence relations with a (dynamic) proof theory and with a static (as well as a dynamic) semantics.&lt;/p&gt;</style></abstract><notes><style face="normal" font="default" size="100%">Appeared 2002</style></notes></record></records></xml>