Monotone inductive definitions in a constructive theory of functions and classes
A constructive theory of functions and classes, \(T_ 0\), has been developed by \textit{S. Feferman} [Lect. Notes Math. 450, 87-139 (1975; Zbl 0357.02029)]. In a constructive framework, functions are given by algorithmic rules of construction and classes are given by defining properties. In the language of \(T_ 0\) we are able to formulate the least fixed point principle for monotone inductive definitions (MID) as: every monotone operation f on classes to classes has a least fixed point. The question due to \textit{S. Feferman} [The L. E. J. Brouwer Centen. Symp., Proc. Conf., Noordwijkerhout/Holl. 1981, Stud. Logic Found. Math. 110, 77-89 (1982; Zbl 0525.03037)] of the strength of \(T_ 0+M\) and some related questions are prime concern of this paper. Main results are: the consistency of \(T_ 0+MID\) (through constructing the corresponding model in set-theoretic sense) and the proof-theoretical equivalence between a subsystem \(EM_ 0+J+MID\) of \(T_ 0+MID\) and \(\Pi^ 1_ 1-CA\). This equivalence can be obtained by a careful examination of the analogous model construction for \(EM_ 0+J+MID\). The proof-theoretic strength of \(T_ 0+MID\) still remains open. Note that in any model of \(T_ 0\) the cardinality of the collection of classes is the same as the cardinality of the universal class \(V=\{x| x=x\}\) of all entities. So, it does not seem to be possible to use for MID the least fixed point theorem in ZF. There is a similarity with the ordinary Myhill and Shepherdson theorem that every monotone recursive transformation of the indexes of r.e. sets is described by a \(\Sigma^+\)-formula and has a least fixed point. However, in \(T_ 0\) classes are unlike r.e. sets, because they are closed under complementation operation. Hence, some additional ideas are used. The paper is selfcontained and clearly written.
- Monotone inductive definitions in explicit mathematics
- scientific article; zbMATH DE number 2037780
- scientific article; zbMATH DE number 3924774
- scientific article; zbMATH DE number 1870425
- Publication:3197877
- A NEW FORMALIZATION OF FEFERMAN’S SYSTEM OF FUNCTIONS AND CLASSES AND ITS RELATION TO FREGE STRUCTURE
- The formulae-as-classes interpretation of constructive set theory
- Explicit mathematics with the monotone fixed point principle
- La théorie intuitionniste des types : sémantique des preuves et théorie des constructions
- On Tarski’s fixed point theorem
- Abstract First Order Computability. I
- Effective operations on partial recursive functions
- scientific article; zbMATH DE number 3831930 (Why is no real title available?)
- scientific article; zbMATH DE number 3833954 (Why is no real title available?)
- scientific article; zbMATH DE number 3687373 (Why is no real title available?)
- scientific article; zbMATH DE number 3556031 (Why is no real title available?)
- scientific article; zbMATH DE number 3577197 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- On the proof-theoretic strength of monotone induction in explicit mathematics
- Understanding uniformity in Feferman's explicit mathematics
- A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\)
- Systems of explicit mathematics with non-constructive -operator and join
- On Tarski’s fixed point theorem
- The Operational Perspective: Three Routes
- Explicit mathematics with the monotone fixed point principle
- scientific article; zbMATH DE number 1841846 (Why is no real title available?)
- scientific article; zbMATH DE number 1870425 (Why is no real title available?)
- On power set in explicit mathematics
- On the Strength of the Uniform Fixed Point Principle in Intuitionistic Explicit Mathematics
- Monotone recursive definition of predicates and its realizability interpretation
- The operational penumbra: some ontological aspects
- Proof theory of constructive systems: inductive types and univalence
- On the intuitionistic strength of monotone inductive definitions
- scientific article; zbMATH DE number 2247249 (Why is no real title available?)
This page was built for publication: Monotone inductive definitions in a constructive theory of functions and classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115865)