Results 1 
8 of
8
Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory
 Journal of Symbolic Logic
"... 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, ..."
Abstract

Cited by 20 (14 self)
 Add to MetaCart
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 prooftheoretically analyzed by Rathjen [14, 15]. KPM is a highly impredicative theory, and its proofthe...
Extending the System T_0 of explicit mathematics: the limit and Mahlo axioms
"... In this paper we discuss extensions of Feferman's theory T_0 for explicit mathematics by the socalled limit and Mahlo axioms and present a novel approach to constructing natural recusiontheoretic models for (fairly strong) systems of explicit mathematics which is based on nonmonotone inductiv ..."
Abstract

Cited by 13 (8 self)
 Add to MetaCart
In this paper we discuss extensions of Feferman's theory T_0 for explicit mathematics by the socalled limit and Mahlo axioms and present a novel approach to constructing natural recusiontheoretic models for (fairly strong) systems of explicit mathematics which is based on nonmonotone inductive definitions.
Challenges to Predicative Foundations of Arithmetic
 in Between Logic and Intuition Essays in Honor of Charles Parsons
, 1996
"... This paper was written while the first author was a Fellow at the Center for Advanced Study in the Behavioral Sciences (Stanford, CA) whose facilities and support, under grants from the Andrew W. Mellon Foundation and the National Science Foundation, have been greatly appreciated. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper was written while the first author was a Fellow at the Center for Advanced Study in the Behavioral Sciences (Stanford, CA) whose facilities and support, under grants from the Andrew W. Mellon Foundation and the National Science Foundation, have been greatly appreciated.
Metapredicative And Explicit Mahlo: A ProofTheoretic Perspective
"... 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 ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
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
Elementary constructive operational set theory. To appear in: Festschrift for Wolfram Pohlers, Ontos Verlag
"... Abstract. We introduce an operational set theory in the style of [5] and [17]. The theory we develop here is a theory of constructive sets and operations. One motivation behind constructive operational set theory is to merge a constructive notion of set ([1], [2]) with some aspects which are typical ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We introduce an operational set theory in the style of [5] and [17]. The theory we develop here is a theory of constructive sets and operations. One motivation behind constructive operational set theory is to merge a constructive notion of set ([1], [2]) with some aspects which are typical of explicit mathematics [14]. In particular, one has nonextensional operations (or rules) alongside extensional constructive sets. Operations are in general partial and a limited form of self–application is permitted. The system we introduce here is a fully explicit, finitely axiomatised system of constructive sets and operations, which is shown to be as strong as HA. 1.
Impredicative Overloading in Explicit Mathematics
, 2000
"... In this article we introduce the system OTN of explicit mathematics based on elementary separation, product, join and weak power types. We present a settheoretical model for OTN, and we develop in OTN a theory of impredicative overloading. Together this yields a solution to the problem of impredica ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this article we introduce the system OTN of explicit mathematics based on elementary separation, product, join and weak power types. We present a settheoretical model for OTN, and we develop in OTN a theory of impredicative overloading. Together this yields a solution to the problem of impredicativity encountered in denotational semantics for overloading and latebinding. Further, our work provides a first example of an application of power types in explicit mathematics. Keywords: Objectoriented constructs, type structure, proof theory. 1 Introduction Overloading is an important concept in objectoriented programming. For example, it occurs when a method is redefined in a subclass or when a class provides several methods with the same name but with di#erent argument types. Theoretically speaking, overloading denotes the possibility that several functions f i with respective types S i # T i may be combined to a new overloaded function f of type {S i # T i } i#I . We then ...
Reflections on reflections in explicit mathematics
 Ann. Pure Appl. Logic
, 2005
"... We give a broad discussion of reflection principles in explicit mathematics, thereby addressing various kinds of universe existence principles. The prooftheoretic strength of the relevant systems of explicit mathematics is couched in terms of suitable extensions of KripkePlatek set theory. 1 ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We give a broad discussion of reflection principles in explicit mathematics, thereby addressing various kinds of universe existence principles. The prooftheoretic strength of the relevant systems of explicit mathematics is couched in terms of suitable extensions of KripkePlatek set theory. 1