Computability and Non-monotone induction
Dag Normann

TL;DR
This paper explores the theoretical foundations of non-monotone induction viewed as a type 3 functional, analyzing its computational properties, closure characteristics, and applications in classical analysis and topology.
Contribution
It provides a new characterization of type 3 functionals computable via non-monotone induction and investigates their closure properties and applications in analysis.
Findings
Established strong closure properties of the least ordinal without such codes.
Characterized functionals of type 3 computable from non-monotone induction.
Demonstrated the necessity of full non-monotone induction for certain topological constructions.
Abstract
Non-monotone inductive definitions were studied in the late 1960's and early 1970's with the aim of understanding connections between the complexity of the formulas defining the induction steps and the size of the ordinals measuring the duration of the inductions. In general, any type 2 functional will generate an inductive process, and in this paper we will view non-monotone induction as a functional of type 3. We investigate the associated computation theory inherited from the Kleene schemes and we investigate the nature of the associated companion of sets with codes computable in non-monotone induction. The interest in this functional is motivated from observing that constructions via non-monotone induction appear as natural in classical analysis in its original form. There are two groups of results: We establish strong closure properties of the least ordinal without a code…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Logic, Reasoning, and Knowledge · Advanced Algebra and Logic
