The problem of infinities in quantum field theory (QFT) is a longstanding problem in particle physics. To solve this problem, different renormalization techniques have been suggested but the problem persists. Here we suggest another approach to the elimination of infinities in QFT, which is based on non-Diophantine arithmetics – a novel mathematical area that already found useful applications in physics, psychology, and other areas. To achieve this goal, new non-Diophantine arithmetics are constructed and their properties are studied. In addition, non-Diophantine (...) integration is developed in these arithmetics. These constructions allow using constructed non-Diophantine arithmetics for computing integrals associated with Feynman diagrams. Although in the conventional QFT such integrals diverge, their non-Diophantine counterparts are convergent and rigorously defined. As the result, QFT becomes consistent with quantum experiments. (shrink)

In this paper, I attempt to describe Mark Burgin’s results in non-Diophantine mathematics, which are important for the foundation of mathematics and its application in quantum field theory. In particular, the elimination of divergences in quantum electrodynamics is described.

Der Band nimmt gewisse, mit dem Begriff Theurgie assoziierte Wandlungen innerhalb des spätantiken Neuplatonismus in den Blick. Theurgie wird vor allem als Suche nach immanenten Medien zur Verkörperung göttlicher Kräfte verstanden. Entgegen dem häufig kolportierten Bild vom weltflüchtigen Platonismus zielt die von Iamblichos und seinen Nachfolgern verfochtene Philosophie, so die Grundthese, auf Integration der körperlich-materiellen Wirklichkeitsebenen ab und das Endziel der Philosophie wird stärker unter dem Gesichtspunkt einer positiven Teilhabe am demiurgisch-kosmogonischen Werk begriffen. Diese Aufwertung von Körperlichkeit wird anhand verschiedener (...) Aspekte – z. B. dem Symbolbegriff, der „göttlichen Materie", aber auch des feinstofflichen Ochema-Pneuma-Konzepts – in ihrer Relevanz für das spirituelle Gesamtprofil der theurgischen Neuplatoniker erstmals umfassender untersucht. Abgerundet wird die Studie durch einen Vergleich mit ähnlichen Tendenzen im nicht-dualistischen Śivaismus von Kaschmir. (shrink)

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)

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)

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)

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)

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)

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.

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

Relying on aesthetic testimony seems problematic. For instance, it seems problematic for me to simply believe or assert that The Velvet Underground's debut album The Velvet Underground and Nico (1964) is amazing solely because you have told me so, even though I know you to be an honest and competent music critic. But why? After all, there do not seem to be similar reservations regarding testimony from many other domains. In this paper, I will argue that relying on aesthetic testimony (...) seems problematic because we are attached to an ideal of aesthetic authenticity and feel that living up to this ideal is anathema to simply relying on aesthetic testimony. (shrink)

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)

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.

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)

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)

Many philosophers, following Williamson (The Philosophical Review 105(4): 489–523, 1996), Williamson (Knowledge and its Limits, Oxford, Oxford Univer- sity Press, 2000), subscribe to the constitutive rule account of assertion (CRAA). They hold that the activity of asserting is constituted by a single constitutive rule of assertion. However, in recent work, Maitra (in: Brown & Cappelen (ed). Assertion: new philosophical essays, Oxford, Oxford University Press, 2011), Johnson (Acta Analytica 33(1): 51–67, 2018), and Kelp and Simion (Synthese 197(1): 125–137, 2020a), Kelp and (...) Simion (in: Goldberg (ed) The Oxford Handbook of Assertion, Oxford, Oxford University Press, 2020b) aim to show that, for all the most popular versions of the constitutive rule of assertion proposed in the literature, asserting is not an activity constituted by a single constitutive rule and that therefore CRAA is very likely false. To reach this conclusion, they all present a version of what can be dubbed the engagement condition objection. That is, they each propose a necessary condition on engaging in rule-constituted activities. Then they argue that, for all the most popular versions of the constitutive rule of assertion proposed in the literature, one can make assertions without satisfying this condition. In response, I present a counterexample that shows that the proposed engagement conditions lead to coun- terintuitive results, and I propose an alternative that better captures our intuitions. Then I argue that this alternative engagement condition is compatible with all the most popular versions of the constitutive rule of assertion. (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.

How does one arrive at a life in politics and policy? What happens to one's ideals when confronted with the reality that the only way to get things done in Washington is compromise? Who are the men and women who help shape our national agenda, and what drives their work? Dispatches From the Eastern Front provides fascinating, intensely personal, yet universal answers to these central questions. Recounting four decades inside Washington politics, Gerald Felix Warburg brings remarkable candor to a (...) most unusual memoir. An idealistic California baby boomer transported to the intimidating world of Capitol Hill policymaking at a young age, Warburg finds himself working to reform nuclear energy, strategic arms control, and foreign policy. As his access and power grow, greater challenges loom: how to maintain principles while cutting deals, and how to balance public purpose with private interests. An eclectic career reveals the slow and often painful development of emotional intelligence for work at the highest reaches of the public arena. (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.

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)

In moral and political philosophy, collective obligations are promising “gap-stoppers” when we find that we need to assert some obligation, but can not plausibly ascribe this obligation to individual agents. Most notably, Bill Wringe and Jesse Tomalty discuss whether the obligations that correspond to socio-economic human rights are held by states or even by humankind at large. The present paper aims to provide a missing piece for these discussions, namely an account of the conditions under which obligations can apply to (...) loose collections of agents that do not qualify as collective agents in their own right. I first explain the notion of joint obligations of loose collections of agents as opposed to collective obligations of collections of agents that are collective agents in their own right, and argue that the conditions under which agents can jointly have obligations are the conditions under which they are jointly able to do what is required. I then build on Virginia Held’s seminal work on the moral responsibility of “random collections” to develop such conditions for joint ability. My discussion shows that collections of individuals can more easily be subject to moral obligations than previously assumed. It also shows that putative joint obligations need to be carefully time-indexed, and that it is largely an empirical question whether a given collection can be subject to a moral obligation to perform a given joint action at a particular time. (shrink)

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)

When several agents together produce suboptimal outcomes, yet no individual could have made a difference for the better, Act Consequentialism counterintuitively judges that all involved agents act rightly. I address this problem by supplementing Act Consequentialism with a requirement of modal robustness: Agents not only ought to produce best consequences in the actual world, but they also ought to be such that they would act optimally in certain counterfactual scenarios. I interpret this Modally Robust Act Consequentialism as Act Consequentialism plus (...) a requirement of moral virtue, namely, to reliably act rightly and to act rightly for the right reasons. (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)

Who should be recognized as a refugee? This article seeks to uncover the normative arguments at the core of legal and philosophical conceptions of refugeehood. It identifies three analytically dist...

What is political about political refugeehood? Theorists have assumed that refugees are special because their specific predicament as those who are persecuted sets them aside from other “necessitous strangers.” Persecution is a special form of wrongful harm that marks the repudiation of a person's political membership and that cannot—contrary to certain other harms—be remedied where they are. It makes asylum necessary as a specific remedial institution. In this article, I argue that this is correct. Yet, the connection between political membership, (...) its repudiation, and persecution is far from clear. Drawing on normative political thought and research on autocracies, repression, and migration studies, I show that it is political oppression that marks the repudiation of political membership and leads to various forms of repression that can equally not be remedied at home. A truly political account moves away from persecution and endorses political oppression as the normative pillar of refugeehood and asylum. (shrink)

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)

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)

Who should be recognized as a refugee? This article seeks to uncover the normative arguments at the core of legal and philosophical conceptions of refugeehood. It identifies three analytically distinct approaches grounding the right to refugee status and argues that all three are normatively inadequate. Refugee status should neither be grounded in individual persecution for specific reasons (classical approach) nor in individual persecution for any discriminatory reasons (human rights approach). It should also not be based solely on harm (humanitarian approach). (...) Rather, this article argues, it should be based on political oppression – on persons lacking public autonomy, formally expressed as a lack of legal–political status. The normative foundation for a claim to refugee status lies in the inability of a person to control, amend and seek recourse to the specific situation she faces. It lies in the lack of public autonomy expressed as a lack of legal–political rights. What matters for a claim to refugee status is thus the legal–political disenfranchisement of a person, ultimately leaving her with no recourse to the particular situation she faces other than flight. Refugees, then, are not only those who fear harm or persecution, but those who are politically oppressed. (shrink)

Bilattices, introduced by Ginsberg as a uniform framework for inference in artificial intelligence, are algebraic structures that proved useful in many fields. In recent years, Arieli and Avron developed a logical system based on a class of bilattice-based matrices, called logical bilattices, and provided a Gentzen-style calculus for it. This logic is essentially an expansion of the well-known Belnap–Dunn four-valued logic to the standard language of bilattices. Our aim is to study Arieli and Avron’s logic from the perspective of abstract (...) algebraic logic . We introduce a Hilbert-style axiomatization in order to investigate the properties of the algebraic models of this logic, proving that every formula can be reduced to an equivalent normal form and that our axiomatization is complete w.r.t. Arieli and Avron’s semantics. In this way, we are able to classify this logic according to the criteria of AAL. We show, for instance, that it is non-protoalgebraic and non-self-extensional. We also characterize its Tarski congruence and the class of algebraic reducts of its reduced generalized models, which in the general theory of AAL is usually taken to be the algebraic counterpart of a sentential logic. This class turns out to be the variety generated by the smallest non-trivial bilattice, which is strictly contained in the class of algebraic reducts of logical bilattices. On the other hand, we prove that the class of algebraic reducts of reduced models of our logic is strictly included in the class of algebraic reducts of its reduced generalized models. Another interesting result obtained is that, as happens with some implicationless fragments of well-known logics, we can associate with our logic a Gentzen calculus which is algebraizable in the sense of Rebagliato and Verdú . We also prove some purely algebraic results concerning bilattices, for instance that the variety of distributive bilattices is generated by the smallest non-trivial bilattice. This result is based on an improvement of a theorem by Avron stating that every bounded interlaced bilattice is isomorphic to a certain product of two bounded lattices. We generalize it to the case of unbounded interlaced bilattices. (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.