<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>decidability</title>
    <link>http://popups.lib.uliege.be/1373-5411/index.php?id=1143</link>
    <description>Index terms</description>
    <language>fr</language>
    <ttl>0</ttl>
    <item>
      <title>Ideas on Hyperincursive Proof Theory</title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=1452</link>
      <description>This paper describes the possibility of incursive proof in classical formal theory. </description>
      <pubDate>Fri, 12 Jul 2024 14:22:57 +0200</pubDate>
      <lastBuildDate>Thu, 10 Oct 2024 10:33:12 +0200</lastBuildDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=1452</guid>
    </item>
    <item>
      <title>An Introduction to the Computation Model of Blum, Shub and Smale</title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=1140</link>
      <description>In this paper, we present an introduction to the theory of computability and complexity over a ring proposed by L. Blum, M. Shub and S. Smale in [Blum-Shub-Smale-1989]. </description>
      <pubDate>Fri, 05 Jul 2024 14:28:17 +0200</pubDate>
      <lastBuildDate>Fri, 05 Jul 2024 14:28:28 +0200</lastBuildDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=1140</guid>
    </item>
  </channel>
</rss>