ABSTRACT We consider several ways in which a good understanding of modern techniques and principles in physics can elucidate ecology, and we focus on analogical reasoning between these two branches of science. Analogical reasoning requires an understanding of both sciences and an appreciation of the similarities and points of contact between the two. In the current ecological literature on the relationship between ecology and physics, there has been some misunderstanding about the nature of modern physics and its methods. Physics is (...) seen as being much cleaner and tidier than ecology. When compared to this idealized, fictional version of physics, ecology looks very different, and the prospect of ecology and physics learning from one another is questionable. We argue that physics, once properly understood, is more like ecology than ecologists have thus far appreciated. Physicists and ecologists can and do learn from each other, and, in this paper, we outline how analogical reasoning can facilitate such exchanges. (shrink)

The standard mathematical models in population ecology assume that a population's growth rate is a function of its environment. In this paper we investigate an alternative proposal according to which the rate of change of the growth rate is a function of the environment and of environmental change. We focus on the philosophical issues involved in such a fundamental shift in theoretical assumptions, as well as on the explanations the two theories offer for some of the key data such as (...) cyclic populations. We also discuss the relationship between this move in population ecology and a similar move from first-order to second-order differential equations championed by Galileo and Newton in celestial mechanics. (shrink)

The environment in which humans evolved is strongly and positively autocorrelated in space and time. Probabilistic judgments based on the assumption of independence may not yield evolutionarily adaptive behavior. A number of “faults” of human reasoning are not faulty under fuzzy arithmetic, a nonprobabilistic calculus of reasoning under uncertainty that may be closer to that underlying human decision making.

The main focus of the book is the presentation of the 'inertial' view of population growth. This view provides a rather simple model for complex population dynamics, and is achieved at the level of the single species without invoking species interactions. An important part of this account is the maternal effect. Investment of mothers in the quality of their daughters makes the rate of reproduction of the current generation depend not only on the current environment, but also on the environment (...) experienced by the previous generation. (shrink)

We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant ‘true’ by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform reflection schemata in arithmetic, possibly of unrestricted logical complexity. We formulate an arithmetically complete calculus with modalities labeled by natural numbers and ω, where ω corresponds to the full uniform reflection schema, whereas n<ω corresponds to its restriction to arithmetical Πn+1-formulas. This (...) calculus is shown to be complete w.r.t. a suitable class of finite Kripke models and to be decidable in polynomial time. (shrink)

Provability logic GLP is well-known to be incomplete w.r.t. Kripke semantics. A natural topological semantics of GLP interprets modalities as derivative operators of a polytopological space. Such spaces are called GLP-spaces whenever they satisfy all the axioms of GLP. We develop some constructions to build nontrivial GLP-spaces and show that GLP is complete w.r.t. the class of all GLP-spaces.

A well-known polymodal provability logic inlMMLBox due to Japaridze is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in arithmetic. This system plays an important role in some recent applications of provability algebras in proof theory. However, an obstacle in the study of inlMMLBox is that it is incomplete w.r.t. any class of Kripke frames. In this paper we provide a complete Kripke semantics for inlMMLBox . First, we isolate a certain subsystem inlMMLBox (...) of inlMMLBox that is sound and complete w.r.t. a nice class of finite frames. Second, appropriate models for inlMMLBox are defined as the limits of chains of finite expansions of models for inlMMLBox . The techniques involves unions of n -elementary chains and inverse limits of Kripke models. All the results are obtained by purely modal-logical methods formalizable in elementary arithmetic. (shrink)

We elaborate Weiermann-style phase transitions for well-partial-orderings (wpo) determined by iterated finite sequences under Higman-Friedman style embedding with Gordeev’s symmetric gap condition. For every d-times iterated wpo \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\left({\rm S}\text{\textsc{eq}}^{d}, \trianglelefteq _{d}\right)}$$\end{document} in question, d > 1, we fix a natural extension of Peano Arithmetic, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${T \supseteq \sf{PA}}$$\end{document}, that proves the corresponding second-order sentence \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{WPO}\left({\rm (...) S}{\textsc{eq}}^{d}, \trianglelefteq _{d}\right) }$$\end{document}. Having this we consider the following parametrized first-order slow well-partial-ordering sentence \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{d}, \trianglelefteq _{d}, r\right):}$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( \forall K > 0 \right) \left( \exists M > 0\right) \left( \forall x_{0},\ldots,x_{M}\in {\rm S}\text{\textsc{eq}}^{d}\right)$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( \left( \forall i\leq M\right) \left( \left| x_{i}\right| 1}$$\end{document} then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{d}, \trianglelefteq _{d},r \right) }$$\end{document} is not provable in T.Moreover, by the well-known proof theoretic equivalences we can just as well replace T by PA or ACA0 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta _{1}^{1}\sf{CA}}$$\end{document}, if d = 2 and d = 3, respectively.In the limit case d → ∞ we replaceEFA-provably computable reals r by EFA-provably computable functions \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${f: \mathbb{N} \rightarrow \mathbb{R}_{+}}$$\end{document} and prove analogous theorems. (In the sequel we denote by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{R}_{+}}$$\end{document} the set of EFA-provably computable positive reals). In the basic case T = PA we strengthen the basic phase transition result by adding the following static threshold clause\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{2}, \trianglelefteq _{2}, 1\right)}$$\end{document} is still provable in T = PA (actually in EFA). Furthermore we prove the following dynamic threshold clauses which, loosely speaking are obtained by replacing the static threshold t by slowly growing functions 1α given by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${1_{\alpha }\left( i\right)\,{:=}\,1+\frac{1}{H_{\alpha }^{-1}\left(i\right) }, H_{\alpha}}$$\end{document} being the familiar fast growing Hardy function and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${H_{\alpha }^{-1}\left( i\right)\,{:=}\,\rm min \left\{ j \mid H_{\alpha } \left ( j\right) \geq i \right\}}$$\end{document} the corresponding slowly growing inversion. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\alpha < \varepsilon _{0}}$$\end{document}, then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{2}, \trianglelefteq _{2}, 1_{\alpha}\right)}$$\end{document} is provable in T = PA. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left( {\rm S}\text{\textsc{eq}}^{2}, \trianglelefteq _{2},1_{\varepsilon _{0}}\right)}$$\end{document} is not provable in T = PA. We conjecture that this pattern is characteristic for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${T\supseteq \sf{PA}}$$\end{document} under consideration and their proof-theoretical ordinals o (T ), instead of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varepsilon _{0}}$$\end{document}. (shrink)

Mohandas K. Gandhi (1869–1948)’s relationship with the Jews is explored in this article. The history of this relationship can be divided into two different periods. The first begins during his formative years in South Africa from 1893 to 1914, and the second, during his political activism in India thereafter. The article points out that Gandhi’s close Jewish associates in South Africa, although coming primarily from a Theosophist background, considered their support of Gandhi and his struggle to represent their core Jewish (...) values. Still, Gandhi’s close Jewish supporters did not successfully influence Gandhi regarding Zionism. In retrospect, Gandhi’s objection to Zionism enormously impacted the Indian Congress Party’s position regarding Palestine. The article notes that although Gandhi opposed political Zionism, he supported Zionism as a spiritual movement that could be best realized “within.” Somewhat surprising and little-known fact was a desire on Gandhi’s part to mediate between the Arabs and the Jews in direct talks. Gandhi hoped the Zionist leaders would respond positively to his offer to mediate so that he could advance his teachings of nonviolence while also claiming to represent the Indian Muslims. The article discusses Gandhi’s call to German and European Jews to resist the Nazi regime by adopting Satyagraha, the consequent rift with Jewry that followed, and his silence after the Holocaust. Finally, the article also briefly explores B. R. Ambedkar (1891–1956)’s views on the Jews and the Indian pariahs. (shrink)

ʻUmar II’s vast correspondence with governors is examined for the discussion of Islamization and acculturation. From the caliph’s point of view, these two processes had to be regulated and the dilemma was how to formulate a policy that was both in line with Islamic ethics and, at the same time, controlling Islamization by setting a high entrance bar for the converts. The struggle against acculturation attempted to preserve Muslim political dominance by controlling the administration.

This paper analyzes the creative interaction between Ivan Bunin and Lev Shestov. After providing constructive feedback on observations and reflections from the preceding scholarly literature on the subject the author argues that the main point of convergence between the writer and the philosopher is their works on Leo Tolstoy. The study includes a textual analysis of the elements of Shestovian discourse that were discovered in Bunin’s essay The Liberation of Tolstoy. The author argues that the ending of The Liberation of (...) Tolstoy can be understood only in the context of existentialist discourse. Bunin's objections to the Shestov's view of Chekhov’s creative work have been studied in detail. In general, Bunin does not appear to be a “disciple” of Shestov, as he is engaged in a philosophical dialogue with him on equal terms. Existentialism is the closest philosophical tradition to Bunin’s thought than any others that arose in the twentieth century. (shrink)

This article provides a re-assessment of Lev Shestov's existential philosophy in the context of the early French reception of Husserlian phenomenology.

Narrativist philosophy of history rejects all attempts to establish an epistemological link between the past and its historical representation. Two forms of narrativism should be distinguished. The first form attacks epistemology by stressing the autonomy of historical writing with regard to the past itself ; the second form does the same by de-contextualizing the elements of the past—the very idea of the past thus becomes problematic and epistemological queries can no longer even be formulated. The first form of narrativism is (...) synthetical, suggesting that the historian should construct broad panoramical views of the past ; the second, on the contrary, aims at a dispersive dissolution of the past. The article concentrates upon the dispersive form of narrativism. It is exemplified in Ginzburg's 'micro-storie'. The implication that these 'micro-storie' should not primarily be seen as historiography in the proper sense of the word but rather as a form of narrativist philosophy of history (expressing a theory of historical representation) is accepted wholeheartedly. It is shown that the 'micro-storie' come very close to Derrida's deconstructivist reading of texts. For in both cases we have to do with 'ruptures' announcing themselves in small, seemingly insignificant details. The conclusion of the article is that the synthetical and the dispersive forms of narrativism need each other and that we can give meaning to the concept of an objective historical reality only if we accept both of them. (shrink)

Розкрито сутність поняття «рейтинг». Доведено значущість рейтингової оцінки для суб’єктів фінансового ринку, зокрема для страхових компаній, потенційних страхувальників, інвесторів та кредиторів.

"I am a Jew who was born and who grew up in a Catholic country; I never had a religious education; my Jewish identity is in large measure the result of persecution." This brief autobiographical statement is a key to understanding Carlo Ginzburg's interest in the topic of his latest book: distance. In nine linked essays, he addresses the question: "What is the exact distance that permits us to see things as they are?" To understand our world, suggests (...) class='Hi'>Ginzburg, it is necessary to find a balance between being so close to the object that our vision is warped by familiarity or so far from it that the distance becomes distorting. Opening with a reflection on the sense of feeling astray, of familiarization and defamiliarization, the author goes on to consider the concepts of perspective, representation, imagery, and myth. Arising from the theme of proximity is the recurring issue of the opposition between Jews and Christians -- a topic Ginzburg explores with an impressive array of examples, from Latin translations of Greek and Hebrew scriptures to Pope John Paul II's recent apology to the Jews for antisemitism. Moving with equal acuity from Aristotle to Marcus Aurelius to Montaigne to Voltaire, touching on philosophy, history, philology, and ethics, and including examples from present-day popular culture, the book offers a new perspective on the universally relevant theme of distance. (shrink)

First English-language translation of Lev Shestov's early writings on faith, ancient philosophy and biblical revelation.

Progressions of iterated reflection principles can be used as a tool for the ordinal analysis of formal systems. We discuss various notions of proof-theoretic ordinals and compare the information obtained by means of the reflection principles with the results obtained by the more usual proof-theoretic techniques. In some cases we obtain sharper results, e.g., we define proof-theoretic ordinals relevant to logical complexity Π1 0 and, similarly, for any class Π n 0 . We provide a more general version of the (...) fine structure relationships for iterated reflection principles (due to U. Schmerl [25]). This allows us, in a uniform manner, to analyze main fragments of arithmetic axiomatized by restricted forms of induction, including IΣ n , IΣ n − , IΠ n − and their combinations. We also obtain new conservation results relating the hierarchies of uniform and local reflection principles. In particular, we show that (for a sufficiently broad class of theories T) the uniform Σ1-reflection principle for T is Σ2-conservative over the corresponding local reflection principle. This bears some corollaries on the hierarchies of restricted induction schemata in arithmetic and provides a key tool for our generalization of Schmerl's theorem. (shrink)

We suggest an algebraic approach to proof-theoretic analysis based on the notion of graded provability algebra, that is, Lindenbaum boolean algebra of a theory enriched by additional operators which allow for the structure to capture proof-theoretic information. We use this method to analyze Peano arithmetic and show how an ordinal notation system up to 0 can be recovered from the corresponding algebra in a canonical way. This method also establishes links between proof-theoretic ordinal analysis and the work which has been (...) done in the last two decades on provability logic and reflection principles. Because of its abstract algebraic nature, we hope that it will also be of interest for non-prooftheorists. (shrink)

For “natural enough” systems of ordinal notation we show that α times iterated local reflection schema over a sufficiently strong arithmetic T proves the same Π 1 0 -sentences as ω α times iterated consistency. A corollary is that the two hierarchies catch up modulo relative interpretability exactly at ε-numbers. We also derive the following more general “mixed” formulas estimating the consistency strength of iterated local reflection: for all ordinals α ⩾ 1 and all β, β ≡ Π 1 0 (...) T ω α · , α ≡ Π 1 0 T β + ω α . Here T α stands for α times iterated local reflection over T , T β stands for β times iterated consistency, and ≡ Π 1 0 denotes mutual Π 1 0 -conservativity. In an appendix to this paper we develop our notion of “natural enough” system of ordinal notation and show that such systems do exist for every recursive ordinal. (shrink)

Prominent thinkers such as Jurgen Habermas and Michael Sandel are warning that biomedical enhancements will undermine fundamental political values. Yet whether biomedical enhancements will undermine such values depends on how biomedical enhancements will function, how they will be administered and to whom. Since only few enhancements are obtainable, it is difficult to tell whether these predictions are sound. Nevertheless, such warnings are extremely valuable. As a society we must, at the very least, be aware of developments that could have harmful (...) consequences. Indeed, if important values were to be jeopardized, we should take appropriate measures to protect them. This paper focuses on four central values: solidarity, personal responsibility, equality and autonomy. It delineates the conditions under which biomedical enhancements would undermine these values. It also details the circumstances under which these values would be unaffected by enhancements as well as those under which they would be promoted. Specifying these conditions is valuable; it would enable society to prepare appropriate ethical guidelines and policy responses in advance. (shrink)

Analyzes principal forces that determined the direction of Camus' thought on ethics and political values.

This article concerns a silver beaker (now at the Residenzmuseum, Munich) decorated with scenes which seem to be related to the Spanish conquest of Mexico. On the basis of stylistic, iconographic and archival evidence the silversmith is here tentatively identified with an Italian-born artist, Stefano Capello, who is thought to have added a decoration to a pre-existing beaker on the eve of the treaty of Cambrai (3 August 1529). Margaret of Austria, aunt of the emperor Charles V, might have given (...) the beaker as a gift to Louise of Savoy, mother of Francis I, king of France. The article argues, relying upon Warburg’s notion of Pathosformeln (formulas of emotion), that in the early 16th century the New World was perceived and made familiar through an Old World idiom, based on visual formulas taken from classical antiquity and mediated by the Italian Renaissance. (shrink)

A well-known result states that, over basic Kalmar elementary arithmetic EA, the induction schema for ∑n formulas is equivalent to the uniform reflection principle for ∑n + 1 formulas . We show that fragments of arithmetic axiomatized by various forms of induction rules admit a precise axiomatization in terms of reflection principles as well. Thus, the closure of EA under the induction rule for ∑n formulas is equivalent to ω times iterated ∑n reflection principle. Moreover, for k < ω, k (...) times iterated ∑n reflection principle over EA precisely corresponds to the extension of EA by k nested applications of ∑n induction rule.The above relationship holds in greater generality than just stated. In fact, we give general formulas characterizing in terms of iterated reflection principles the extension of any given theory by k nested applications of ∑n or Πn induction rules. In particular, the closure of a theory T under just one application of ∑1 induction rule is equivalent to T together with ∑1 reflection principle for each finite Π2 axiomatized subtheory of T.These results have closely parallel ones in the theory of subrecursive function classes. The rules under study correspond, in a canonical way, to natural closure operators on the classes of provably recursive functions. Thus, ∑1 induction rule precisely corresponds to the primitive recursive closure operator, and ∑1 collection rule, introduced below, corresponds to the elementary closure operator. (shrink)

"Williams's masterful translation satisfies (at last!) a long-standing need. There are lots of good translations of Augustine's great work, but until now we have been forced to choose between those that strive to replicate in English something of the majesty and beauty of Augustine's Latin style and those that opt instead to convey the careful precision of his philosophical terminology and argumentation. Finally, Williams has succeeded in capturing both sides of Augustine's mind in a richly evocative, impeccably reliable, elegantly readable (...) presentation of one of the most impressive achievements in Western thought--Augustine's Confessions." --Scott MacDonald, Professor of Philosophy and Norma K. Regan Professor in Christian Studies, Cornell University. (shrink)