Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts

DOI10.1007/s00153-021-00795-2OpenAlexW3207679140MaRDI QIDQ2144614

Kentaro Sato

Publication date: 14 June 2022

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-021-00795-2

zbMATH Keywords

constructive reverse mathematicsMarkov's principleinductive definitionbounded positive operatorLesser limited principle of omnisciencesemi-classical principles

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Metamathematics of constructive systems (03F50) Other set-theoretic hypotheses and axioms (03E65) Other degrees and reducibilities in computability and recursion theory (03D30) Intuitionistic mathematics (03F55) Inductive definability (03D70)

Related Items (3)

A MARRIAGE OF BROUWER’S INTUITIONISM AND HILBERT’S FINITISM I: ARITHMETIC ⋮ A new model construction by making a detour via intuitionistic theories. III: Ultrafinitistic proofs of conservations of \(\Sigma_1^1\) collection ⋮ FINITIST AXIOMATIC TRUTH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Brouwer's fan theorem as an axiom and as a contrast to Kleene's alternative
• A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Elementary induction on abstract structures
• Full and hat inductive definitions are equivalent in NBG
• Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives
• Ordinal analyses for monotone and cofinal transfinite inductions
• RELATIVE PREDICATIVITY AND DEPENDENT RECURSION IN SECOND-ORDER SET THEORY AND HIGHER-ORDER THEORIES
• Lifschitz' realizability
• Complete Determinacy and Subsystems of Second Order Arithmetic
• Determinacy of Wadge classes and subsystems of second order arithmetic
• The proof-theoretic analysis of transfinitely iterated fixed point theories
• A NOTE ON PREDICATIVE ORDINAL ANALYSIS I: ITERATED COMPREHENSION AND TRANSFINITE INDUCTION
• A MARRIAGE OF BROUWER’S INTUITIONISM AND HILBERT’S FINITISM I: ARITHMETIC
• Infinite games in the Cantor space and subsystems of second order arithmetic
• On the relationship between ATR₀ and

This page was built for publication: Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts