<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="http://biblioteca.universia.net/searchKeyWord.do?q=symmetric%20combinatory%20logic">
    <title>Resultados de la búsqueda: symmetric combinatory logic</title>
    <link>http://biblioteca.universia.net/searchKeyWord.do?q=symmetric%20combinatory%20logic</link>
    <description>Resultados 1 - 1 de 1 de symmetric combinatory logic. (0,12 segundos)</description>
    <items>
      <rdf:Seq>
        <rdf:li />
      </rdf:Seq>
    </items>
    <dc:language>es</dc:language>
  </channel>
  <image>
    <title>Universia-Recursos de Aprendizaje</title>
    <url>http://biblioteca.universia.net/img/logotipo.jpg</url>
    <link>http://biblioteca.universia.net/</link>
  </image>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=1445170">
    <title>The Church-Rosser property in symmetric combinatory logic</title>
    <link>http://biblioteca.universia.net/ficha.do?id=1445170</link>
    <description>Symmetic combinatory logic with the symmetric analogue of a combinatorially
complete base (in the form of symmetric ?-calculus) is known to lack
the Church-Rosser property. We prove a much stronger theorem that
no symmetric combinatory logic that contains at least two proper
symmetric combinators has the Church-Rosser property. Although the
statement of the result looks similar to an earlier one concerning
dual combinatory logic, the proof is different because symmetric
combinators may form r...</description>
    <dc:creator>Bimbó, Katalin</dc:creator>
  </item>
</rdf:RDF>


