Switch to: References

Add citations

You must login to add citations.
  1. From hierarchies to well-foundedness.Dandolo Flumini & Kentaro Sato - 2014 - Archive for Mathematical Logic 53 (7-8):855-863.
    We highlight that the connection of well-foundedness and recursive definitions is more than just convenience. While the consequences of making well-foundedness a sufficient condition for the existence of hierarchies have been extensively studied, we point out that well-foundedness is a necessary condition for the existence of hierarchies e.g. that even in an intuitionistic setting α⊢wfwhereα\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${_\alpha \vdash \mathsf{wf}\, {\rm where}\, _\alpha}$$\end{document} stands for the iteration of Π10\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • A note on predicative ordinal analysis I: Iterated comprehension and transfinite induction.Sato Kentaro - 2019 - Journal of Symbolic Logic 84 (1):226-265.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Quick cut-elimination for strictly positive cuts.Toshiyasu Arai - 2011 - Annals of Pure and Applied Logic 162 (10):807-815.
    In this paper we show that the intuitionistic theory for finitely many iterations of strictly positive operators is a conservative extension of Heyting arithmetic. The proof is inspired by the quick cut-elimination due to G. Mints. This technique is also applied to fragments of Heyting arithmetic.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Intuitionistic fixed point theories over set theories.Toshiyasu Arai - 2015 - Archive for Mathematical Logic 54 (5-6):531-553.
    In this paper we show that the intuitionistic fixed point theory FiXi over set theories T is a conservative extension of T if T can manipulate finite sequences and has the full foundation schema.
    Download  
     
    Export citation  
     
    Bookmark   2 citations