In his previous work, the author has introduced the axiom schema of inductive dichotomy, a weak variant of the axiom schema of inductive definition, and used this schema for elementary ) positive operators to separate open and clopen determinacies for those games in which two players make choices from infinitely many alternatives in various circumstances. Among the studies on variants of inductive definitions for bounded ) positive operators, the present article investigates inductive dichotomy for these operators, and applies it to (...) constructive investigations of variants of determinacy statements for those games in which the players make choices from only finitely many alternatives. As a result, three formulations of open determinacy, that are all classically equivalent with each other, are equivalent to three different semi-classical principles, namely Markov’s Principle, Lesser Limited Principle of Omniscience and Limited Principle of Omniscience, over a suitable constructive base theory that proves clopen determinacy. Open and clopen determinacies for these games are thus separated. Some basic results on variants of inductive definitions for \ positive operators will also be given. (shrink)

Following the finitist’s rejection of the complete totality of the natural numbers, a finitist language allows only propositional connectives and bounded quantifiers in the formula-construction but not unbounded quantifiers. This is opposed to the currently standard framework, a first-order language. We conduct axiomatic studies on the notion of truth in the framework of finitist arithmetic in which at least smash function $\#$ is available. We propose finitist variants of Tarski ramified truth theories up to rank $\omega $, of Kripke–Feferman truth (...) theory and of Friedman–Sheard truth theory, and show that all of these have the same strength as the finitist arithmetic of one higher level along Grzegorczyk hierarchy. On the other hand, we also show that adding Burgess-style groundedness schema, adjusted to the finitist setting, makes Kripke–Feferman truth theory as strong as primitive recursive arithmetic. Meanwhile, we obtain some basic results on finitist theories of (full and hat) inductive definitions and on the second order axiom of hat inductive definitions for positive operators. (shrink)

We consider two variants of transfinite induction, one with monotonicity assumption on the predicate and one with the induction hypothesis only for cofinally many below. The latter can be seen as a transfinite analogue of the successor induction, while the usual transfinite induction is that of cumulative induction. We calculate the supremum of ordinals along which these schemata for \ formulae are provable in \. It is shown to be larger than the proof-theoretic ordinal \ by power of base 2. (...) We also show a similar result for the structural transfinite induction, defined with fundamental sequences. (shrink)