Tuesday, October 21, 2014

 

 



Soy un nuevo usuario

Olvidé mi contraseña

Entrada usuarios

Lógica Matemáticas Astronomía y Astrofísica Física Química Ciencias de la Vida
Ciencias de la Tierra y Espacio Ciencias Agrarias Ciencias Médicas Ciencias Tecnológicas Antropología Demografía
Ciencias Económicas Geografía Historia Ciencias Jurídicas y Derecho Lingüística Pedagogía
Ciencia Política Psicología Artes y Letras Sociología Ética Filosofía
 

rss_1.0 Clasificación por Disciplina

Nomenclatura Unesco > (11) Lógica

Mostrando recursos 101 - 120 de 132,314

101. Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language - Amy P. Felty
We argue that a logic programming language with a higher-order intuitionistic logic as its foundation can be used both to naturally specify and implement theorem provers. The language extends traditional logic programming languages by replacing first-order terms with simply-typed λ-terms, replacing first-order unification with higher-order unification, and allowing implication and universal quantification in queries and the bodies of clauses. Inference rules for a variety of proof systems can be naturally specified in this language. The higher-order features of the language contribute to a concise specification of provisos concerning variable occurrences in formulas and the discharge of assumptions present in many...

102. A Certificate Infrastructure for Machine-Checked Proofs of Conditional Information Flow - Torben Amtoft; Josiah Dodds; Zhi Zhang; Andrew Appel, Lennart Beringer; John Hatcliff; Xinming Ou; Andrew Cousino
In previous work, we have proposed a compositional framework for stating and automatically verifying complex conditional information flow policies using a relational Hoare logic. The framework allows developers and verifiers to work directly with the source code using source-level code contracts. In this work, we extend that approach so that the algorithm for verifying code compliance to an information flow contract emits formal certificates of correctness that are checked in the Coq proof assistant. This framework is implemented in the context of SPARK – a subset of Ada that has been used in a number of industrial contexts for implementing...

103. Foundational certification of data-flow analyses - Maria João Frade, et al.
Data-flow analyses, such as live variables analysis, available expressions analysis etc., are usefully specifiable as type systems. These are sound and, in the case of distributive analysis frameworks, complete wrt. appropriate natural semantics on abstract properties. Applications include certification of analyses and “optimization ” of functional correctness proofs alongside programs. On the example of live variables analysis, we show that analysis type systems are applied versions of more foundational property semantics as the type system (liveness states) or a more concrete natural semantics on transition traces of a suitable kind (future defs and uses). The rules of the type property...

104. Atlas y topología del error como un sistema productivo en la arquitectura - García Triviño, Francisco
En nuestra cultura, asumimos el error como algo vergonzoso, como un resultado ajeno a nuestra consciente autoría. Normalmente queremos desentendernos de él, pues se suele asociar a que ha sido el resultado de un accidente involuntario. Sin embargo, también es cierto que se suele usar como un mecanismo que despierta nuestro humor, la curiosidad, el extrañamiento y la sorpresa. El error en nuestra cultura se esconde en inverosímiles mensajes que nos rodean. Si se toma como ejemplo los errores que se encierran en la serie humorística de dibujos animados "El-coyote-y-el-correcaminos"1, se puede descubrir las numerosas consecuencias y actitudes encriptadas donde...

105. Numerical Model of a Variable-Combined-Cycle Engine for Dual Subsonic and Supersonic Cruise - Fernández Villacé, Víctor; Paniagua, Guillermo
Efficient high speed propulsion requires exploiting the cooling capability of the cryogenic fuel in the propulsion cycle. This paper presents the numerical model of a combined cycle engine while in air turbo-rocket configuration. Specific models of the various heat exchanger modules and the turbomachinery elements were developed to represent the physical behavior at off-design operation. The dynamic nature of the model allows the introduction of the engine control logic that limits the operation of certain subcomponents and extends the overall engine operational envelope. The specific impulse and uninstalled thrust are detailed while flying a determined trajectory between Mach 2.5 and...

106. The origin and significance of Hegel's logic; a general introduction to Hegel's system. - Baillie, J. B. (James Black), Sir, 1872-1940.
Mode of access: Internet.

107. An introductory logic, - Creighton, James Edwin, 1861-1924.
Includes bibliographical references.

108. Sujeitos com síndrome de down em cena : enredos sobre o aprender - Streda, Carina
O presente estudo versa sobre os “sujeitos da educação especial”. Como recorte, problematizam-se enunciados que associam síndrome de Down às (im)possibilidades do aprender. Trata-se de um estudo teórico, que tem a escrita através de cenas como metodologia e o ensaio como forma. Como perspectiva teórica, o conceito de aprender proposto por Alicia Fernández é central, por descentralizar as possibilidades de aprendizagem das condições orgânicas. No processo de desnaturalização de algumas certezas, conceitos postulados por John Langdon Down (1859), Benda (1954), Lejeune (1958) ganham cena. Nessa processualidade histórica, encontra-se a formulação de um conceito de idiotia, de etiologia organicista e hereditária,...

109. Seis propostas para este milênio : uma trama entre tempo e letramento - Fröhlich, Cláudia Bechara
Partindo da experiência como psicóloga junto ao Ateliê de Criação – local de acolhimento de crianças encaminhadas pelas escolas por apresentarem problemas em seus percursos escolares – e a reuniões formativas – local de discussão e sustentação da prática de professores junto a laboratórios de ensino e aprendizagem –, situamos o problema de pesquisa no jogo do tempo como abertura e/ou limite ao mundo letrado, objetivando traçar uma trama entre o tempo e a passagem da oralidade ao letramento. Nessa travessia às letras, constatamos que a criança se produz em uma série de desdobramentos, num múltiplo repertório de muito pouca...

110. O papel do enfermeiro nos sistemas de triagem em emergências : análise da literatura - Duro, Carmen Lúcia Mottin; Lima, Maria Alice Dias da Silva
Emergências, nacional e internacionalmente, respondem por uma sobrecarga de pacientes, que resulta em superlotação do setor. Nesse cenário, ganham relevância as escalas de triagem, que buscam a organização dos processos de atendimento do paciente na emergência. Este artigo discute o papel do enfermeiro nos sistemas de triagem em emergências de forma contextual e reflexiva. Para essa proposta foi desenvolvida uma análise da literatura sobre escalas de triagem estruturada em emergência hospitalar e da organização do trabalho. O enfermeiro é o profissional que reúne as condições necessárias para a realização das escalas de avaliação e classificação de risco, as quais incluem...

111. Saberes das mulheres veterenas na economia solidária : sororidade a outra educação! - Alves, Simone Silva
Este estudo tem como objetivo compreender como os saberes das mulheres veteranas na rede de economia solidária, se constroem e podem ou não trazer elementos para se pensar outra proposta de ensinar, aprender, criar e produzir, outra(s) sociabilidade(s) e outro(s) modo(s) de viver e ser no coletivo social. Entendemos que o processo educativo não acontece deslocado da construção da cidade, da cultura, das identidades, do trabalho, dos tempos e espaço de socialização. A natureza da pesquisa foi qualiquantitativa. A pesquisa de representação social deve ser qualitantitativa, porque as opiniões coletivas apresentam, ao mesmo tempo, uma dimensão qualitativa e uma quantitativa....

112. Influencia del refuerzo en el hormigón en la resistencia a tracción de los anclajes químicos - Román Ramos, José Daniel
El objeto de estudio de este trabajo es, en primer lugar, un estado del arte de los anclajes actuales, siguiendo con un análisis de la rotura de anclajes mecánicos y químicos. Todo ello persigue el objeto de conocer cómo trabajan los distintos anclajes en el material base, para poder modelizar el comportamiento del anclaje a carga axil, en particular de los anclajes químicos en hormigón y concluir qué influencia tiene la armadura dentro del material base en el modo de rotura en cono de hormigón y extracción, también conocido como el fallo combinado de cono y pull-out y en la resistencia a tracción final. El desarrollo...

113. A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic - Lev D. Beklemishev; Joost J. Joosten; Marco Vervoort
We study a propositional polymodal provability logic GLP introduced by G. Japaridze. The previous treatments of this logic, due to Japaridze and Ignatiev (see [11, 7]), heavily relied on some non-finitary principles such as transfinite induction up to #0 or reflection principles. In fact, the closed fragment of GLP gives rise to a natural system of ordinal notation for #0 that was used in [1] for a proof-theoretic analysis of Peano arithmetic and for constructing simple combinatorial independent statements. In this

114. A Sequent Calculus for Nominal Logic - Murdoch Gabbay; James Cheney
Nominal logic is a theory of names and binding based on the primitive concepts of freshness and swapping, with a self-dual N - (or "new")-quantifier, originally presented as a Hilbert-style axiom system extending first-order logic. We present a sequent calculus for nominal logic called Fresh Logic, or FL, admitting cut-elimination. We use FL to provide a proof-theoretic foundation for nominal logic programming and show how to interpret $FOL^{\Delta abla}$, another logic with a self-dual quantifier, within FL.

115. Modal Logics For Products Of Topologies - J. Van Benthem; G. Bezhanishvili; B. Ten Cate; D. Sarenac
We introduce the horizontal and vertical topologies on the product of topological spaces, and study their relationship with the standard product topology. We show that the modal logic of products of topological spaces with horizontal and vertical topologies is the fusion S4 S4. We axiomatize the modal logic of products of topological spaces with horizontal, vertical, and standard product topologies. We prove that both of these logics are complete for the product of rational numbers Q Q with the appropriate topologies.

116. Canonicity for Intensional Logics With Even Axioms - Timothy J. Surendonk
This paper looks at the concept of neighborhood canonicity introduced by BRIAN CHELLAS [2]. We follow the lead of the author's paper [8] where it was shown that every non-iterative logic is neighborhood canonical and here we will show that all logics whose axioms have a simple syntactic form---no intensional operator is in boolean combination with a propositional letter---and which have the finite model property are neighborhood canonical. One consequence of this is that KMcK, the McKinsey logic, is nieghborhood canonical, an interesting counterpoint to the results of ROBERT GOLDBLATT and XIAOPING WANG who showed, respectively, that KMcK is not...

117. A New Application for Description Logics: Disaster Management - Martina Grathwohl; François de Bertrand de Beuvron; François Rousselot
By presenting a description logic model of the high water protection plan of Heidelberg we demonstrate that description logics are an appropriate tool for supporting the management of natural disasters. The model enables testing its consistency, assessing disaster situations by means of realization, and retrieving situation-dependent activities. Finally, we discuss the remaining problems on which we will work in the future.

118. Unary Interpretability Logic - MAARTEN de RIJKE
Let T be an arithmetical theory. We introduce a unary modal operator T to be interpreted arithmetically as the unary interpretability predicate over T. We present complete axiomatizations of the (unary) interpretability principles underlying two important classes of theories. We also prove some basic modal results about these new axiomatizations.

119. A Simplified Proof of Arithmetical Completeness Theorem for Provability Logic GLP - L. D. Beklemishev
We present a simplified proof of Japaridze’s arithmetical completeness theorem for the well-known polymodal provability logic GLP. The simplification is achieved by employing a fragment J of GLP that enjoys a more convenient Kripke-style semantics than the logic considered in the papers by Ignatiev and Boolos. In particular, this allows us to simplify the arithmetical fixed point construction and to bring it closer to the standard construction due to Solovay.

120. Deriving Abstract Semantics for Forward Analysis of Normal Logic Programs - Lunjin Lu
The problem of forward abstract interpretation of normal logic programs has not been formally addressed in the literature although negation as failure is dealt with through the built-in predicate! in the way it is implemented in Prolog. This paper proposes a solution to this problem by deriving two generic fixed-point abstract semantics F ♭ P and F ⋄ P for forward abstract interpretation of normal logic programs. F ♭ P is intended for inferring data descriptions for edges in the program graph where an edge denotes the possibility that the control of execution transfers from its source program point to...

Página de resultados:
 

Busque un recurso