<?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=03B60">
    <title>Resultados de la búsqueda: 03B60</title>
    <link>http://biblioteca.universia.net/searchKeyWord.do?q=03B60</link>
    <description>Resultados 1 - 10 de 47 de 03B60. (0,14 segundos)</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: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=977245">
    <title>A prooftechnique in uniform space theory</title>
    <link>http://biblioteca.universia.net/ficha.do?id=977245</link>
    <description>In the constructive theory of uniform spaces there occurs a technique of proof in
which the application of a weak form of the law of excluded middle is
circumvented by purely analytic means. The essence of this prooftechnique is
extracted and then applied in several different situations.</description>
    <dc:creator>Bridges, Douglas; Vî??, Lumini?a</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=37476921">
    <title>Valuation structure</title>
    <link>http://biblioteca.universia.net/ficha.do?id=37476921</link>
    <description>This paper introduces valuation structures associated with preferential models. Based on
KLM valuation structures, we present a canonical approach to obtain injective preferential models for any
preferential relation satisfying the property INJ, and give uniform proofs of representation theorems for
injective preferential relations appeared in the literature. In particular, we show that, in any propositional
language (finite or infinite), a preferential inference relation satisfies INJ if and...</description>
    <dc:creator>Zhu, Zhaohui; Pan, Zhenghua; Chen, Shifu; Zhu, Wujia</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=37478218">
    <title>Propositional dynamic logic for concurrent programs</title>
    <link>http://biblioteca.universia.net/ficha.do?id=37478218</link>
    <dc:creator>Nishimura, Hirokazu</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=979738">
    <title>A Variant of Thomason's First-Order Logic CF Based on Situations</title>
    <link>http://biblioteca.universia.net/ficha.do?id=979738</link>
    <description>In this paper, we define a first-order logic CF? with strong
negation and bounded static quantifiers, which is a variant of Thomason's logic
CF. For the logic CF?, the usual Kripke formal semantics is defined
based on situations, and a sound and complete axiomatic system is established based on the
axiomatic systems of constructive logics with strong negation and Thomason's
completeness proof techniques. With the use of bounded quantifiers, CF? allows the domain of quantification to be empty ...</description>
    <dc:creator>Wang, Xuegang; Mott, Peter</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=979757">
    <title>Peeking at the Impossible</title>
    <link>http://biblioteca.universia.net/ficha.do?id=979757</link>
    <description>The question of the interpretation of
impossible pictures is taken up. Penrose's account is
reviewed. It is argued that whereas this account makes
substantial inroads into the problem, there needs to be a
further ingredient. An inconsistent account using heap models
is proposed.</description>
    <dc:creator>Mortensen, Chris</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=979774">
    <title>Propositional Logic of Supposition and Assertion</title>
    <link>http://biblioteca.universia.net/ficha.do?id=979774</link>
    <description>This presentation of a system of propositional logic is a foundational paper for
systems of illocutionary logic. The language
$\mathcal{L}_{.75}$ contains the
illocutionary force operators ' $\vdash$ ' for assertion and '
' for
supposition. Sentences occurring in proofs of the deductive system
$\mathcal{S}_{.75}$
must be prefixed with one of these operators, and rules of
$\mathcal{S}_{.75}$ take
account of the forces of the sentences. Two kinds of semantic conditions are
investigated; familia...</description>
    <dc:creator>Kearns, John T.</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=979784">
    <title>An Intensional Schrödinger Logic</title>
    <link>http://biblioteca.universia.net/ficha.do?id=979784</link>
    <description>We investigate the higher-order modal logic $S_{\omega}I$ , which is a variant of the
system $S_{\omega}$ presented in our previous work. A semantics for that
system, founded on the theory of quasi sets, is outlined. We show how
such a semantics, motivated by the very intuitive base of Schrödinger logics, provides an
alternative way to formalize some intensional concepts and features which
have been used in recent discussions on the logical foundations of quantum mechanics; for
example, that ...</description>
    <dc:creator>da Costa, Newton C. A.; Krause, Décio</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=979804">
    <title>Minimal Temporal Epistemic Logic</title>
    <link>http://biblioteca.universia.net/ficha.do?id=979804</link>
    <description>In the study of nonmonotonic reasoning the main emphasis has been on static
(declarative) aspects. Only recently has there been interest in the dynamic
aspects of reasoning processes, particularly in artificial intelligence. We study
the dynamics of reasoning processes by using a temporal logic to specify them
and to reason about their properties, just as is common in theoretical computer
science. This logic is composed of a base temporal epistemic logic with a
preference relation on models, ...</description>
    <dc:creator>Engelfriet, Joeri</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=979847">
    <title>Worlds of Homogeneous Artifacts</title>
    <link>http://biblioteca.universia.net/ficha.do?id=979847</link>
    <description>We present a formal first-order theory of artificial objects,
i.e., objects made out of a finite number of parts and subject to
assembling and dismantling processes. These processes are
absolutely reversible. The theory is an extension of the theory of
finite sets with urelements. The notions of transformation and
identity are defined and studied on the assumption that the
objects are homogeneous, that is to say, all their atomic
parts are of equal ontological importance. Particular emphasis ...</description>
    <dc:creator>Tzouvaras, Athanassios</dc:creator>
  </item>
  <item rdf:about="http://biblioteca.universia.net/ficha.do?id=979859">
    <title>Editor's Introduction</title>
    <link>http://biblioteca.universia.net/ficha.do?id=979859</link>
    <description>The process [by which any individual settles into new
opinions] is always the same. The individual has a stock
of old opinions already, but he meets a new experience
that puts them to a strain. The result is an inward
trouble to which his mind till then had been a stranger, and
from which he seeks to escape by modifying his previous mass
of opinions. He saves as much of it as he can, for in this
matter of belief we are all extreme conservatives. So he
tries to change first this opinion, and ...</description>
    <dc:creator>Fuhrmann, André</dc:creator>
  </item>
</rdf:RDF>


