Although the type‐I interferon (IFN‐I) response is considered vertebrate‐specific, recent findings about the Intracellular Pathogen Response (IPR) in nematode Caenorhabditis elegans indicate that there are similarities between these two transcriptional immunological programs. The IPR is induced during infection with natural intracellular fungal and viral pathogens of the intestine and promotes resistance against these pathogens. Similarly, the IFN‐I response is induced by viruses and other intracellular pathogens and promotes resistance against infection. Whether the IPR and the IFN‐I response evolved in a (...) divergent or convergent manner is an unanswered and exciting question, which could be addressed by further studies of immunity against intracellular pathogens in C. elegans and other simple host organisms. Here we highlight similar roles played by RIG‐I‐like receptors, purine metabolism enzymes, proteotoxic stressors, and transcription factors to induce the IPR and IFN‐I response, as well as the similar consequences of these defense programs on organismal development. (shrink)

The article addresses two closely related questions: What are the criteria of adequacy of logical formalization of natural language arguments, and what gives logic the authority to decide which arguments are good and which are bad? Our point of departure is the criticism of the conception of logical formalization put forth, in a recent paper, by M. Baumgartner and T. Lampert. We argue that their account of formalization as a kind of semantic analysis brings about more problems than it solves. (...) We also argue that the criteria of adequate formalization need not be based on truth conditions associated with logical formulas; in our view, they are better based on structural (inferential) grounds. We then put forward our own version of the criteria. The upshot of the discussion that follows is that the quest for an adequate formalization in a suitable logical language is best conceived of as the search for a Goodmanian reflective equilibrium. (shrink)

Se hace un esfuerzo por interpretar el supuesto fenómeno de los raptos de individuos por naves extraterrestres desde conceptos teóricos žižekianos como _afanisis_, “destitución subjetiva”, “Cosa” de la libido, trauma y “mediador evanescente”.

The keynote idea of the theses is contained in the author’s assumption that modern philosophy doesn’t meet its claiming pretensions: to be universal form of knowledge. First of all philosophy is connected not with knowledge but with ideas and secondly being authentic it “exists only in everyday life”.1 In orderthat philosophy could realize its innate essence corresponding conditions of social being should exist but they are still absent and therefore philosophy is absent as well. Its place is occupied by metaphysics (...) which is free movement of thinking that has no definiteness as the condition of being of any form of thought. That iswhy we watch crisis state of “philosophy” which becomes apparent in vagueness of its subject: “philosophy is not only one, there are many of them”. The author supposes that philosophy as the highest relation of mankind to objective reality is the only one. Philosophy lowered down from the heaven (Platon, Ciceron) in the field of human being must raise people not only to purity of thought, but mainly to purity of their activity both with each other and with nature. Then real interaction of men and nature will take place. This will be the beginning of spiritualization of the Universe. It may exist only under the conditions of social uniformity as historical form of Weltanschauung (world outlook) that removes religious form. Realization of its being supposes fundamental change of social life. It is necessary that private property should be replaced with social property in the sphere of social production. Only under these conditions philosophy may appear and exist as historical form of Weltanschauung. (shrink)

If A ⊆ ω1, then there exists a cardinal preserving generic extension [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][A ][x ] of [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][A ] by a real x such that1) A ∈ [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][x ] and A is Δ1HC in [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][x ];2) x is minimal over [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][A ], that is, if a set Y belongs to [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][x ], then either x ∈ [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][A, Y ] or Y (...) ∈ [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][A ].The forcing we use implicitly provides reshaping of the given set A. (shrink)

Zagadochnyĭ starik.--T︠S︡iolkovskiĭ v Peterburge.

We introduce reference structures — a basic mathematical model of a data organization capable of storing and utilizing information about its addresses. A propositional labeled modal language is used as a specification and programming language for reference structures; the satisfiability algorithm for modal language gives a method of building and optimizing reference structures satisfying a given formula. Corresponding labeled modal logics are presented, supplied with cut free axiomatizations, completeness and decidability theorems are proved. Initialization of typed variables in some programming (...) languages is presented as an example of a reference structure building. (shrink)

The recent proposition to eliminate eponyms from physical publications is discussed. The role of eponyms in research and education is analyzed. We show that eponyms constitute an integral part of physical texts and ensure the continuity of scientific research. Their proposed elimination is dangerous for science and the entire human culture and must be rejected.

We consider games over a finite alphabet with Gurevich-Harrington's winning conditions and restraints as in Yakhnis-Yakhnis . The game tree, the Gurevich-Harrington's kernels of the winning condition and the restraints are defined by finite automata. We give an effective criterion to determine the winning player and an effective presentation of a class of finite automata defined winning strategies.Our approach yields an alternative solution to the games considered by Büchi and Landweber . The BL algorithm is an important tool for solving (...) effectively presented games. The differences between the BL and our algorithms are as follows. Our algorithm is uniformly applicable to winning sets that correspond to boolean combinations of BL winning conditions, while the BL algorithm requires a transformation of such boolean combinations into a single BL condition. Our algorithm directly applies to a larger class of game trees for a given game alphabet than does the BL one. We describe Büchi-Landweber's class of winning conditions in a more transparent way by using finite automata and Gurevich-Harrington's form of winning conditions. Our algorithms that determine the winner of the game and find a winning strategy, are based on a translation of the events in the game in terms of the transition table of the automaton representing the game. This automaton differs from the ones that represent BL winning conditions. Both algorithms need further investigation.The algorithm determining the winner in the game, can be used as a verifier of concurrent programs. This is because programs can be viewed as strategies in Gurevich-Harrington's games and program specifications could be regarded as winning conditions for such games. The algorithm which finds a winning strategy could be used as a basis for automated concurrent program design.The present paper is a sequel to Annals of Pure and Applied Logic 48 277–297. (shrink)

This collection focuses on the transcendental philosophy of Kant and Husserl and on the intersection of transcendental philosophy and everyday life and experience. It contains sections on philosophy and everyday experience, Kant and neo-Kantianism, applications of transcendental philosophy, and transcendental philosophy and the emotions. Annotation copyrighted by Book News, Inc., Portland, OR.

We commend Arbib for his original proposal that a mirror neuron system may have participated in language origins. However, in our view he proposes a complex evolutionary scenario that could be more parsimonious. We see no necessity to propose a hand-based signing stage as ancestral to vocal communication. The prefrontal system involved in human speech may have its precursors in the monkey's inferior frontal cortical domain, which is responsive to vocalizations and is related to laryngeal control.

The article focuses on process management in public administration using the specific case study of the statutory city of Ostrava. Based on the selected part of the PAPRIS methodology, the process management is verified, and conclusions from the application of information system e-SMO are generalized. Ostrava is third the biggest city in Czech Republic with approximately 320 thousand citizen. Article describes experiences with SW implements, which are used for model of process in public administration. Particulary at local authority of Ostrava (...) town. Model of process is a basis for reengineering of process in state administration and preparation for implementation of big information systems. Mapping of process is providing implement and confirmation methodology to identify existing processes. Problem with its using consist in that, senior manager don’t informs, what organization is determination by processes. If are not described in given to organization current processes, or how would have had look new optimum processes, will not endeavour about reengineering successful. Procedural analysis namely offer tool and check methodology to identification current suit and it is possible him use either as instruction for reengineering function handling administrative and self-rule activities. Purpose of the article: The PAPRIS methodology was used when defining the objectives for implementation of the information system for public administration. This methodology has been elaborated by one of the authors and published in a very general scheme when solving many case studies,,. We assume that the PAPRIS is primarily a methodology with incorporated elements of procedural approach for project management in public administration information systems. The specific supporting process of communication between the client and the e-SMO system has been chosen for verification. The model of supporting communication process, created by ARIS tools, is crucial, and the structure of scripts is subsequently made. The aim of this article is to verify that the methodology is sufficient and appropriate to manage such a large project such, undoubtedly, is the e-SMO. Methodology/methods: Defined productive and non-productive processes with their defined process cuts represent a crucial category for the process structure of IS projects. This is fully accepted by the PAPRIS methodology. Process cuts are understood, in the logic modelling according to the PAPRIS methodology, as clearly defined logic directional cuts in three-dimensional space of all project processes. The process set is systemically categorized, in a given logic directional cut, into mutually disjoint process subsets, which are characterized by this particular directional operator. The directional operator always has a clear logical allocation that is based on the construction of a process view. Theoretically, an infinite number of process views can be used. One of the important issues in a methodology for the case studies includes the size of the research sample. It is usually assumed that there is no ideal number of cases and that the number between four and ten usually provides good results. Other authors defining against any quantitative standards for any determination of the sample size of the case studies, since such an approach denies the internal logic of this methodology and the richness of the information obtained from participants in the research. Research which is carried out using case studies does not aspire on compliance with the requirement the representativeness of the sample.. Methodology of case studies is among the established guidelines of qualitative research. Research on using case studies in the last 30 years has seen an extraordinary increase in social-scientific research, including research on business and management. Scientific aim: The essential aim of this study is to describe the way the process cut defines a productive process and non-productive process, in accordance with the PAPRIS methodology using the specific example. While the triggering mechanism of the project production process is an event causing its own production - i.e. the specific output with added value for the customer, the project of non-productive process is caused by the project management event. Therefore, it is caused by the need to control, monitor, track, inspect, evaluate outputs, decide and regulate the project implementation. Findings: Within the support of the communication process, two examples were used to verify the methodology. The global perspective on the process was created in ARIS tools and the communication between the call centre and the client was made in Visio tools. The PAPRIS methodology is based on the concept of process variability, which has been clearly formulated. The fundamental direction of the process development, anticipated changes and the opportunity to react to them in accordance with defined objectives of the PAIS project are guaranteed. (shrink)

Trata-se de analisar os usos da racionalidade mimética em Jacques Lacan e Theodor Adorno, isto a fim de mostrar como, nos dois casos, encontramos uma estratégia de reflexão sobre a mimesis que a eleva à condição de elemento fundamental para uma teoria do reconhecimento que não se esgote na temática da intersubjetividade. Neste sentido, este estudo insere-se em uma pesquisa mais ampla a respeito dos modos de aproximação entre psicanálise lacaniana e Escola de Frankfurt no que diz respeito ao problema (...) dos destinos da categoria de sujeito e dos processos de reconhecimento. (shrink)

My dear Aleksandr!I have finally found some quiet time for a slow and attentive read of your article “The Beginning of the Black Notebooks.”1 I very much liked the article, especially for your trul...

This article discusses the connection between the ideas of Fyodor M. Dostoevsky and Vladimir S. Solovyov on the need for cultural and moral transformation of those who would claim to participate in...

"This personification of wisdom with golden hair and a radiant aura echoes both the eternal feminine and the world soul. Rooted in Christian and Jewish mysticism, Eastern Orthodox iconography, Greek philosophy, and European romanticism, the Sophiology that suffuses Solovyov's philosophical and artistic works is both intellectually sophisticated and profoundly inspiring. Judith Deutsch Kornblatt brings together key texts from Solovyov's writings about Sophia: poetry, fiction, drama, and philosophy, all extensively annotated and some available in English for the first time (with assistance (...) from the translators Boris Jakim and Laury Magnus)."--Amazon website. (shrink)

In this paper we prove the following theorem: Any one-dimensional definably connected group G over an o-minimal structure is, as an abstract group, isomorphic to either pPp∞δ or δ.

The notion of conditional entropy is extended to noncomposite systems. The \-deformed entropic inequalities, which usually are associated with correlations of the subsystem degrees of freedom in bipartite systems, are found for the noncomposite systems. New entropic inequalities for quantum tomograms of qudit states including the single qudit states are obtained. The Araki–Lieb inequality is found for systems without subsystems.

The aim of this book is to present the fundamental theoretical results concerning inference rules in deductive formal systems. Primary attention is focused on: admissible or permissible inference rules the derivability of the admissible inference rules the structural completeness of logics the bases for admissible and valid inference rules. There is particular emphasis on propositional non-standard logics (primary, superintuitionistic and modal logics) but general logical consequence relations and classical first-order theories are also considered. The book is basically self-contained and special (...) attention has been made to present the material in a convenient manner for the reader. Proofs of results, many of which are not readily available elsewhere, are also included. The book is written at a level appropriate for first-year graduate students in mathematics or computer science. Although some knowledge of elementary logic and universal algebra are necessary, the first chapter includes all the results from universal algebra and logic that the reader needs. For graduate students in mathematics and computer science the book is an excellent textbook. (shrink)

Philosopher Vladimir Jankélévitch has only recently begun to receive his due from the English-speaking world, thanks in part to discussions of his thought by Jacques Derrida, Emmanuel Lévinas, and Paul Ricoeur. His international readers have long valued his unique, interdisciplinary approach to philosophy’s greatest questions and his highly readable writing style. Originally published in 1967, Le Pardon, or Forgiveness, is one of Jankélévitch’s most influential works. In it, he characterizes the ultimate ethical act of forgiving as behaving toward the (...) perpetrator as if he or she had never committed the action, rather than merely forgetting or rationalizing it—a controversial notion when considering events as heinous as the Holocaust. Like so many of Jankélévitch’s works, Forgiveness transcends standard treatments of moral problems, not simply generating a treatise on one subject but incorporating discussions of topics such as free will, giving, creativity, and temporality. Translator Andrew Kelley masterfully captures Jankélévitch’s melodic prose and, in a substantive introduction, reviews his life and intellectual contributions. Forgiveness is an essential part of that legacy, and this indispensable English translation provides key tools for understanding one of the great Western philosophers of the twentieth century. (shrink)

We find an explicit basis for all admissible rules of the modal logic S4. Our basis consists of an infinite sequence of rules which have compact and simple, readable form and depend on increasing set of variables. This gives a basis for all quasi-identities valid in the free modal algebra ℱS4 of countable rank.