A predicative variant of a realizability tripos for the Minimalist Foundation.

open2noHere we present a predicative variant of a realizability tripos validating the intensional level of the Minimalist Foundation extended with Formal Church thesis.the file attached contains the whole number of the journal including the mentioned pubblicationopenMaietti, Maria Emilia; Maschio, SamueleMaietti, MARIA EMILIA; Maschio, Samuel

Investigations of subsystems of second order arithmetic and set theory in strength between Pi-1-1-CA and delta-1-2-CA+BI: part I

This paper is the rst of a series of two. It contains proof{theoretic investigations on subtheories of second order arithmetic and set theory. Among the principles on which these theories are based one nds autonomously iterated positive and monotone inductive de ni- tions, 1 1 trans nite recursion, 1 2 trans nite recursion, trans nitely iterated 1 1 dependent choices, extended Bar rules for provably de nable well-orderings as well as their set-theoretic counterparts which are based on extensions of Kripke-Platek set theory. This rst part intro- duces all the principles and theories. It provides lower bounds for their strength measured in terms of the amount of trans nite induction they achieve to prove. In other words, it determines lower bounds for their proof-theoretic ordinals which are expressed by means of ordinal representation systems. The second part of the paper will be concerned with ordinal analysis. It will show that the lower bounds established in the present paper are indeed sharp, thereby providing the proof-theoretic ordinals. All the results were obtained more then 20 years ago (in German) in the author's PhD thesis [43] but have never been published before, though the thesis received a review (MR 91m#03062). I think it is high time it got published

Halfway Up To the Mathematical Infinity I: On the Ontological & Epistemic Sustainability of Georg Cantor’s Transfinite Design

Georg Cantor was the genuine discoverer of the Mathematical Infinity, and whatever he claimed, suggested, or even surmised should be taken seriously -- albeit not necessary at its face value. Because alongside his exquisite in beauty ordinal construction and his fundamental powerset description of the continuum, Cantor has also left to us his obsessive presumption that the universe of sets should be subjected to laws similar to those governing the set of natural numbers, including the universal principles of cardinal comparability and well-ordering -- and implying an ordinal re-creation of the continuum. During the last hundred years, the mainstream set-theoretical research -- all insights and adjustments due to Kurt G\"odel's revolutionary insights and discoveries notwithstanding -- has compliantly centered its efforts on ad hoc axiomatizations of Cantor's intuitive transfinite design. We demonstrate here that the ontological and epistemic sustainability} of this design has been irremediably compromised by the underlying peremptory, Reductionist mindset of the XIXth century's ideology of science

Derivation Lengths Classification of G\"odel's T Extending Howard's Assignment

Let T be Goedel's system of primitive recursive functionals of finite type in the lambda formulation. We define by constructive means using recursion on nested multisets a multivalued function I from the set of terms of T into the set of natural numbers such that if a term a reduces to a term b and if a natural number I(a) is assigned to a then a natural number I(b) can be assigned to b such that I(a) is greater than I(b). The construction of I is based on Howard's 1970 ordinal assignment for T and Weiermann's 1996 treatment of T in the combinatory logic version. As a corollary we obtain an optimal derivation length classification for the lambda formulation of T and its fragments. Compared with Weiermann's 1996 exposition this article yields solutions to several non-trivial problems arising from dealing with lambda terms instead of combinatory logic terms. It is expected that the methods developed here can be applied to other higher order rewrite systems resulting in new powerful termination orderings since T is a paradigm for such systems

The scope of Feferman’s semi-intuitionistic set theories and his second conjecture

The paper is concerned with the scope of semi-intuitionistic set theories that relate to various foundational stances. It also provides a proof for a second conjecture of Feferman’s that relates the concepts for which the law of excluded middle obtains to those that are absolute with regard to the relevant test structures, or more precisely of ∆1 complexity. The latter is then used to show that a plethora of statements is indeterminate with respect to various semi-intuitionistic set theories

The predicative Frege hierarchy

AbstractIn this paper, we characterize the strength of the predicative Frege hierarchy, Pn+1V, introduced by John Burgess in his book [J. Burgess, Fixing frege, in: Princeton Monographs in Philosophy, Princeton University Press, Princeton, 2005]. We show that Pn+1V and Q+conn(Q) are mutually interpretable. It follows that PV:=P1V is mutually interpretable with Q. This fact was proved earlier by Mihai Ganea in [M. Ganea, Burgess’ PV is Robinson’s Q, The Journal of Symbolic Logic 72 (2) (2007) 619–624] using a different proof. Another consequence of the our main result is that P2V is mutually interpretable with Kalmar Arithmetic (a.k.a. EA, EFA, IΔ0+EXP, Q3). The fact that P2V interprets EA was proved earlier by Burgess. We provide a different proof.Each of the theories Pn+1V is finitely axiomatizable. Our main result implies that the whole hierarchy taken together, PωV, is not finitely axiomatizable. What is more: no theory that is mutually locally interpretable with PωV is finitely axiomatizable