By Solovay’s celebrated completeness result [31] on formal provability we know that the provability logic ${\textbf {GL}}$ describes exactly all provable structural properties for any sound and strong enough arithmetical theory with a decidable axiomatisation. Japaridze generalised this result in [22] by considering a polymodal version ${\mathsf {GLP}}$ of ${\textbf {GL}}$ with modalities $[n]$ for each natural number n referring to ever increasing notions of provability. Modern treatments of ${\mathsf {GLP}}$ tend to interpret the $[n]$ provability notion as “provable in (...) a base theory T together with all true $\Pi ^0_n$ formulas as oracles.” In this paper we generalise this interpretation into the transfinite. In order to do so, a main difficulty to overcome is to generalise the syntactical characterisations of the oracle formulas of complexity $\Pi ^0_n$ to the hyper-arithmetical hierarchy. The paper exploits the fact that provability is $\Sigma ^0_1$ complete and that similar results hold for stronger provability notions. As such, the oracle sentences to define provability at level $\alpha $ will recursively be taken to be consistency statements at lower levels: provability through provability whence the name of the paper. The paper proves soundness and completeness for the proposed interpretation for a wide class of theories, namely for any theory that can formalise the recursion described above and that has some further very natural properties. Some remarks are provided on how the recursion can be formalised into second order arithmetic and on lowering the proof-theoretical strength of these systems of second order arithmetic. (shrink)

Turing progressions have been often used to measure the proof-theoretic strength of mathematical theories: iterate adding consistency of some weak base theory until you “hit” the target theory. Turing progressions based on n-consistency give rise to a \ proof-theoretic ordinal \ also denoted \. As such, to each theory U we can assign the sequence of corresponding \ ordinals \. We call this sequence a Turing-Taylor expansion or spectrum of a theory. In this paper, we relate Turing-Taylor expansions of sub-theories (...) of Peano Arithmetic to Ignatiev’s universal model for the closed fragment of the polymodal provability logic \. In particular, we observe that each point in the Ignatiev model can be seen as Turing-Taylor expansions of formal mathematical theories. Moreover, each sub-theory of Peano Arithmetic that allows for a Turing-Taylor expansion will define a unique point in Ignatiev’s model. (shrink)

This paper is a presentation of astatus quæstionis, to wit of the problemof the interpretability logic of all reasonablearithmetical theories.We present both the arithmetical side and themodal side of the question.Dedicated to Dick de Jongh on the occasion of his 60th birthday.

Vardanyan’s Theorems [36, 37] state that $\mathsf {QPL}(\mathsf {PA})$ —the quantified provability logic of Peano Arithmetic—is $\Pi ^0_2$ complete, and in particular that this already holds when the language is restricted to a single unary predicate. Moreover, Visser and de Jonge [38] generalized this result to conclude that it is impossible to computably axiomatize the quantified provability logic of a wide class of theories. However, the proof of this fact cannot be performed in a strictly positive signature. The system $\mathsf (...) {QRC_1}$ was previously introduced by the authors [1] as a candidate first-order provability logic. Here we generalize the previously available Kripke soundness and completeness proofs, obtaining constant domain completeness. Then we show that $\mathsf {QRC_1}$ is indeed complete with respect to arithmetical semantics. This is achieved via a Solovay-type construction applied to constant domain Kripke models. As corollaries, we see that $\mathsf {QRC_1}$ is the strictly positive fragment of $\mathsf {QGL}$ and a fragment of $\mathsf {QPL}(\mathsf {PA})$. (shrink)

In this paper we will state and prove some comparative theorems concerning PRA and IΣ1. We shall provide a characterization of IΣ1 in terms of PRA and iterations of a class of functions. In particular, we prove that for this class of functions the difference between IΣ1 and PRA is exactly that, where PRA is closed under iterations of these functions, IΣ1 is moreover provably closed under iteration. We will formulate a sufficient condition for a model of PRA to be (...) a model of IΣ1. This condition is used to give a model-theoretic proof of Parsons’ theorem, that is, IΣ1 is Π2-conservative over PRA. We shall also give a purely syntactical proof of Parsons’ theorem. Finally, we show that IΣ1 proves the consistency of PRA on a definable IΣ1-cut. This implies that proofs in IΣ1 can have non-elementary speed up over proofs in PRA. (shrink)

For any ordinal $\Lambda$, we can define a polymodal logic $\mathsf{GLP}_\Lambda$, with a modality $[\xi]$ for each $\xi < \Lambda$. These represent provability predicates of increasing strength. Although $\mathsf{GLP}_\Lambda$ has no Kripke models, Ignatiev showed that indeed one can construct a Kripke model of the variable-free fragment with natural number modalities, denoted $\mathsf{GLP}^0_\omega$. Later, Icard defined a topological model for $\mathsf{GLP}^0_\omega$ which is very closely related to Ignatiev's. In this paper we show how to extend these constructions for arbitrary $\Lambda$. (...) More generally, for each $\Theta,\Lambda$ we build a Kripke model $\mathfrak I^\Theta_\Lambda$ and a topological model $\mathfrak T^\Theta_\Lambda$, and show that $\mathsf{GLP}^0_\Lambda$ is sound for both of these structures, as well as complete, provided $\Theta$ is large enough. (shrink)

Ordinal functions may be iterated transfinitely in a natural way by taking pointwise limits at limit stages. However, this has disadvantages, especially when working in the class of normal functions, as pointwise limits do not preserve normality. To this end we present an alternative method to assign to each normal function f a family of normal functions Hyp[f]=〈fξ〉ξ∈OnHyp[f]=〈fξ〉ξ∈On, called its hyperation, in such a way that f0=idf0=id, f1=ff1=f and fα+β=fα∘fβfα+β=fα∘fβ for all α, β.Hyperations are a refinement of the Veblen hierarchy (...) of f. Moreover, if f is normal and has a well-behaved left-inverse g called a left adjoint, then g can be assigned a cohyperationcoH[g]=〈gξ〉ξ∈OncoH[g]=〈gξ〉ξ∈On, which is a family of initial functions such that gξgξ is a left adjoint to fξfξ for all ξ. (shrink)

The provability logic of a theory $T$ is the set of modal formulas, which under any arithmetical realization are provable in $T$. We slightly modify this notion by requiring the arithmetical realizations to come from a specified set $\Gamma$. We make an analogous modification for interpretability logics. We first study provability logics with restricted realizations and show that for various natural candidates of $T$ and restriction set $\Gamma$, the result is the logic of linear frames. However, for the theory Primitive (...) Recursive Arithmetic (PRA), we define a fragment that gives rise to a more interesting provability logic by capitalizing on the well-studied relationship between PRA and I$\Sigma_1$. We then study interpretability logics, obtaining upper bounds for IL(PRA), whose characterization remains a major open question in interpretability logic. Again this upper bound is closely related to linear frames. The technique is also applied to yield the nontrivial result that IL(PRA) $\subset$ ILM. (shrink)

Een vrije en veerkrachtige samenleving ontstaat niet vanzelf en blijft niet vanzelf bestaan. In dit themanummer verkennen we de publieke onderwijstaak van het hoger beroepsonderwijs om studenten te onderwijzen de gemeenschappelijke wereld én het publieke gesprek over die wereld centraal te stellen. Met dit themanummer willen wij iets tegenover het vigerende marktdenken zetten. We laten ons hierbij inspireren door het gedachtegoed van Hannah Arendt (1906–1975). Ze heeft uitgebreid geschreven over ‘het publieke’. Ze verbindt de inzet van wetenschappelijke kennis en technologie (...) met het politieke vraagstuk: willen we daadwerkelijk leven in de wereld die we aan het scheppen zijn? Arendts gedachtegoed biedt volop handvatten om op verschillende niveaus van het hoger beroepsonderwijs deze taak te doordenken en invulling te geven. (shrink)

In this paper we carry out a comparative study of $\mathrm{I}\Sigma_1$ and PRA. We will in a sense fully determine what these theories have to say about each other in terms of provability and interpretability. Our study will result in two arithmetically complete modal logics with simple universal models.

In this paper we carry out a comparative study of and PRA. We will in a sense fully determine what these theories have to say about each other in terms of provability and interpretability. Our study will result in two arithmetically complete modal logics with simple universal models.

A fast consistency prover is a consistent polytime axiomatized theory that has short proofs of the finite consistency statements of any other polytime axiomatized theory. Krajíček and Pudlák have proved that the existence of an optimal propositional proof system is equivalent to the existence of a fast consistency prover. It is an easy observation that NP = coNP implies the existence of a fast consistency prover. The reverse implication is an open question. In this paper we define the notion of (...) an unlikely fast consistency prover and prove that its existence is equivalent to NP = coNP. Next it is proved that fast consistency provers do not exist if one considers RE axiomatized theories rather than theories with an axiom set that is recognizable in polynomial time. (shrink)

The provability logic of a theory T captures the structural behavior of formalized provability in T as provable in T itself. Like provability, one can formalize the notion of relative interpretability giving rise to interpretability logics. Where provability logics are the same for all moderately sound theories of some minimal strength, interpretability logics do show variations.The logic IL is defined as the collection of modal principles that are provable in any moderately sound theory of some minimal strength. In this article (...) we raise the previously known lower bound of IL by exhibiting two series of principles which are shown to be provable in any such theory. Moreover, we compute the collection of frame conditions for both series. (shrink)

The notion of a critical successor [5] in relational semantics has been central to most classic modal completeness proofs in interpretability logics. In this paper we shall work with a more general notion, that of an assuring successor. This will enable more concisely formulated completeness proofs, both with respect to ordinary and generalised Veltman semantics. Due to their interesting theoretical properties, we will devote some space to the study of a particular kind of assuring labels, the so‐called full labels and (...) maximal labels. After a general treatment of assuringness, we shall apply it to obtain a completeness result for the modal logic w.r.t. generalised semantics for a restricted class of frames. (shrink)

Turing progressions arise by iteratedly adding consistency statements to a base theory. Different notions of consistency give rise to different Turing progressions. In this paper we present a logic that generates exactly all relations that hold between these different Turing progressions given a particular set of natural consistency notions. Thus, the presented logic is proven to be arithmetically sound and complete for a natural interpretation, named the formalized Turing progressions interpretation.

The paper presents an exploration of conceptual issues that have arisen in the course of investigating speed-up and slowdown phenomena in small Turing machines, in particular results of a test that may spur experimental approaches to the notion of computational irreducibility. The test involves a systematic attempt to outrun the computation of a large number of small Turing machines (3 and 4 state, 2 symbol) by means of integer sequence prediction using a specialized function for that purpose. The experiment prompts (...) an investigation into rates of convergence of decision procedures and the decidability of sets in addition to a discussion of the (un)predictability of deterministic computing systems in practice. We think this investigation constitutes a novel approach to the discussion of an epistemological question in the context of a computer simulation, and thus represents an interesting exploration at the boundary between philosophical concerns and computational experiments. (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)

Let T be a second-order arithmetical theory, Λ a well-order, λ < Λ and X ⊆ ℕ. We use $[\lambda |X]_T^{\rm{\Lambda }}\varphi$ as a formalization of “φ is provable from T and an oracle for the set X, using ω-rules of nesting depth at most λ”.For a set of formulas Γ, define predicative oracle reflection for T over Γ ) to be the schema that asserts that, if X ⊆ ℕ, Λ is a well-order and φ ∈ Γ, then$$\forall \,\lambda (...) < {\rm{\Lambda }}\,.$$In particular, define predicative oracle consistency ) as Pred–O–RFN{0=1}.Our main result is as follows. Let ATR0 be the second-order theory of Arithmetical Transfinite Recursion, ${\rm{RCA}}_0^{\rm{*}}$ be Weakened Recursive Comprehension and ACA be Arithmetical Comprehension with Full Induction. Then,$${\rm{ATR}}_0 \equiv {\rm{RCA}}_0^{\rm{*}} + {\rm{Pred - O - Cons\ }}\left \equiv {\rm{RCA}}_0^{\rm{*}} + \,{\rm{Pred - O - Cons\ }}\left \equiv {\rm{RCA}}_0^{\rm{*}} + \,{\rm{Pred - O - RFN}}\,_{{\bf{\Pi }}_2^1 } \left.$$We may even replace ${\rm{RCA}}_0^{\rm{*}}$ by the weaker ECA0, the second-order analogue of Elementary Arithmetic.Thus we characterize ATR0, a theory often considered to embody Predicative Reductionism, in terms of strong reflection and consistency principles. (shrink)

In this paper, we study IL(), the interpretability logic of . As is neither an essentially reflexive theory nor finitely axiomatizable, the two known arithmetical completeness results do not apply to : IL() is not or . IL() does, of course, contain all the principles known to be part of IL, the interpretability logic of the principles common to all reasonable arithmetical theories. In this paper, we take two arithmetical properties of and see what their consequences in the modal logic (...) IL() are. These properties are reflected in the so-called Beklemishev Principle , and Zambella’s Principle , neither of which is a part of IL. Both principles and their interrelation are submitted to a modal study. In particular, we prove a frame condition for . Moreover, we prove that follows from a restricted form of . Finally, we give an overview of the known relationships of IL() to important other interpretability principles. (shrink)

Of all the developments in twentieth century physics, none has given rise to more heated debates than the changes in our understanding of science precipitated by the quantum revolution''. In this revolution, Niels Bohr's dramatically non-classical theory of the atom proved to be the springboard from which the new atomic physics drew it's momentum. Furthermore, Bohr's contribution was crucial not only because his interpretation of quantum mechanics became the most widely accepted view but also because in his role as educator (...) and spokesman for atomic physics Bohr was very much the patron spirit of the entire quantum revolution. The conceptual framework which he proposed to provide a new viewpoint for understanding the quantum theoretical description of atomic systems became for most of this century the dominant outlook of countless productive experimental and theoretical physicists. He called this new framework complementarity''. (shrink)

Trope theory is a leading metaphysical theory in analytic ontology. One of its classic statements is found in the work of Donald C. Williams who argued that tropes qua abstract particulars are the very alphabet of being. The concept of an abstract particular has been repeatedly attacked in the literature. Opponents and proponents of trope theory alike have levelled their criticisms at the abstractness of tropes and the associated act of abstraction. In this paper I defend the concept of a (...) trope qua abstract particular by rejecting arguments that purport to show that tropes should not be understood as abstract and by arguing that the abstractness of tropes plays an indispensable role in one of our more promising trope-theoretic analyses of universals and of concrete objects. (shrink)

v. 1. Nicomachean ethics. Politics. The Athenian Constitution. Rhetoric. On Poetics.--v. 2. Logic.--v. 3. Physics. Metaphysics. On the soul. Short physical treaties.--v. 4. On the heavens. On generation and corruption. Meteorology. Biological treatises.

In Working Virtue: Virtue Ethics and Contemporary Moral Problems, leading figures in the fields of virtue ethics and ethics come together to present the first ...

The concept of instantiation is realized differently across a variety of metaphysical theories. A certain realization of the concept in a given theory depends on what roles are specified and associated with the concept and its corresponding term as well as what entities are suited to fill those roles. In this paper, the classic realization of the concept of instantiation in a one-category ontology of abstract particulars or tropes is articulated in a novel way and defended against unaddressed objections.

Fifteen essays addressing conceptions of individualism and holism as they emerged in Chinese literature and philosophy from the time of Confucius and Chuang-tzu to the present.

Human languages vary in many ways but also show striking cross-linguistic universals. Why do these universals exist? Recent theoretical results demonstrate that Bayesian learners transmitting language to each other through iterated learning will converge on a distribution of languages that depends only on their prior biases about language and the quantity of data transmitted at each point; the structure of the world being communicated about plays no role (Griffiths & Kalish, , ). We revisit these findings and show that when (...) certain assumptions about the relationship between language and the world are abandoned, learners will converge to languages that depend on the structure of the world as well as their prior biases. These theoretical results are supported with a series of experiments showing that when human learners acquire language through iterated learning, the ultimate structure of those languages is shaped by the structure of the meanings to be communicated. (shrink)

In management research, theory testing confronts a paradox described by Meehl in which designing studies with greater methodological rigor puts theories at less risk of falsification. This paradox exists because most management theories make predictions that are merely directional, such as stating that two variables will be positively or negatively related. As methodological rigor increases, the probability that an estimated effect will differ from zero likewise increases, and the likelihood of finding support for a directional prediction boils down to a (...) coin toss. This paradox can be resolved by developing theories with greater precision, such that their propositions predict something more meaningful than deviations from zero. This article evaluates the precision of theories in management research, offers guidelines for making theories more precise, and discusses ways to overcome barriers to the pursuit of theoretical precision. (shrink)

Rooted in the field of cathedral studies, this paper draws into dialogue three bodies of knowledge: Edward Bailey’s notion of implicit religion that, among other things, highlights the continuing traction of the Christian tradition and Christian practice within secular societies; David Walker’s notion of the multiple ways through which in secular societies people may relate to the Christian tradition as embodied within the Anglican Church and John Fisher’s notion of spiritual wellbeing as conceptualised in relational terms. Against this conceptual background, (...) this paper draws on data provided by 1234 participants attending one of the Christmas Eve carol services in Liverpool Cathedral to explore the perceived impact of attendance on the spiritual health of people who do not believe in God and yet feel that Liverpool Cathedral is their cathedral, and it is this sense of belonging that brings them back at Christmas time.Contribution: Situated within the science of cathedral studies, this paper links in an original way three fields of discourse: Edward Bailey’s notion of implicit religion, David Walker’s notion of the four ways of belonging to God facilitated by the Anglican Church and John Fisher’s conceptualisation and operationalisation of the notion of spiritual wellbeing. The hypothesis developed from this original integration of theoretical perspectives is then tested empirically on data provided by 404 participants at carol services who do not believe in God. (shrink)

This article has two objectives. First, and in particular, it seeks to reinterpret the ostracism procedure of early democratic Athens. Since Aristotle, this has been understood as a rational, political weapon of collective defense, intended to expel from Athens a disproportionately powerful individual. In this article, by putting emphasis on themateriality, gestures, and location of ostraka-casting, I propose instead that the institution can more fruitfully be understood as a ritual enactment of civic unity. Second, and more generally, I hope to (...) explore the frames within which early Athenian democracy is placed: while Greek kingship and tyranny (i.e. “primitive” polities) have been very successfully explored through anthropological and cross-cultural comparison, Greek democracy for the most part has remained in the domains of the institutional historian and political theorist. Taking a phenomenological and comparative approach, this article asks how the citizens of early democratic Athens experienced and comprehended their new sovereignty and the invented procedures of mass decision-making through which it was expressed. (shrink)

I INTRODUCTION: RESPECT, EQUALITY AND THE AUTONOMY OF MORALITY We often invoke a notion of respect to express our sense of human equality. ...

The mechanistic theory of life.--Criticism of the mechanistic theory.--Biology and the physical sciences.--Personality.

This book is unified by three broad concerns: the rationality of belief in God, the relation between religion and morality, and the explication of the concept of God. The essays are, however, marked by diversity. Some focus on historical figures, such as Aquinas and Locke; others bring recent epistemological and metaphysical developments to bear on problems of religious belief. Some of the papers explore neglected issues central to religious practice, such as the question of how total devotion to God can (...) permit other deep commitments; others apply philosophical distinctions from within a religious tradition, for example, in setting out a Christian approach to the problem of evil. (shrink)