Switch to: Citations

Add references

You must login to add references.
  1. A feasible theory for analysis.Fernando Ferreira - 1994 - Journal of Symbolic Logic 59 (3):1001-1011.
    We construct a weak second-order theory of arithmetic which includes Weak König's Lemma (WKL) for trees defined by bounded formulae. The provably total functions (with Σ b 1 -graphs) of this theory are the polynomial time computable functions. It is shown that the first-order strength of this version of WKL is exactly that of the scheme of collection for bounded formulae.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Proof theory in the abstract.J. M. E. Hyland - 2002 - Annals of Pure and Applied Logic 114 (1-3):43-78.
    Categorical proof theory is an approach to understanding the structure of proofs. We illustrate the idea first by analyzing G0̈del's Dialectica interpretation and the Diller-Nahm variant in categorical terms. Then we consider the problematic question of the structure of classical proofs. We show how double negation translations apply in the case of the Dialectica interpretations. Finally we formulate a proposal as to how to give a more faithful analysis of proofs in the sequent calculus.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Über eine bisher noch nicht benützte erweiterung Des finiten standpunktes.Von Kurt Gödel - 1958 - Dialectica 12 (3‐4):280-287.
    ZusammenfassungP. Bernays hat darauf hingewiesen, dass man, um die Widerspruchs freiheit der klassischen Zahlentheorie zu beweisen, den Hilbertschen flniter Standpunkt dadurch erweitern muss, dass man neben den auf Symbole sich beziehenden kombinatorischen Begriffen gewisse abstrakte Begriffe zulässt, Die abstrakten Begriffe, die bisher für diesen Zweck verwendet wurden, sinc die der konstruktiven Ordinalzahltheorie und die der intuitionistischer. Logik. Es wird gezeigt, dass man statt deesen den Begriff einer berechenbaren Funktion endlichen einfachen Typs über den natürlichen Zahler benutzen kann, wobei keine anderen (...)
    Download  
     
    Export citation  
     
    Bookmark   161 citations  
  • Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals.Marc Bezem - 1985 - Journal of Symbolic Logic 50 (3):652-660.
    In this paper a model for barrecursion is presented. It has as a novelty that it contains discontinuous functionals. The model is based on a concept called strong majorizability. This concept is a modification of Howard's majorizability notion; see [T, p. 456].
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • On weak completeness of intuitionistic predicate logic.G. Kreisel - 1962 - Journal of Symbolic Logic 27 (2):139-158.
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • Relative constructivity.Ulrich Kohlenbach - 1998 - Journal of Symbolic Logic 63 (4):1218-1238.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Bounded functional interpretation.Fernando Ferreira & Paulo Oliva - 2005 - Annals of Pure and Applied Logic 135 (1):73-112.
    We present a new functional interpretation, based on a novel assignment of formulas. In contrast with Gödel’s functional “Dialectica” interpretation, the new interpretation does not care for precise witnesses of existential statements, but only for bounds for them. New principles are supported by our interpretation, including the FAN theorem, weak König’s lemma and the lesser limited principle of omniscience. Conspicuous among these principles are also refutations of some laws of classical logic. Notwithstanding, we end up discussing some applications of the (...)
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • Eine Variante zur Dialectica-Interpretation der Heyting-Arithmetik endlicher Typen.Justus Diller - 1974 - Archive for Mathematical Logic 16 (1-2):49-66.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Interpretationen der Heyting-Arithmetik endlicher Typen.Martin Stein - 1978 - Archive for Mathematical Logic 19 (1):175-189.
    Download  
     
    Export citation  
     
    Bookmark   9 citations