Wednesday, October 22, 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 121 - 140 de 131,906

121. 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,...

122. 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...

123. 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...

124. 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....

125. 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...

126. 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

127. 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.

128. 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.

129. 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...

130. 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.

131. 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.

132. 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.

133. 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...

134. Semantic Results for Ontic and Epistemic Change - Hans van Ditmarsch; Barteld Kooi
We present an epistemic logic incorporating dynamic operators to describe information changing events. Such events include epistemic changes, where agents become more informed about the non-changing state of the world, and ontic changes, wherein the world changes. The events are executed in information states that are modelled as pointed Kripke models. Our contribution consists of three semantic results. (i) Every consistent formula can be made true in every information state by the execution of an event. (ii) Every event corresponds to an event with assignments to true and false only. (iii) Every event corresponds to a sequence of events with...

135. An Extended Interpreted System Model for Epistemic Logics - Kaile Su; Abdul Sattar
The interpreted system model offers a computationally grounded model, in terms of the states of computer processes, to S5 epistemic logics. This paper extends the interpreted system model, and provides a computationally grounded one, called the interpreted perception system model, to those epistemic logics other than S5. It is usually assumed, in the interpreted system model, that those parts of the environment that are visible to an agent are correctly perceived by the agent as a whole. The essential idea of the interpreted perception system model is that an agent may have incorrect perception or observations to the visible parts...

136. Dynamic topological logic - Philip Kremer; Grigori Mints
Dynamic topological logic provides a context for studying the confluence of the topological semantics for S4, topological dynamics, and temporal logic. The topological semantics for S4 is based on topological spaces rather than Kripke frames. In this semantics, □ is interpreted as topological interior. Thus S4 can be understood as the logic of topological spaces, and □ can be understood as a topological modality. Topological dynamics studies the asymptotic properties of continuous maps on topological spaces. Let a dynamic topological system be a topological space X together with a continuous function f. f can be thought of in temporal terms,...

137. A modal logic framework for reasoning about comparative distances and topology - Mikhail Sheremet; Frank Wolter; Michael Zakharyaschev
We propose and investigate a uniform modal logic framework for reasoning about topology and relative distance in metric and more general distance spaces, thus enabling the comparison and combination of logics from distinct research traditions such as Tarski’s S4 for topological closure and interior, conditional logics, and logics of comparative similarity. This framework is obtained by decomposing the underlying modal-like operators into first-order quantifier patterns. We then show that quite a powerful and natural fragment of the resulting first-order logic can be captured by one binary operator comparing distances between sets and one unary operator distinguishing between realised and limit...

138. POLYMORPHIC TYPE ANALYSIS IN LOGIC PROGRAMS BY ABSTRACT INTERPRETATION - Lunjin Lu
In this paper, we first introduce a notion of polymorphic abstract interpretation that formalises a polymorphic analysis as a generalisation of possibly infinitely many monomorphic analyses in the sense that the results of the monomorphic analyses can be obtained as instances of that of the polymorphic analysis. We then present a polymorphic type analysis of logic programs in terms of an abstract domain for polymorphic descriptions of type information and two operators on the abstract domain, namely the least upper bound operator and the abstract unification operator. The domains for similar purposes. The abstract unification operator for the polymorphic type...

139. Improving Precision of Type Analysis Using Non-Discriminative Union - Lunjin Lu
This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type constructors. Non-discriminative union is used to join type information from different sources without loss of precision. An operation that is performed repeatedly during an analysis is to detect if a fixpoint has been reached. This is reduced to checking the emptiness of types. Due to the use of non-discriminative union, the fundamental problem of checking the emptiness of types is more complex in the proposed type analysis than in other...

140. The Logic of Justified Belief Change, Soft Evidence and Defeasible Knowledge - Alexandru Baltag, et al.
We present a logic for reasoning about the evidence-based knowledge and beliefs and the evidential dynamics of non-logically-omniscient agents. We do this by adapting key tools and techniques from Dynamic Epistemic Logic, Justification Logic, and Belief Revision so as to provide a lightweight, yet finegrained approach that characterizes well-known epistemic and doxastic attitudes in terms of the evidential reasoning that justifies these attitudes. We then add the dynamic operations of evidence introduction, evidence-based inference, strong acceptance of new evidence (evidential “upgrade”), and irrevocable acceptance of additional evidence (evidential “update”). We exemplify our theory by providing a formal dynamic account of...

Página de resultados:
 

Busque un recurso