Switch to: References

Add citations

You must login to add citations.
  1. Herbrand analyses.Wilfried Sieg - 1991 - Archive for Mathematical Logic 30 (5-6):409-441.
    Herbrand's Theorem, in the form of $$\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{\exists } $$ -inversion lemmata for finitary and infinitary sequent calculi, is the crucial tool for the determination of the provably total function(al)s of a variety of theories. The theories are (second order extensions of) fragments of classical arithmetic; the classes of provably total functions include the elements of the Polynomial Hierarchy, the Grzegorczyk Hierarchy, and the extended Grzegorczyk Hierarchy $\mathfrak{E}^\alpha $ , α < ε0. A subsidiary aim of the paper is to show (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  • Progress report on generalized functionality.Jonathan P. Seldin - 1979 - Annals of Mathematical Logic 17 (1):29.
  • Finite notations for infinite terms.Helmut Schwichtenberg - 1998 - Annals of Pure and Applied Logic 94 (1-3):201-222.
    Buchholz presented a method to build notation systems for infinite sequent-style derivations, analogous to well-known systems of notation for ordinals. The essential feature is that from a notation one can read off by a primitive recursive function its n th predecessor and, e.g. the last rule applied. Here we extend the method to the more general setting of infinite terms, in order to make it applicable in other proof-theoretic contexts as well as in recursion theory. As examples, we use the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • On Reduction Rules, Meaning-as-Use, and Proof-Theoretic Semantics.Ruy J. G. B. de Queiroz - 2008 - Studia Logica 90 (2):211 - 247.
    The intention here is that of giving a formal underpinning to the idea of 'meaning-is-use' which, even if based on proofs, it is rather different from proof-theoretic semantics as in the Dummett-Prawitz tradition. Instead, it is based on the idea that the meaning of logical constants are given by the explanation of immediate consequences, which in formalistic terms means the effect of elimination rules on the result of introduction rules, i. e. the so-called reduction rules. For that we suggest an (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • On Reduction Rules, Meaning-as-use, and Proof-theoretic Semantics.Ruy Queiroz - 2008 - Studia Logica 90 (2):211-247.
    The intention here is that of giving a formal underpinning to the idea of ‘meaning-is-use’ which, even if based on proofs, it is rather different from proof-theoretic semantics as in the Dummett–Prawitz tradition. Instead, it is based on the idea that the meaning of logical constants are given by the explanation of immediate consequences, which in formalistic terms means the effect of elimination rules on the result of introduction rules, i.e. the so-called reduction rules. For that we suggest an extension (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Limits of Computation.Andrew Powell - 2022 - Axiomathes 32 (6):991-1011.
    This article provides a survey of key papers that characterise computable functions, but also provides some novel insights as follows. It is argued that the power of algorithms is at least as strong as functions that can be proved to be totally computable in type-theoretic translations of subsystems of second-order Zermelo Fraenkel set theory. Moreover, it is claimed that typed systems of the lambda calculus give rise naturally to a functional interpretation of rich systems of types and to a hierarchy (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Essay Review.Enrico Moriconi - 2017 - History and Philosophy of Logic 38 (2):1-11.
    Gerhard Gentzen was born on 24 November 1909. In 1929 he moved to Göttingen where he wrote his doctoral thesis, Untersuchungen über das logische Schliessen, under the supervision of P. Bernays. The...
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  • On reduction rules, meaning-as-use, and proof-theoretic semantics.Ruy J. G. B. de Queiroz - 2008 - Studia Logica 90 (2):211-247.
    The intention here is that of giving a formal underpinning to the idea of ‘meaning-is-use’ which, even if based on proofs, it is rather different from proof-theoretic semantics as in the Dummett–Prawitz tradition. Instead, it is based on the idea that the meaning of logical constants are given by the explanation of immediate consequences, which in formalistic terms means the effect of elimination rules on the result of introduction rules, i.e. the so-called reduction rules. For that we suggest an extension (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Predicative functionals and an interpretation of ⌢ID.Jeremy Avigad - 1998 - Annals of Pure and Applied Logic 92 (1):1-34.
    In 1958 Gödel published his Dialectica interpretation, which reduces classical arithmetic to a quantifier-free theory T axiomatizing the primitive recursive functionals of finite type. Here we extend Gödel's T to theories Pn of “predicative” functionals, which are defined using Martin-Löf's universes of transfinite types. We then extend Gödel's interpretation to the theories of arithmetic inductive definitions IDn, so that each IDn is interpreted in the corresponding Pn. Since the strengths of the theories IDn are cofinal in the ordinal Γ0, as (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Strong Normalization via Natural Ordinal.Daniel Durante Pereira Alves - 1999 - Dissertation,
    The main objective of this PhD Thesis is to present a method of obtaining strong normalization via natural ordinal, which is applicable to natural deduction systems and typed lambda calculus. The method includes (a) the definition of a numerical assignment that associates each derivation (or lambda term) to a natural number and (b) the proof that this assignment decreases with reductions of maximal formulas (or redex). Besides, because the numerical assignment used coincide with the length of a specific sequence of (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Kreisel's 'Unwinding Program'.Solomon Feferman - 1996 - In Piergiorgio Odifreddi (ed.), Kreiseliana. About and Around Georg Kreisel. A K Peters. pp. 247--273.