Switch to: References

Add citations

You must login to add citations.
  1. Some conservation results on weak König's lemma.Stephen G. Simpson, Kazuyuki Tanaka & Takeshi Yamazaki - 2002 - Annals of Pure and Applied Logic 118 (1-2):87-114.
    By , we denote the system of second-order arithmetic based on recursive comprehension axioms and Σ10 induction. is defined to be plus weak König's lemma: every infinite tree of sequences of 0's and 1's has an infinite path. In this paper, we first show that for any countable model M of , there exists a countable model M′ of whose first-order part is the same as that of M, and whose second-order part consists of the M-recursive sets and sets not (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • Baire Categoricity and $\Sigma^{0}_{1}$ -Induction.Stephen G. Simpson - 2014 - Notre Dame Journal of Formal Logic 55 (1):75-78.
  • Groundwork for weak analysis.António M. Fernandes & Fernando Ferreira - 2002 - Journal of Symbolic Logic 67 (2):557-578.
    This paper develops the very basic notions of analysis in a weak second-order theory of arithmetic BTFA whose provably total functions are the polynomial time computable functions. We formalize within BTFA the real number system and the notion of a continuous real function of a real variable. The theory BTFA is able to prove the intermediate value theorem, wherefore it follows that the system of real numbers is a real closed ordered field. In the last section of the paper, we (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   10 citations