<?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><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Nice Embedding in Classical Logic</style></title><secondary-title><style face="normal" font="default" size="100%">Studia Logica</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><pages><style face="normal" font="default" size="100%">47-78</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 a set of semi-recursive logics, including many fragments of &lt;strong&gt;CL&lt;/strong&gt; (Classical Logic), can be embedded within &lt;strong&gt;CL&lt;/strong&gt; in an interesting way. A logic belongs&lt;br /&gt;to the set iff it has a certain type of semantics, called nice semantics. The set includes&lt;br /&gt;many logics presented in the literature. The embedding reveals structural properties of the embedded logic. The embedding turns finite premise sets into finite premise sets. The partial decision methods for &lt;strong&gt;CL&lt;/strong&gt; that are goal directed with respect to &lt;strong&gt;CL&lt;/strong&gt; are turned into partial decision methods that are goal directed with respect to the embedded logics.&lt;/p&gt;</style></abstract></record></records></xml>