47 research outputs found

    Master Index to Volumes 51–60

    Get PDF

    Boundedness Theorems for Flowers and Sharps

    Get PDF
    Abstract. We show that the Sigma11 - and Sigma12 -boundedness theorems extend to the category of continuous dilators. We then apply these results to conclude the corresponding theorems for the category of sharps of real numbers, thus establishing another connection between Proof Theory and Set Theory, and extending work of Girard-Normann and Kechris-Woodin

    Spartan Daily, February 21, 1940

    Get PDF
    Volume 28, Issue 92https://scholarworks.sjsu.edu/spartandaily/3039/thumbnail.jp

    Pure ÎŁ2\Sigma_2-Elementarity beyond the Core

    Full text link
    We display the entire structure R2{\cal R}_2 coding ÎŁ1\Sigma_1- and ÎŁ2\Sigma_2-elementarity on the ordinals. This will enable the analysis of pure ÎŁ3\Sigma_3-elementary substructures.Comment: Extensive rewrite of the introduction. Mathematical content of sections 2 and 3 unchanged, extended introduction to section 2. Removed section 4. Theorem 4.3 to appear elsewhere with corrected proo

    The Murray Ledger and Times, November 22, 1976

    Get PDF

    Murray Ledger and Times, February 27, 2003

    Get PDF

    Mathematical Logic: Proof Theory, Constructive Mathematics (hybrid meeting)

    Get PDF
    The Workshop "Mathematical Logic: Proof Theory, Constructive Mathematics" focused on proofs both as formal derivations in deductive systems as well as on the extraction of explicit computational content from given proofs in core areas of ordinary mathematics using proof-theoretic methods. The workshop contributed to the following research strands: interactions between foundations and applications; proof mining; constructivity in classical logic; modal logic and provability logic; proof theory and theoretical computer science; structural proof theory

    The Murray Ledger and Times, November 22, 1976

    Get PDF

    Well ordering principles for iterated 511-comprehension

    Get PDF
    We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated 1 1- comprehension and the existence of admissible sets, over weak base theories. Our work extends a previous result on the non-iterated case, which had been conjectured in Montalbán’s “Open questions in reverse mathematics" (Bull Symb Log 17(3):431– 454, 2011). This previous result has already been applied to the reverse mathematics of combinatorial and set theoretic principles. The present paper is a significant contribution to a general approach that connects these fields
    corecore