<?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><author><style face="normal" font="default" size="100%">De Clercq, Kristof</style></author><author><style face="normal" font="default" size="100%">Kurtonina, Natasha</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Embedding and Interpolation for Some Paralogics. The Propositional Case</style></title><secondary-title><style face="normal" font="default" size="100%">Reports on Mathematical Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><volume><style face="normal" font="default" size="100%">33</style></volume><pages><style face="normal" font="default" size="100%">29–44</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We consider the very weak paracomplete and paraconsistent logics that are obtained by a straightforward weakening of Classical Logic, as well as some of their maximal extensions that are a fragment of Classical Logic. We prove (for the propositional case) that these logics may be faithfully embedded in Classical Logic (as well as in each other), and that the interpolation theorem obtains for them.&lt;/p&gt;</style></abstract></record></records></xml>