Riemann integrability of a bounded map on [a,b], integrability of a map on a subinterval, and definedness of an oriented integral are each expressed by a predicative formula, with all their arguments as variables.
In the setting of Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity and The Real Line: Standing Notation and Background for Calculus on Intervals; this item is a statement of the metatheory. Let be a metatheoretic number, let be distinct set variables, and let , not necessarily distinct. Each clause below states that a condition on is predicative: expressed by a predicative formula, with in place of the variables of Conditions Expressed by a Predicative Formula, and Guards (i) and no displayed variables. The other letters, among them , its operations and , its elements and , its order and the strict order of , and , and the order , the addition and the element of , are parameters. Such a formula, for instance one whose reading is the reading of a formula tree as in The Graph Reading of a Formula Tree Is Predicative and Agrees with Its Reading, So the Reading Is Predicative (iii), is what class comprehension (The Class Comprehension Theorem for Predicative Formulas (i)) and induction (Induction for Predicative Formulas, and the Order of β below 1 and below n+1 (i)) apply to. None of the three notions below is a condition on a single set, so the kit has no clause on a class of sets satisfying one.
Integrable functions. With , and , the condition ", , is a map , bounded (there is with for every ), and is Riemann integrable on " is predicative.
Integrability on a subinterval. With , , and , the condition ", is a map , , , , and is integrable on " is predicative.
Defined integrals. With , , and , the condition ", is a map , , and is defined" is predicative.
Loadingβ¦
No relations recorded yet.