<?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%">Urbaniak, Rafal</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On Ontological Functors of Lesniewski's Elementary Ontology</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%">2006</style></year></dates><volume><style face="normal" font="default" size="100%">40</style></volume><pages><style face="normal" font="default" size="100%">15–43</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 present an algorithm which allows to define any possible sentence-formative functor of Le&amp;amp;\#347;niewski's Elemen- tary Ontology (LEO), arguments of which belong to the category of names. Other results are: a recursive method of listing possible functors, a method of indicating the number of possible n-place ontological functors, and a sketch of a proof that LEO is function- ally complete with respect to {&amp;amp;\#8743;,&amp;amp;\#172;, &amp;amp;\#8704;, &amp;amp;\#949;}&lt;/p&gt;</style></abstract></record></records></xml>