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)

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)

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

This article compares the sections on the qualities desirable in a wife in Abū Ḥāmid al-Ghazālī’s Iḥyāʾ ʿulūm al-dīn and Bar Hebraeus’s Ethicon, which the West Syrian writer modeled on al-Ghazālī’s work. The article first establishes that al-Ghazālī based his profile of the ideal wife on a jurisprudential discussion of the topic by his teacher, Imām al-Ḥaramayn al-Juwaynī, expanding it, however, by adding anecdotes from Sufi literature and reasoned arguments on how “the good wife” will best facilitate her husband’s devotion (...) to God. The article then moves to consider how Bar Hebraeus appropriates, reconfigures, and reframes as Christian teaching al-Ghazālī’s discussion. Finally, the article argues that the similarity between the two texts demonstrates that both carve out a particular notion of male piety intelligible and resonant in their different religious traditions and in the broader monotheistic culture of the premodern Middle East. (shrink)

The Many-Worlds Interpretation (MWI) is an approach to quantum mechanics according to which, in addition to the world we are aware of directly, there are many other similar worlds which exist in parallel at the same space and time. The existence of the other worlds makes it possible to remove randomness and action at a distance from quantum theory and thus from all physics.

Denić ( 2018, 2019, To appear ) observes that the availability of distributive inferences—for sentences with disjunction embedded in the scope of a universal quantifier—depends on the size of the domain quantified over as it relates to the number of disjuncts. Based on her observations, she argues that probabilistic considerations play a role in the computation of implicatures. In this paper we explore a different possibility. We argue for a modification of Denić’s generalization, and provide an explanation that is based (...) on intricate logical computations but is blind to probabilities. The explanation is based on the observation that when the domain size is no larger than the number of disjuncts, universal and existential alternatives are equivalent if distributive inferences are obtained. We argue that under such conditions a general ban on ‘fatal competition’ (Magri 2009a, b, Spector 2014 ) is activated, thereby predicting distributive inferences to be unavailable. (shrink)

ThevariationunderdomesticationhasbeenstudiedbyevolutionarybiologysincethebeginningoftheDarwinistrese archprogramme,highlightingartificialselectionasapartofthedevelopmentoftheconceptofnaturalselection.R ecently,nicheconstructiontheoryhasbeenusedtoanalyzetheprocessofdomesticationwhichhashistoricallybeen partofsociallifeforhumanbeings.Inthepresentworkwemakeanapproachtotheimplicationsofartificialselectio nasanelementinthelineofdialecticaltensionbetweennatureandsociety.WeanalyzefromaMarxistperspectivethe elementsofcontinuityanddiscontinuitythatthereproductionofa“secondnature”introducesintheprocessofnich econstruction.Wefocusonthepoliticdimensionofusevalue(Echeverría2001)asanemergingprocessinthere-produ ctionofasocialandculturalidentityinhumansocieties.Inthisworkwefocusondomesticatedplants.Theexistence ofatelosorsubjacentintentionalityconfiguresdistinctivefeaturesofhumannicheconstruction(Zeder2009)and centrallyofartificialselection.Thereproductionofasecondnatureisdirectedbyateloswhichisnotonlynornece ssarilyrelatedtothemagnitudeofresourcesappropriatedbyhumanbeings,butalsotothegenerationofusevalueada ptedtoacertainformofsociallifethatisrecreatedandgivenplace:apoliticdimension.

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)

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)

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.

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)

This is a philosophical paper in favor of the many-worlds interpretation of quantum theory. The necessity of introducing many worlds is explained by analyzing a neutron interference experiment. The concept of the “measure of existence of a world” is introduced and some difficulties with the issue of probability in the framework of the MWI are resolved.

What is the most important reason for using Computer Vision methods in humanities research? In this article, I argue that the use of numerical representation and data analysis methods offers a new language for describing cultural artifacts, experiences and dynamics. The human languages such as English or Russian that developed rather recently in human evolution are not good at capturing analog properties of human sensorial and cultural experiences. These limitations become particularly worrying if we want to compare thousands, millions or (...) billions of artifacts—i.e. to study contemporary media and cultures at their new twenty-first century scale. When we instead use numerical measurements of image properties standard in Computer Vision, we can better capture details of a single artifact as well as visual differences between a number of artifacts–even if they are very small. The examples of visual dimensions that numbers can capture better then languages include color, shape, texture, contours, composition, and visual characteristics of represented faces, bodies and objects. The methods of finding structures and relationships in large numerical datasets developed in statistics and machine learning allow us to extend this analysis to very big datasets of cultural objects. Equally importantly, numerical image features used in Computer Vision also give us a new language to represent gradual and continuous temporal changes—something which natural languages are also bad at. This applies to both single artworks such as a film or a dance piece and also to changes in visual characteristics in millions of artifacts over decades or centuries. (shrink)

Recently, the variety of the financial frauds have increased, while the number of victims became difficult to estimate. The purpose of this paper is to present the main profiles of financial frauds’ victims using a reviewing method. The analysis captures the main theoretical and empirical background regarding the motives and circumstances of becoming a victim, the dynamics of several social and demographical characteristics of this type of victims, as well as a sample of relevant case studies from some developing countries. (...) The main finding is that, in literature, most of the victims are male people of different ages, employed, married or single, regardless the level of education. For developing countries such as China, India and Nigeria, the majority of victims act out of naivety and desire to escape from poverty, while some victims from Latin America, China and Nigeria are influenced by greed and lack of empathy, without thinking of further consequences for their families and friends involved. Moreover, most of the victims are convinced to invest in financial schemes by family members, friends, or acquaintances. (shrink)

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 introduce the logics GLP Λ, a generalization of Japaridze’s polymodal provability logic GLP ω where Λ is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall provide a reduction of these logics to GLP ω yielding among other things a finitary proof of the normal form theorem for the variable-free fragment of GLP Λ and the decidability of GLP Λ for recursive orderings Λ. Further, we give a restricted axiomatization of the variable-free fragment (...) of GLP Λ. (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)

By a result of Paris and Friedman, the collection axiom schema for $\Sigma_{n+1}$ formulas, $B\Sigma_{n+1}$ , is $\Pi_{n+2}$ conservative over $I\Sigma_n$ . We give a new proof-theoretic proof of this theorem, which is based on a reduction of $B\Sigma_n$ to a version of collection rule and a subsequent analysis of this rule via Herbrand's theorem. A generalization of this method allows us to improve known results on reflection principles for $B\Sigma_n$ and to answer some technical questions left open by Sieg (...) [23] and Hájek [9]. We also give a new proof of independence of $B\Sigma_{n+1}$ over $I\Sigma_n$ by a direct recursion-theoretic argument and answer an open problem formulated by Gaifman and Dimitracopoulos [8]. (shrink)

It is argued that the many-worlds interpretation is by far the best interpretation of quantum mechanics. The key points of this view are viewing the wave functions of worlds in three dimensions and understanding probability through self-locating uncertainty.

Social network structure has been argued to shape the structure of languages, as well as affect the spread of innovations and the formation of conventions in the community. Specifically, theoretical and computational models of language change predict that sparsely connected communities develop more systematic languages, while tightly knit communities can maintain high levels of linguistic complexity and variability. However, the role of social network structure in the cultural evolution of languages has never been tested experimentally. Here, we present results from (...) a behavioral group communication study, in which we examined the formation of new languages created in the lab by micro‐societies that varied in their network structure. We contrasted three types of social networks: fully connected, small‐world, and scale‐free. We examined the artificial languages created by these different networks with respect to their linguistic structure, communicative success, stability, and convergence. Results did not reveal any effect of network structure for any measure, with all languages becoming similarly more systematic, more accurate, more stable, and more shared over time. At the same time, small‐world networks showed the greatest variation in their convergence, stabilization, and emerging structure patterns, indicating that network structure can influence the community's susceptibility to random linguistic changes (i.e., drift). (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)

Reviewed Works:Dick de Jongh, Franco Montagna, Provable Fixed Points.Dick de Jongh, Franco Montagna, Much Shorter Proofs.Alessandra Carbone, Franco Montagna, Rosser Orderings in Bimodal Logics.Alessandra Carbone, Franco Montagna, Much Shorter Proofs: A Bimodal Investigation.

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)

Historically, appearance of the quantum theory led to a prevailing view that Nature is indeterministic. The arguments for the indeterminism and proposals for indeterministic and deterministic approaches are reviewed. These include collapse theories, Bohmian Mechanics and the many-worlds interpretation. It is argued that ontic interpretations of the quantum wave function provide simpler and clearer physical explanation and that the many-worlds interpretation is the most attractive since it provides a deterministic and local theory for our physical Universe explaining the illusion of (...) randomness and nonlocality in the world we experience. (shrink)

Le messianisme fait à la fois partie des principaux articles de foi du Judaïsme et appelle en même temps son renversement lorsqu’il se réalise de manière effective. Le messianisme s’exprime alors à travers une critique de la loi comme impératif catégorique, étatique et particulariste exercée par une instance transcendante. Saint-Paul incarne très certainement le fer de lance de cette révolution messianique au fondement de l’universalisme. Cette inauguration d’une loi immanente au sujet destinée à supplanter la loi transcendante du Judaïsme se (...) prolonge à travers un certain nombre de figures de la modernité, notamment celles de Spinoza et Freud. Le messianisme n’est pas à entendre ici comme pure et simple trahison de la loi juive mais au contraire comme révélation d’une fracture qui lui appartient originellement. (shrink)

We study the fragment of Peano arithmetic formalizing the induction principle for the class of decidable predicates, $I\Delta_1$ . We show that $I\Delta_1$ is independent from the set of all true arithmetical $\Pi_2-sentences$ . Moreover, we establish the connections between this theory and some classes of oracle computable functions with restrictions on the allowed number of queries. We also obtain some conservation and independence results for parameter free and inference rule forms of $\Delta_1-induction$ . An open problem formulated by J. (...) Paris is whether $I\Delta_1$ proves the corresponding least element principle for decidable predicates, $L\Delta_1$ (or, equivalently. the $\Sigma_1-collection$ principle $B\Sigma_1$ ). We reduce this question to a purely computation-theoretic one. (shrink)

It is argued that, although in the Many-Worlds Interpretation of quantum mechanics there is no ``probability'' for an outcome of a quantum experiment in the usual sense, we can understand why we have an illusion of probability. The explanation involves: a). A ``sleeping pill'' gedanken experiment which makes correspondence between an illegitimate question: ``What is the probability of an outcome of a quantum measurement?'' with a legitimate question: ``What is the probability that ``I'' am in the world corresponding to that (...) outcome?''; b). A gedanken experiment which splits the world into several worlds which are identical according to some symmetry condition; and c). Relativistic causality, which together with explain the Born rule of standard quantum mechanics. The Quantum Sleeping Beauty controversy and ``caring measure'' replacing probability measure are discussed. (shrink)

We investigate the bimodal logics sound and complete under the interpretation of modal operators as the provability predicates in certain natural pairs of arithmetical theories . Carlson characterized the provability logic for essentially reflexive extensions of theories, i.e. for pairs similar to . Here we study pairs of theories such that the gap between and is not so wide. In view of some general results concerning the problem of classification of the bimodal provability logics we are particularly interested in such (...) pairs that is axiomatized over by ∏1-sentences only, and, for each n 1, proves the n-times iterated consistency of . A complete axiomatization, along with the appropriate Kripke semantics and decision procedures, is found for the two principal cases: finitely axiomatizable extensions of this sort, like e.g. ), ), etc., and reflexive extensions, like ¦n 1\s}), etc. We show that the first logic, ICP, is the minimal and the second one, RP, is the maximal within the class of the provability logics for such pairs of theories. We also show that there are some provability logics lying strictly between these two. As an application of the results of this paper, in the last section the polymodal provability logics for natural recursive progressions of theories based on iteration of consistency are characterized. We construct a system of ordinal notation , which gives exactly one notation to each constructive ordinal, such that the logic corresponding to any progression along coincides with that along natural Kalmar elementary well-orderings. (shrink)

Argument of this text is that: to develop aesthetics of sport, we should not begin with aesthetics as philosophy of art but with aesthetics of everyday life; to start with aesthetics of sport, we should not begin with beautiful of ‘pure aesthetics’ but with the dramatic; to analyze the dramatic in sport, we should not open the analysis with analogy between theater and sport, but with sport as a sort of performance; to get at the meaning of sport as a (...) drama, we have to discuss different meanings ‘drama’ has in theory and everyday communication; to map the dramatic in sport as performance, we have to discuss some features of sport which determine its dramatics first, and its potential as spectacle later. To proceed with the argument, we have to take into account contemporary state of aesthetics, recent development of aesthetics of everyday life, and theory of performance, together with Bernard Suits’ definition of game, Gadamer’s idea of play, and Lévy-Strauss’ account on conjunctive and disjunctive ritual. (shrink)

Translation of Lev Shestov's What is Philosophy?

We study the arithmetical schema asserting that every eventually decreasing elementary recursive function has a limit. Some other related principles are also formulated. We establish their relationship with restricted parameter-free induction schemata. We also prove that the same principle, formulated as an inference rule, provides an axiomatization of the Σ2-consequences of IΣ1.Using these results we show that ILM is the logic of Π1-conservativity of any reasonable extension of parameter-free Π1-induction schema. This result, however, cannot be much improved: by adapting a (...) theorem of D. Zambella and G. Mints we show that the logic of Π1-conservativity of primitive recursive arithmetic properly extends ILM.In the third part of the paper we give an ordinal classification of -consequences of the standard fragments of Peano arithmetic in terms of reflection principles. This is interesting in view of the general program of ordinal analysis of theories, which in the most standard cases classifies Π-classes of sentences. (shrink)

The paper deals with the conception of logical empiricism developed by Eino Kaila. Eino Kaila, being a thinker close to the Vienna Circle, departs from some of the central ideas of logical positivism. He identifies a limited number of problems in metaphysics that are meaningful and need to be solved, but he declares the rest of metaphysics to be a logical fallacy. For Eino Kaila, it is not the principle of verification (as a criterion of meaning) but the principle of (...) testability that plays the most important role. In addition, he revises the principle of translatability, insisting that it is impossible to translate a single sentence into the language of experience, but it is possible to translate the whole theory to which the sentence belongs. This is related to his structuralist position in the philosophy of science and his understanding of scientific theories as ‘rationalisations’ as opposed to simple inductive generalisations. The paper compares Eino Kaila’s views expressed during the period of his active interaction with the Vienna Circle be regarded as a predecessor of later critics of logical positivism (in particular, W.V.O. Quine). (shrink)

We characterize the bimodal provability logics for certain natural (classes of) pairs of recursively enumerable theories, mostly related to fragments of arithmetic. For example, we shall give axiomatizations, decision procedures, and introduce natural Kripke semantics for the provability logics of (IΔ 0 + EXP, PRA); (PRA, IΣ 1 ); (IΣ m , IΣ n ) for $1 \leq m etc. For the case of finitely axiomatized extensions of theories these results are extended to modal logics with propositional constants.