<?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/vernivel.do?start=40&amp;nivel=11">
    <title>Nomenclatura Unesco &gt; (11) Lógica</title>
    <link>http://biblioteca.universia.net/vernivel.do?start=40&amp;nivel=11</link>
    <description>Mostrando recursos 41 - 60 de 88,632</description>
    <items>
      <rdf:Seq>
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <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=46264888">
    <title>Calendar Logic</title>
    <link>http://biblioteca.universia.net/ficha.do?id=46264888</link>
    <description>A propositional temporal logic is introduced whose operators quantify over intervals of a reference time line. The intervals are specified symbolically, for example `next week&amp;apos;s weekend&amp;apos;. The specification language for the intervals takes into account all the features of real calendar systems. A simple statement which can be expressed in this language is for example: `yesterday I worked for eight hours with one hour lunch break at noon&amp;apos;. Calendar Logic can be translated into pr...</description>
    <dc:creator>Hans Jürgen Ohlbach; Dov Gabbay</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=48005325">
    <title>Calendar logic</title>
    <link>http://biblioteca.universia.net/ficha.do?id=48005325</link>
    <description>ABSTRACT. A propositional temporal logic is introduced whose operators quantify over intervals of a reference time line. The intervals are specified symbolically, for example ‘next week’s weekend’. The specification language for the intervals takes into account all the features of real calendar systems. A simple statement which can be expressed in this language is for example: ‘yesterday I worked for eight hours with one hour lunch break at noon’. Calendar Logic can be translated into proposi...</description>
    <dc:creator>Hans Jürgen Ohlbach; Dov Gabbay</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=37734214">
    <title>Lógica</title>
    <link>http://biblioteca.universia.net/ficha.do?id=37734214</link>
    <dc:creator>Academia de Ciencias de la U.R.S.S.</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=38491312">
    <title>Logica.</title>
    <link>http://biblioteca.universia.net/ficha.do?id=38491312</link>
    <description>Referencias: R.</description>
    <dc:creator>Castrovol, Pedro de; Castrovol, Pedro de</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=48796404">
    <title>Logic,</title>
    <link>http://biblioteca.universia.net/ficha.do?id=48796404</link>
    <description>2d ed.</description>
    <dc:creator>Sigwart, Christoph, 1830-1904.</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=48799973">
    <title>Logic,</title>
    <link>http://biblioteca.universia.net/ficha.do?id=48799973</link>
    <description>1 p.l., [v]-vi, [7]-135, [1] p.</description>
    <dc:creator>Jevons, William Stanley, 1835-1882.</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=48980953">
    <title>Una o varias lógicas?</title>
    <link>http://biblioteca.universia.net/ficha.do?id=48980953</link>
    <dc:creator>Palau, Gladys Dora</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=49176969">
    <title>Logic.</title>
    <link>http://biblioteca.universia.net/ficha.do?id=49176969</link>
    <description>xvi, 112 p.</description>
    <dc:creator>Whately, Richard, 1787-1863.</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=49142381">
    <title>Logic;</title>
    <link>http://biblioteca.universia.net/ficha.do?id=49142381</link>
    <description>xiii, 266 p.</description>
    <dc:creator>Smith, George H. (George Hugh)</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=41685214">
    <title>Temporal Logic,</title>
    <link>http://biblioteca.universia.net/ficha.do?id=41685214</link>
    <description>Introduction ---
Notes for the Sixth European Summer School
in Logic, Language, and Information,
Copenhagen 1994
Mads Dam
Swedish Institute of Computer Science
1 Introduction and Overview
The area of intersection between temporal logic, automata on finite and infinite
objects, and classical first- or restricted second-order logics is one of considerable
richness. All these areas have long and venerable traditions in mathematics, logic,
and theoretical computer science, and their intimate rela...</description>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=41776152">
    <title>Contrastive Logic</title>
    <link>http://biblioteca.universia.net/ficha.do?id=41776152</link>
    <description>In this paper I introduce the notion of bilogics, namely logics interpreted over a pair of structures, in
contrast to classical logic and many of its variations, the formulae of which are interpreted over one
structure. In particular, I introduce and study Contrastive Logic, suitable for expressing contrast
and conformity between the two structures involved.
A major reason for this study is striving towards an extension of truth-conditional semantics to
cover several natural-language particle...</description>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=41840581">
    <title>Computational Logic</title>
    <link>http://biblioteca.universia.net/ficha.do?id=41840581</link>
    <description>tresses complexity issues, and how proofs can be analyzed to produce computational
information, proving a version of the famous Dialectica" theorem of Godel. The course concludes with
a discussion of linear logic, a so-called resource-conscious logic; we will discuss the relationship between
cut-elimination (proof simplication) in linear logic, and evaluation of programs written in -calculus.
Required work: Work for the course will include several problem sets, and some class presentations.
...</description>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=46494269">
    <title>Contrastive Logic</title>
    <link>http://biblioteca.universia.net/ficha.do?id=46494269</link>
    <description>In this paper I introduce the notion of bilogics, namely logics interpreted over a pair of structures, in contrast to classical logic and many of its variations, the formulae of which are interpreted over one structure. In particular, I introduce and study Contrastive Logic, suitable for expressing contrast and conformity between the two structures involved.  A major reason for this study is striving towards an extension of truth-conditional semantics to cover several natural-language particl...</description>
    <dc:creator>Nissim Francez Computer</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=46884577">
    <title>Trakhtenbrot Theorem and Fuzzy Logic</title>
    <link>http://biblioteca.universia.net/ficha.do?id=46884577</link>
    <description>Trakhtenbrot theorem is shown to be valid for the three main fuzzy logics - Lukasiewicz, Gödel and product logic.</description>
    <dc:creator>Petr Hajek; Fuzzy Logic</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=35524619">
    <title>Ejercicio sobre lógica booleana</title>
    <link>http://biblioteca.universia.net/ficha.do?id=35524619</link>
    <description>Ejercicio para practicar los conceptos de lógica (Tema 2: Conceptos
Genéricos).</description>
    <dc:creator>Saiz Noeda, Maximiliano</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=35524619">
    <title>Ejercicio sobre lógica booleana</title>
    <link>http://biblioteca.universia.net/ficha.do?id=35524619</link>
    <description>Ejercicio para practicar los conceptos de lógica (Tema 2: Conceptos
Genéricos).</description>
    <dc:creator>Saiz Noeda, Maximiliano</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=46567248">
    <title>A Theory of Logic Programming</title>
    <link>http://biblioteca.universia.net/ficha.do?id=46567248</link>
    <description>In this paper we define the rather general framework of Monotonic Logic Programs, where the main results of (definite) logic programming are validly extrapolated. Whenever defining new logic programming extensions, we can thus turn our attention to the stipulation and study of its intuitive algebraic properties within the very general setting. Then, the existence of a minimum model and of a monotonic immediate consequences operator is guaranteed, and they are related as in classical logic pro...</description>
    <dc:creator>Carlos Viegas Damásio; Luís Moniz Pereira</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=47463807">
    <title>From Indexed Lax Logic to Intuitionistic Logic</title>
    <link>http://biblioteca.universia.net/ficha.do?id=47463807</link>
    <description>We present translations from a logic with indexed lax modalities to first-order intuitionistic logic and intuitionistic linear logic. These translations rely on a continuation passing style encoding for the lax modalities. We show that our translations preserve provability of formulas. 1 This author was partially sponsored by the Air Force Research Laboratory under grant no. FA87500720028.</description>
    <dc:creator>Deepak Garg; Michael Carl Tschantz</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=41731609">
    <title>Linear Logic</title>
    <link>http://biblioteca.universia.net/ficha.do?id=41731609</link>
    <description>this paper we will restrict attention to propositional linear logic.</description>
    <dc:creator>Patrick Lincoln</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=42147181">
    <title>Linear Logic</title>
    <link>http://biblioteca.universia.net/ficha.do?id=42147181</link>
    <description>this paper we will restrict attention to propositional linear logic</description>
    <dc:creator>Patrick Lincoln</dc:creator>
  </item>
</rdf:RDF>



