Results 1  10
of
12
First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo
, 1998
"... In this paper first order theories for nonmonotone inductive definitions are introduced, and a prooftheoretic analysis for such theories based on combined operator forms a la Richter with recursively inaccessible and Mahlo closure ordinals is given. 1 Introduction Let # be an operator on the power ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
In this paper first order theories for nonmonotone inductive definitions are introduced, and a prooftheoretic analysis for such theories based on combined operator forms a la Richter with recursively inaccessible and Mahlo closure ordinals is given. 1 Introduction Let # be an operator on the power set P (N) of the natural numbers, i.e. a mapping from P (N) to P (N). Then # can be used to generate subsets I # # of the natural numbers if we define I # # := I <# # # #(I <# # ) and I <# # := # {I # # : # < #} by transfinite recursion on the ordinals. Furthermore we let I # # := # {I # # : # an ordinal } be the set of natural numbers inductively defined by #. Obviously there exists a least ordinal # so that I # # = I <# # . We call this ordinal the closure ordinal of the inductive definition generated by # and know that I # # is identical to I # # . The sets I # # are the stages of the inductive definition generated by #. If K is a class of operators, th...
Proof theory of MartinLöf type theory. An overview
 MATHEMATIQUES ET SCIENCES HUMAINES, 42 ANNÉE, N O 165:59 – 99
, 2004
"... We give an overview over the historic development of proof theory and the main techniques used in ordinal theoretic proof theory. We argue, that in a revised Hilbert’s programme, ordinal theoretic proof theory has to be supplemented by a second step, namely the development of strong equiconsistent ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We give an overview over the historic development of proof theory and the main techniques used in ordinal theoretic proof theory. We argue, that in a revised Hilbert’s programme, ordinal theoretic proof theory has to be supplemented by a second step, namely the development of strong equiconsistent constructive theories. Then we show, how, as part of such a programme, the proof theoretic analysis of MartinLöf type theory with Wtype and one microscopic universe containing only two finite sets in carried out. Then we look at the analysis MartinLöf theory with Wtype and a universe closed under the Wtype, and consider the extension of type theory by one Mahlo universe and its prooftheoretic analysis. Finally we repeat the concept of inductiverecursive definitions, which extends the notion of inductive definitions substantially. We introduce a closed formalisation, which can be used in generic programming, and explain, what is known about its strength.
Operations, sets and classes
"... Operational set theory, in the form described below, is an enterprise which consolidates classical set theory with some central concepts of Feferman’s explicit mathematics. It provides for a careful distinction between operations and settheoretic functions and as such reconciles set theory with nee ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Operational set theory, in the form described below, is an enterprise which consolidates classical set theory with some central concepts of Feferman’s explicit mathematics. It provides for a careful distinction between operations and settheoretic functions and as such reconciles set theory with needs arising in constructive environments and even in those enhanced by computer science. In the following we consider, primarily from a prooftheoretic perspective, the theory OST and some of its most important extensions and determine their consistency strengths by exhibiting equivalent systems in the realm of traditional theories of sets and classes.
Finitary reductions for local predicativity, I: recursively regular ordinals
"... We define notation system for infinitary derivations arising from cutelimination for a theory T 1 \Sigma of recursively regular ordinals by the method of local predicativity. Using these notations, we derive finitary cutelimination steps together with corresponding ordinal assignments. Introductio ..."
Abstract
 Add to MetaCart
We define notation system for infinitary derivations arising from cutelimination for a theory T 1 \Sigma of recursively regular ordinals by the method of local predicativity. Using these notations, we derive finitary cutelimination steps together with corresponding ordinal assignments. Introduction There is an extensive literature connecting infinitary "Schuttestyle" and finitary "GentzenTakeutistyle" sides of proof theory. For example, in papers [Mi75, Mi75a, Mi79, Bu91, Bu97a] this was done for systems not exceeding in strength Peano Arithmetic. But most recently, there has been an interest to what one can get on the side of finitary proof theory from the methods which are used for prooftheoretical analysis of impredicative theories (see [Wei96, Bu97]). Especially we want to mention paper [Bu97], where it was shown that Takeuti's reduction steps for \Pi 1 1 \Gamma CA+ BI [Tak87, x27] can be derived from Buchholz' method of\Omega +1 rule ([BFPS, Ch. IVV], [BS88]). Here we ...
A BUCHOLZ DERIVATION SYSTEM FOR THE ORDINAL ANALYSIS OF KP + Π3REFLECTION
"... Abstract. In this paper we introduce a notation system for the infinitary derivations occurring in the ordinal analysis of KP + Π3Reflection due to Michael Rathjen. This allows a finitary ordinal analysis of KP+Π3Reflection. The method used is an extension of techniques developed by Wilfried Buchh ..."
Abstract
 Add to MetaCart
Abstract. In this paper we introduce a notation system for the infinitary derivations occurring in the ordinal analysis of KP + Π3Reflection due to Michael Rathjen. This allows a finitary ordinal analysis of KP+Π3Reflection. The method used is an extension of techniques developed by Wilfried Buchholz, namely operator controlled notation systems for RS ∞derivations. Similarly to Buchholz we obtain a characterisation of the provably recursive functions of KP+Π3Reflection as <recursive functions where < is the ordering on Rathjen’s ordinal notation system T (K). Further we show a conservation result for Π 0 2sentences. §1. Introduction. Ordinal analysis uses cutelimination techniques for proof theoretic investigations. The termination of the cutelimination process is guaranteed by assigning decreasing ordinals to the proofs emerging in the process. Gerhard Gentzen was the first to form a relationship between an ordinal ε0 and a foundational mathematical theory (nowadays denoted Peano Arithmetic PA)
Universes in Type Theory Part I
, 2005
"... Abstract We give an overview over universes in MartinL"of type theory and consider the following universe constructions: a simple universe, E. Palmgren's super universe and the Mahlo universe. We then introduce models for these theories in extensions of KripkePlatek set theory having ..."
Abstract
 Add to MetaCart
Abstract We give an overview over universes in MartinL&quot;of type theory and consider the following universe constructions: a simple universe, E. Palmgren's super universe and the Mahlo universe. We then introduce models for these theories in extensions of KripkePlatek set theory having the same proof theoretic strength. The extensions of KripkePlatek set theory used formalise the existence of a recursively inaccessible ordinal, a recursively hyperinaccessible ordinal, and a recursively Mahlo ordinal. Using these models we determine upper bounds for the proof theoretic strength of the theories in questions. In case of simple universes and the Mahlo universe, these bounds have been shown by the author to be sharp. This article is an overview over the main techniques in developing these models, full details will be presented in a series of future articles. 1 Introduction This article presents some results of a research program with the goal of determining as strong as possible predicatively justified extensions of MartinL&quot;of type theory (MLTT) and to determine their precise proof theoretic strength.We see three main reasons for following this research program: