“A little masterpiece of originality and clarity.”—George Steiner “A necessary book.”—Roberto Saviano “A wonderful little book that will delight you.”—François Busnel International Best Seller / Now in English for the First Time In this thought-provoking and extremely timely work, Nuccio Ordine convincingly argues for the utility of useless knowledge and against the contemporary fixation on utilitarianism—for the fundamental importance of the liberal arts and against the damage caused by their neglect. Inspired by the reflections of great philosophers and writers (e.g., (...) Plato, Dante, Montaigne, Shakespeare, Borges, and Calvino), Ordine reveals how the obsession for material goods and the cult of utility ultimately wither the spirit, jeopardizing not only schools and universities, art, and creativity, but also our most fundamental values—human dignity, love, and truth. Also included is Abraham Flexner’s 1939 essay “The Usefulness of Useless Knowledge,” which originally prompted Ordine to write this book. Flexner—a founder and the first director of the Institute for Advanced Study in Princeton—offers an impassioned defense of curiosity-driven research and learning. (shrink)

In this highly original study, Nuccio Ordine uses the figure of the ass as a lens through which to focus on the thought and writings of the great Renaissance humanist philosopher Giordano Bruno.

Pensar en el cine como ocasión y potencia del pensamiento significa en efecto, en primer lugar, sustraer la imagen contemporánea del dominio de los estudios especializados y, en segundo lugar, pensar a partir de aquello que el cine crea (como recordaba Deleuze): esto es, las imágenes mismas. El cine redescubre su potencia a través de sus propias formas. Entrevistas de la revista italiana Fata Morgana con: Jacques Rancière, Roberto Esposito, Jean-luc Nancy, Slavoj Zizek, Julia Kristeva, Werner Herzog, Raúl Ruiz, Yervant (...) Gianikian, Ángela Ricci Lucchi, Edgar Reitz, Paul Schraoer, Georges Didi-Huberman, Jean-Louis Comolli, Nuccio Ordine. (shrink)

Higher-order logic, with its type-theoretic apparatus known as the simple theory of types (STT), has increasingly come to be employed in theorizing about properties, relations, and states of affairs—or ‘intensional entities’ for short. This paper argues against this employment of STT and offers an alternative: ordinal type theory (OTT). Very roughly, STT and OTT can be regarded as complementary simplifications of the ‘ramified theory of types’ outlined in the Introduction to Principia Mathematica (on a realist reading). While STT, understood as (...) a theory of intensional entities, retains the Fregean division of properties and relations into a multiplicity of categories according to their adicities and ‘input types’ and discards the division of intensional entities into different ‘orders’, OTT takes the opposite approach: it retains the hierarchy of orders (though with some modifications) and discards the categorisation of properties and relations according to their adicities and input types. In contrast to STT, this latter approach avoids intensional counterparts of the Epimenides and related paradoxes. Fundamental intensional entities lie at the base of the proposed hierarchy and are also given a prominent part to play in the individuation of non-fundamental intensional entities. (shrink)

It is natural and important to have a formal representation of plain belief, according to which propositions are held true, or held false, or neither. (In the paper this is called a deterministic representation of epistemic states). And it is of great philosophical importance to have a dynamic account of plain belief. AGM belief revision theory seems to provide such an account, but it founders at the problem of iterated belief revision, since it can generally account only for one step (...) of revision. The paper discusses and rejects two solutions within the confines of AGM theory. It then introduces ranking functions (as I prefer to call them now; in the paper they are still called ordinal conditional functions) as the proper (and, I find, still the best) solution of the problem, proves that conditional independence w.r.t. ranking functions satisfies the so-called graphoid axioms, and proposes general rules of belief change (in close analogy to Jeffrey's generalized probabilistic conditionalization) that encompass revision and contraction as conceived in AGM theory. Indeed, the parallel to probability theory is amazing. Probability theory can profit from ranking theory as well since it is also plagued by the problem of iterated belief revision even if probability measures are conceived as Popper measures (see No. 11). Finally, the theory is compared with predecessors which are numerous and impressive, but somehow failed to explain the all-important conditional ranks in the appropriate way. (shrink)

It is widely held that under ordinal utility, utility differences are ill-defined. Allegedly, for these to be well-defined (without turning to choice under risk or the like), one should adopt as a new kind of primitive quaternary relations, instead of the traditional binary relations underlying ordinal utility functions. Correlatively, it is also widely held that the key structural properties of quaternary relations are entirely arbitrary from an ordinal point of view. These properties would be, in a nutshell, the hallmark of (...) cardinal utility. While much is obviously true in these two tenets, this note explains why, as stated, they should be abandoned. Any ordinal utility function induces a rich quaternary relation. There is such a thing as ordinal utility differences. Furthermore, this induced quaternary relation respects, apart from completeness, the most standard structural properties of quaternary relations. These properties are, from an ordinal point of view, anything but arbitrary; from a quaternary perspective only completeness should be considered the hallmark—if any—of cardinal utility. These facts are explained to be especially relevant to the critical appreciation of the ordinalist methodology. (shrink)

Any set x is uniquely specified by the graph of the membership relation on the set obtained by adjoining x to the transitive closure of x. Thus any operation on sets can be looked at as an operation on these graphs. We look at the operations of ordinal arithmetic of sets in this light. This turns out to be simplest for a modified ordinal arithmetic based on the Zermelo ordinals, instead of the usual von Neumann ordinals. In this (...) arithmetic, addition of sets corresponds to concatenating graphs, and multiplication corresponds to replacing each edge of a graph by a copy of another graph. Characterizations for the von Neumann case are also given. (shrink)

There are multiple formal characterizations of the natural numbers available. Despite being inter-derivable, they plausibly codify different possible applications of the naturals – doing basic arithmetic, counting, and ordering – as well as different philosophical conceptions of those numbers: structuralist, cardinal, and ordinal. Some influential philosophers of mathematics have argued for a non-egalitarian attitude according to which one of those characterizations is ‘more basic’ or ‘more fundamental’ than the others. This paper addresses two related issues. First, we review some of (...) these non-egalitarian arguments, lay out a laundry list of different, legitimate, notions of relative priority, and suggest that these arguments plausibly employ different such notions. Secondly, we argue that given a metaphysical-cum-epistemological gloss suggested by Frege's foundationalist epistemology, the ordinals are plausibly more basic than the cardinals. This is just one orientation to relative priority one could take, however. Ultimately, we subscribe to an egalitarian attitude towards these formal characterizations: they are, in some sense, equally ‘legitimate’. (shrink)

There are multiple formal characterizations of the natural numbers available. Despite being inter-derivable, they plausibly codify different possible applications of the naturals – doing basic arithmetic, counting, and ordering – as well as different philosophical conceptions of those numbers: structuralist, cardinal, and ordinal. Nevertheless, some influential philosophers of mathematics have argued for a non-egalitarian attitude according to which one of those characterizations is more “legitmate” in virtue of being “more basic” or “more fundamental”. This paper addresses two related issues. First, (...) we review some of these non-egalitarian arguments, lay out a laundry list of different, legitimate, notions of relative priority, and suggest that these arguments plausibly employ different such notions. Secondly, we argue that given a metaphysical-cum-epistemological gloss suggested by Frege’s foundationalist epistomology, the ordinals are plausibly more basic than the cardinals. This is just one orientation to relative priority one could take, however. Ultimately, we subscribe to an egalitarian attitude towards these formal characterizations: they are, in some sense, equally “legitimate”. (shrink)

The “high school algebra” laws of exponentiation fail in the ordinal arithmetic of sets that generalizes the arithmetic of the von Neumann ordinals. The situation can be remedied by using an alternative arithmetic of sets, based on the Zermelo ordinals, where the high school laws hold. In fact the Zermelo arithmetic of sets is uniquely characterized by its satisfying the high school laws together with basic properties of addition and multiplication. We also show how in both arithmetics the (...) behavior of exponentiation depends on whether the empty set is an element of the base. (shrink)

Abstract.This paper is the second in a series of three culminating in an ordinal analysis of Π12-comprehension. Its objective is to present an ordinal analysis for the subsystem of second order arithmetic with Δ12-comprehension, bar induction and Π12-comprehension for formulae without set parameters. Couched in terms of Kripke-Platek set theory, KP, the latter system corresponds to KPi augmented by the assertion that there exists a stable ordinal, where KPi is KP with an additional axiom stating that every set is contained (...) in an admissible set. (shrink)

The first attempt at a systematic approach to axiomatic theories of truth was undertaken by Friedman and Sheard (Ann Pure Appl Log 33:1–21, 1987). There twelve principles consisting of axioms, axiom schemata and rules of inference, each embodying a reasonable property of truth were isolated for study. Working with a base theory of truth conservative over PA, Friedman and Sheard raised the following questions. Which subsets of the Optional Axioms are consistent over the base theory? What are the proof-theoretic strengths (...) of the consistent theories? The first question was answered completely by Friedman and Sheard; all subsets of the Optional Axioms were classified as either consistent or inconsistent giving rise to nine maximal consistent theories of truth.They also determined the proof-theoretic strength of two subsets of the Optional Axioms. The aim of this paper is to continue the work begun by Friedman and Sheard. We will establish the proof-theoretic strength of all the remaining seven theories and relate their arithmetic part to well-known theories ranging from PA to the theory of ${\Sigma^1_1}$ dependent choice. (shrink)

Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to transfinite working time and space. In particular, recognizability, randomness, and applications to other areas of mathematics, including set theory and model theory, are covered.

For every partial combinatory algebra, we define a hierarchy of extensionality relations using ordinals. We investigate the closure ordinals of pca’s, i.e., the smallest ordinals where these relations become equal. We show that the closure ordinal of Kleene’s first model is ${\omega _1^{\textit {CK}}}$ and that the closure ordinal of Kleene’s second model is $\omega _1$. We calculate the exact complexities of the extensionality relations in Kleene’s first model, showing that they exhaust the hyperarithmetical hierarchy. We also (...) discuss embeddings of pca’s. (shrink)

We present an analogue of Gödel’s second incompleteness theorem for systems of second-order arithmetic. Whereas Gödel showed that sufficiently strong theories that are $\Pi ^0_1$ -sound and $\Sigma ^0_1$ -definable do not prove their own $\Pi ^0_1$ -soundness, we prove that sufficiently strong theories that are $\Pi ^1_1$ -sound and $\Sigma ^1_1$ -definable do not prove their own $\Pi ^1_1$ -soundness. Our proof does not involve the construction of a self-referential sentence but rather relies on ordinal analysis.

Abstract.This paper is the first in a series of three which culminates in an ordinal analysis of Π12-comprehension. On the set-theoretic side Π12-comprehension corresponds to Kripke-Platek set theory, KP, plus Σ1-separation. The strength of the latter theory is encapsulated in the fact that it proves the existence of ordinals π such that, for all β>π, π is β-stable, i.e. Lπ is a Σ1-elementary substructure of Lβ. The objective of this paper is to give an ordinal analysis of a scenario (...) of not too complicated stability relations as experience has shown that the understanding of the ordinal analysis of Π12-comprehension is greatly facilitated by explicating certain simpler cases first.This paper introduces an ordinal representation system based on ν-indescribable cardinals which is then employed for determining an upper bound for the proof–theoretic strength of the theory KPi+ ∀ρ ∃ππ is π+ρ-stable, where KPi is KP augmented by the axiom saying that every set is contained in an admissible set. (shrink)

Dynamic ordinal analysis is ordinal analysis for weak arithmetics like fragments of bounded arithmetic. In this paper we will define dynamic ordinals – they will be sets of number theoretic functions measuring the amount of sΠ b 1(X) order induction available in a theory. We will compare order induction to successor induction over weak theories. We will compute dynamic ordinals of the bounded arithmetic theories sΣ b n (X)−L m IND for m=n and m=n+1, n≥0. Different dynamic (...) class='Hi'>ordinals lead to separation. In this way we will obtain several separation results between these relativized theories. We will generalize our results to further languages extending the language of bounded arithmetic. (shrink)

The philosophy of medicine cum bioethics has become the socially recognized source for moral and epistemic direction in health-care decision-making. Over the last three decades, this field has been accepted politically as an authorized source of guidance for policy and law. The field's political actors have included the National Commission for the Protection of Human Subjects of Biomedical and Behavioral Research, the Department of Health, Education, and Welfare, the President's Commission for the Study of Ethical Problems in Medicine and Biomedical (...) and Behavioral Research , the National Bioethics Advisory Commission, and the new Council on Bioethics; these groups and agencies have set forth rules on issues ranging from the role of humans in biomedical research to the production of human embryos for research, the definition of death, and the permissibility of human cloning. The members of the field are not just scholars and teachers in an academic realm directed to both theoretical and applied issues. They are, in addition, practitioners of a conceptual and moral trade that possesses a legal and political standing. This essay critically addresses the sudden emergence of bioethics as a societally recognized source of moral guidance, a source replete with authorized moral experts. Attention is directed to moral and conceptual assumptions that have led the philosophy of medicine, and especially bioethics, to acquire a quasi-juridical/political role in guiding clinical choices, framing health-care policy, and directing court holdings. (shrink)

Assume [Formula: see text]. Let [Formula: see text] be a [Formula: see text] equivalence relation coded in [Formula: see text]. [Formula: see text] has an ordinal definable equivalence class without any ordinal definable elements if and only if [Formula: see text] is unpinned. [Formula: see text] proves [Formula: see text]-class section uniformization when [Formula: see text] is a [Formula: see text] equivalence relation on [Formula: see text] which is pinned in every transitive model of [Formula: see text] containing the real (...) which codes [Formula: see text]: Suppose [Formula: see text] is a relation on [Formula: see text] such that each section [Formula: see text] is an [Formula: see text]-class, then there is a function [Formula: see text] such that for all [Formula: see text], [Formula: see text]. [Formula: see text] proves that [Formula: see text] is Jónsson whenever [Formula: see text] is an ordinal: For every function [Formula: see text], there is an [Formula: see text] with [Formula: see text] in bijection with [Formula: see text] and [Formula: see text]. (shrink)

The class of all ordinal numbers can be partitioned into two subclasses in such a way that neither subclass contains an arithmetic progression of order type ω, where an arithmetic progression of order type τ means an increasing sequence of ordinal numbers γ r, δ ≠ 0.

Though the Random Utility Model (RUM) was conceived entirely in terms of ordinal utility, the apparatus through which it is widely practised exhibits properties of cardinal utility. The adoption of cardinal utility as a working operation of ordinal is perfectly valid, provided interpretations drawn from that operation remain faithful to ordinal utility. The article considers whether the latter requirement holds true for several measurements commonly derived from RUM. In particular it is found that measurements of consumer surplus change may depart (...) from ordinal utility, and exploit the cardinality inherent in the practical apparatus. (shrink)

Taking up ordinal notations derived from Skolem hull operators familiar in the field of infinitary proof theory we develop a toolkit of ordinal arithmetic that generally applies whenever ordinal structures are analyzed whose combinatorial complexity does not exceed the strength of the system of set theory. The original purpose of doing so was inspired by the analysis of ordinal structures based on elementarity invented by T.J. Carlson, see [T.J. Carlson, Elementary patterns of resemblance, Annals of Pure and Applied Logic 108 (...) 19–77], [G. Wilken, Σ1-Elementarity and Skolem hull operators, Annals of Pure and Applied Logic 145 162–175], and [G. Wilken, Assignment of ordinals to patterns of resemblance, The Journal of Symbolic Logic ]. Within the arithmetical context laid bare in this work, the “-numbers” play a role analogous to the role epsilon numbers play in the ordinal arithmetic based on the notion of Cantor normal form. (shrink)

We consider two variants of transfinite induction, one with monotonicity assumption on the predicate and one with the induction hypothesis only for cofinally many below. The latter can be seen as a transfinite analogue of the successor induction, while the usual transfinite induction is that of cumulative induction. We calculate the supremum of ordinals along which these schemata for \ formulae are provable in \. It is shown to be larger than the proof-theoretic ordinal \ by power of base (...) 2. We also show a similar result for the structural transfinite induction, defined with fundamental sequences. (shrink)

We will introduce a partial ordering $\preceq_1$ on the class of ordinals which will serve as a foundation for an approach to ordinal notations for formal systems of set theory and second-order arithmetic. In this paper we use $\preceq_1$ to provide a new characterization of the ubiquitous ordinal $\epsilon _{0}$.

The ordination of women in the Church of England has had a long hard road. Other denominations, and other parts of the Anglican Communion took the step, but it was not until the 1990s that the first women priests were ordained in the Church of England itself. Even then, Emma Percy describes the situation as an ‘ambiguous welcome’. Careful provision has been made at every stage for those who not only will not accept women as priests, but require the service (...) of bishops who have not participated in the ordination of women. The path to acceptance for women bishops has also been lengthy and subject to the same caveats and provisions. Percy argues that this reveals an underlying failure to think theologically about gender. She recognizes that there are still profound inequalities in the Church’s treatment of women in leadership. (shrink)

We generalize standard Turing machines, which work in time ω on a tape of length ω, to α-machines with time α and tape length α, for α some limit ordinal. We show that this provides a simple machine model adequate for classical admissible recursion theory as developed by G. Sacks and his school. For α an admissible ordinal, the basic notions of α-recursive or α-recursively enumerable are equivalent to being computable or computably enumerable by an α-machine, respectively. We emphasize the (...) algorithmic approach to admissible recursion theory by indicating how the proof of the Sacks–Simpson theorem, i.e., the solution of Post’s problem in α-recursion theory, could be based on α-machines, without involving constructibility theory. (shrink)

The paper relativizes the method of ordinal analysis developed for Kripke–Platek set theory to theories which have the power set axiom. We show that it is possible to use this technique to extract information about Power Kripke–Platek set theory, KP.As an application it is shown that whenever KP+AC proves a ΠP2 statement then it holds true in the segment Vτ of the von Neumann hierarchy, where τ stands for the Bachmann–Howard ordinal.

The philosophy of medicine cum bioethics has become the socially recognized source for moral and epistemic direction in health-care decision-making. Over the last three decades, this field has been accepted politically as an authorized source of guidance for policy and law. The field's political actors have included the National Commission for the Protection of Human Subjects of Biomedical and Behavioral Research, the Department of Health, Education, and Welfare, the President's Commission for the Study of Ethical Problems in Medicine and Biomedical (...) and Behavioral Research, the National Bioethics Advisory Commission, and the new Council on Bioethics; these groups and agencies have set forth rules on issues ranging from the role of humans in biomedical research to the production of human embryos for research, the definition of death, and the permissibility of human cloning. The members of the field are not just scholars and teachers in an academic realm directed to both theoretical and applied issues. They are, in addition, practitioners of a conceptual and moral trade that possesses a legal and political standing. This essay critically addresses the sudden emergence of bioethics as a societally recognized source of moral guidance, a source replete with authorized moral experts. Attention is directed to moral and conceptual assumptions that have led the philosophy of medicine, and especially bioethics, to acquire a quasi-juridical/political role in guiding clinical choices, framing health-care policy, and directing court holdings. (shrink)

In this paper, we are concerned with the preorderings (SS) and (BC) induced in the set of players of a simple game by the Shapley–Shubik and the Banzhaf–Coleman's indices, respectively. Our main result is a generalization of Tomiyama's 1987 result on ordinal power equivalence in simple games; more precisely, we obtain a characterization of the simple games for which the (SS) and the (BC) preorderings coincide with the desirability preordering (T), a concept introduced by Isbell (1958), and recently reconsidered by (...) Taylor (1995): this happens if and only if the game is swap robust, a concept introduced by Taylor and Zwicker (1993). Since any weighted majority game is swap robust, our result is therefore a generalization of Tomiyama's. Other results obtained in this paper say that the desirability relation keeps itself in all the veto-holder extensions of any simple game, and so does the (SS) preordering in all the veto-holder extensions of any swap robust simple game. (shrink)