In this article we introduce systems for metapredicative Mahlo in explicit mathematics and admissible set theory. The exact upper prooftheoretic bounds of these systems are established. 1 Introduction In classical set theory an ordinal # is called a Mahlo ordinal if it is a regular cardinal and if, for every normal function f from # to #, there exists a regular cardinal less than # so that {f(#) : # < } # . The statement that there exists a Mahlo ordinal is a powerful set existence axiom going beyond theories like ZFC. It also outgrows the existence of inaccessible cardinals, hyper inaccessibles, hyperhyperinaccessible and the like. There is also an obvious recursive analogue of Mahlo ordinal. Typically, an ordinal # is baptized recursively Mahlo, if it is admissible and reflects every # 2 sentence on a smaller admissible ordinal. The corresponding formal theory KPM has been proof-theoretically analyzed by Rathjen [14, 15]. KPM is a highly impredicative theory, and its proof-the...

This paper deals with universes in explicit mathematics. After introducing some basic definitions, the limit axiom and possible ordering principles for universes are discussed. Later, we turn to least universes, strictness and name induction. Special emphasis is put on theories for explicit mathematics with universes which are proof-theoretically equivalent to Feferman's T 0 . 1 Introduction In some form or another, universes play an important role in many systems of set theory and higher order arithmetic, in various formalizations of constructive mathematics and in logics for computation. One aspect of universes is that they expand the set or type formation principles in a natural and perspicuous way and provide greater expressive power and proof-theoretic strength. The general idea behind universes is quite simple: suppose that we are given a formal system Th comprising certain set (or type) existence principles which are justified on specific philosophical grounds. Then it may be a...

In this article we provide wellordering proofs for metapredicative systems of explicit mathematics and admissible set theory featuring suitable axioms about the Mahloness of the underlying universe of discourse. In particular, it is shown that in the corresponding theories EMA of explicit mathematics and KPm 0 of admissible set theory, transfinite induction along initial segments of the ordinal ##00, for # being a ternary Veblen function, is derivable. This reveals that the upper bounds given for these two systems in the paper Jager and Strahm [11] are indeed sharp. 1 Introduction This paper is a companion to the article Jager and Strahm [11], where systems of explicit mathematics and admissible set theory for metapredicative Mahlo are introduced. Whereas the main concern of [11] was to establish proof-theoretic upper bounds for these systems, in this article we provide the corresponding wellordering proofs, thus showing that the upper bounds derived in [11] are sharp. The central...

We define a realizability interpretation of Aczel's Constructive Set Theory CZF into Explicit Mathematics. The final results are that CZF extended by Mahlo principles is realizable in corresponding extensions of T0 , thus providing relative lower bounds for the proof-theoretic strength of the latter. Introduction Several di#erent frameworks have been founded in the 70-es aiming to give a foundation for constructive mathematics. The most well-developed of them nowadays are Martin-Lof type theory, Aczel's constructive set theory, and Feferman's explicit mathematics. While constructive set theory was built to have an immediate type interpretation, no theory stronger than # 1 2 -CA, which proof-theoretically is still far below the basic system T 0 of Explicit Mathematics, have been shown up to now to be directly embeddable into explicit systems. It also yielded that the only method for establishing lower bounds for T 0 and its extensions remained to be well-ordering proofs. This omissi...

The goals of reduction and reductionism in the natural sciences are mainly explanatory in character, while those in mathematics are primarily foundational. In contrast to global reductionist programs which aim to reduce all of mathematics to one supposedly "universal " system or foundational scheme, reductive proof theory pursues local reductions of one formal system to another which is more justified in some sense. In this direction, two specific rationales have been proposed as aims for reductive proof theory, the constructive consistency-proof rationale and the foundational reduction rationale. However, recent advances in proof theory force one to consider the viability of these rationales. Despite the genuine problems of foundational significance raised by that work, the paper concludes with a defense of reductive proof theory at a minimum as one of the principal means to lay out what rests on what in mathematics. In an extensive appendix to the paper, various reducti...

After briefly discussing the concepts of predicativity, metapredicativity and impredicativity, we turn to the notion of Mahloness as it is treated in various contexts. Afterwards the

Justification logics are modal logics that include justifications for the agent’s knowledge. So far, there are no decidability results available for justification logics with negative introspection. In this paper, we develop a novel model construction for such logics and show that justification logics with negative introspection are decidable for finite constant specifications. 1

We give a broad discussion of reflection principles in explicit mathematics, thereby addressing various kinds of universe existence principles. The proof-theoretic strength of the relevant systems of explicit mathematics is couched in terms of suitable extensions of Kripke-Platek set theory. 1

Up to now there was no interpretation available for -calculi featuring overloading and late-binding, although these are two of the main principles of any object-oriented programming language. In this paper we provide a new semantics for a stratied version of Castagna's fg , a -calculus combining overloading with late-binding. The model-construction is carried out in EETJ + (Tot) + (F-I N ), a system of explicit mathematics. We will prove the soundness of our model with respect to subtyping, type-checking and reductions. Furthermore, we show that our semantics yields a solution to the problem of loss of information in the context of type dependent computations. Keywords: Explicit mathematics, typed -calculus, overloading, late-binding, loss of information. 1 Introduction Polymorphism is one of the concepts to which the object-oriented paradigm owes its power. The distinction is made between parametric (or universal) and \ad hoc" polymorphism. Using parametric polymorp...

The point of departure for this panel is a somewhat controversial paper that I published in the American Mathematical Monthly under the title “Does mathematics need new axioms? ” [4]. The paper itself was based on a lecture that I gave in 1997 to a joint session of the American Mathematical Society and the Mathematical Association of America, and it was thus written for a general mathematical audience. Basically, it was intended as an assessment of Gödel’s program for new axioms that he had advanced most prominently in his 1947 paper for the Monthly, entitled “What is Cantor’s continuum problem? ” [7]. My paper aimed to be an assessment of that program in the light of research in mathematical logic in the intervening years, beginning in the 1960s, but especially in more recent years. In my presentation here I shall be following [4] in its main points, though enlarging on some of them. Some passages are even taken almost verbatim from that paper where convenient, though of course all expository background material that was necessary there for a general audience is omitted. 1 For a logical audience I have written before about