<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1409-2433</journal-id>
<journal-title><![CDATA[Revista de Matemática Teoría y Aplicaciones]]></journal-title>
<abbrev-journal-title><![CDATA[Rev. Mat]]></abbrev-journal-title>
<issn>1409-2433</issn>
<publisher>
<publisher-name><![CDATA[Centro de Investigaciones en Matemática Pura y Aplicada (CIMPA) y Escuela de Matemática, San José, Costa Rica.]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1409-24332016000100011</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Problemas de decisión y recursividad en sistemas lógicos formales]]></article-title>
<article-title xml:lang="en"><![CDATA[Decision problems and recursiveness in formal logic systems]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Martínez]]></surname>
<given-names><![CDATA[Iveth]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Piza]]></surname>
<given-names><![CDATA[Eduardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad de Panamá  ]]></institution>
<addr-line><![CDATA[ Ciudad de Panamá]]></addr-line>
<country>PA</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad de Costa Rica  ]]></institution>
<addr-line><![CDATA[ San José]]></addr-line>
<country>CR</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2016</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2016</year>
</pub-date>
<volume>23</volume>
<numero>1</numero>
<fpage>11</fpage>
<lpage>39</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_arttext&amp;pid=S1409-24332016000100011&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_abstract&amp;pid=S1409-24332016000100011&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_pdf&amp;pid=S1409-24332016000100011&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[ResumenEn la teoría de la recursión se dice que un problema de decisión es recursivamente resoluble si existe un procedimiento mecánico para resolverlo. Dentro del contexto de las lógicas formales, el problema de decisión consiste simplemente en determinar si una fórmula bien formada cualquiera del sistema es, o no es, un teorema.En este trabajo se analizan, entre otros asuntos, primeramente el famoso problema de decisión de la lógica canónica de primer orden F0 (también llamado Entscheidungsproblem) desde una perspectiva moderna. Luego se estudian los problemas de decisión de las lógicas proposicionales parciales. Se aprovecha el desarrollo alcanzado por la teoría de la recursión y de los sistemas productivos semi-Thue, luego de los trabajos de Post y Kleene en los años 40's y de Davis en la década de los 70's, entre otros, para explicar una solución a estos problemas de decisión.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[AbstractThe recursion theory states that a decision problem is recursively solvable if there is a mechanical process to solve it. Within the context of formal logic, the decision problem consist to determine whether any wellformed formula of the system is a theorem or not.This paper first discusses, among other things, the famous problem of decision of the canonical first-order logic F0 (also called Entscheidungsproblem) from a modern perspective. Then we study the decision problem of the partial propositional logics. It exploits the development achieved by recursion theory and semi-Thue production systems after the work of Post and Kleene in the 40's and Davis in the early 70's, among others, to explain a solution to these decision problems.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[problemas de decisión]]></kwd>
<kwd lng="es"><![CDATA[lógicas formales]]></kwd>
<kwd lng="es"><![CDATA[lógicas de primer orden]]></kwd>
<kwd lng="es"><![CDATA[lógicas proposicionales parciales]]></kwd>
<kwd lng="es"><![CDATA[Entscheidungsproblem]]></kwd>
<kwd lng="es"><![CDATA[sistemas productivos semi-Thue]]></kwd>
<kwd lng="en"><![CDATA[decision problems]]></kwd>
<kwd lng="en"><![CDATA[formal logic]]></kwd>
<kwd lng="en"><![CDATA[first-order logic]]></kwd>
<kwd lng="en"><![CDATA[Entscheidungsproblem]]></kwd>
<kwd lng="en"><![CDATA[partial propositional logics]]></kwd>
<kwd lng="en"><![CDATA[semi-Thue production systems]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A note on the Entscheidungsproblem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Church]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Journal of Symbolic Logic]]></source>
<year>1936</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>40-1</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Church]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to Mathematical Logic]]></source>
<year>1956</year>
<volume>1</volume>
<publisher-loc><![CDATA[Princeton NJ. ]]></publisher-loc>
<publisher-name><![CDATA[Princeton University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Davis]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computability and Unsolvability]]></source>
<year>1958</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Dover Publications]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Davis]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Weyuker]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computability, Complexity, and Languages]]></source>
<year>1983</year>
<publisher-loc><![CDATA[Boston ]]></publisher-loc>
<publisher-name><![CDATA[Academic Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dekker]]></surname>
<given-names><![CDATA[J.C.E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Equivalencia Recursiva]]></source>
<year>1976</year>
<publisher-loc><![CDATA[San José ]]></publisher-loc>
<publisher-name><![CDATA[Editorial CAEM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hennie]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to Computability]]></source>
<year>1977</year>
<publisher-loc><![CDATA[Boston, MA ]]></publisher-loc>
<publisher-name><![CDATA[Addison-Wesley]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hopcroft]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Ullman]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to Automata Theory, Languages, and Computation]]></source>
<year>1979</year>
<publisher-loc><![CDATA[Reading MA ]]></publisher-loc>
<publisher-name><![CDATA[Addison-Wesley]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kfoury]]></surname>
<given-names><![CDATA[A.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Moll]]></surname>
<given-names><![CDATA[R.N.]]></given-names>
</name>
<name>
<surname><![CDATA[Arbib]]></surname>
<given-names><![CDATA[M.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[A Programming Approach to Computability]]></source>
<year>1982</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Recursive unsolvability of the deductibility, Tarsky's completeness and independence of axioms problems of the propositional calculus]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Linial]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Post]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Bulletin of the American Mathematical Society]]></source>
<year>1949</year>
<volume>55</volume>
<page-range>50</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Piza]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Aritmética Recursiva y Algunas de sus Aplicaciones]]></source>
<year>2001</year>
<publisher-loc><![CDATA[San José ]]></publisher-loc>
<publisher-name><![CDATA[Editorial CIMPA]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rogers]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Theory of Recursive Function and Effective Computability]]></source>
<year>1967</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[McGraw-Hill]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Soare]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Recursive Enumerate Sets and Degrees: a Study of Computable Functions and Computable Generated Sets]]></source>
<year>1980</year>
<publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[On computable numbers, with an application to the "Entscheidungsproblem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Turing]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Proceedings of the London Mathematical Society]]></source>
<year>1936</year>
<volume>42</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>230-65</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
