Switch to: References

Citations of:

Logical Calculus

Journal of Symbolic Logic 3 (4):162-163 (1938)

Add citations

You must login to add citations.
  1. Hilbert’s Program.Richard Zach - 2014 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. Stanford, CA: The Metaphysics Research Lab.
    In the early 1920s, the German mathematician David Hilbert (1862–1943) put forward a new proposal for the foundation of classical mathematics which has come to be known as Hilbert's Program. It calls for a formalization of all of mathematics in axiomatic form, together with a proof that this axiomatization of mathematics is consistent. The consistency proof itself was to be carried out using only what Hilbert called “finitary” methods. The special epistemological character of finitary reasoning then yields the required justification (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   26 citations  
  • Gentzen writes in the published version of his doctoral thesis Untersuchun-gen über das logische Schliessen (Investigations into logical reasoning) that he was able to prove the normalization theorem only for intuitionistic natural deduction, but not for classical. To cover the latter, he developed classical sequent calculus and proved a corresponding theorem, the famous cut elim.Jan von Plato - 2008 - Bulletin of Symbolic Logic 14 (2):240-257.
    Gentzen writes in the published version of his doctoral thesis Untersuchungen über das logische Schliessen that he was able to prove the normalization theorem only for intuitionistic natural deduction, but not for classical. To cover the latter, he developed classical sequent calculus and proved a corresponding theorem, the famous cut elimination result. Its proof was organized so that a cut elimination result for an intuitionistic sequent calculus came out as a special case, namely the one in which the sequents have (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Gentzen's proof systems: byproducts in a work of genius.Jan von Plato - 2012 - Bulletin of Symbolic Logic 18 (3):313-367.
    Gentzen's systems of natural deduction and sequent calculus were byproducts in his program of proving the consistency of arithmetic and analysis. It is suggested that the central component in his results on logical calculi was the use of a tree form for derivations. It allows the composition of derivations and the permutation of the order of application of rules, with a full control over the structure of derivations as a result. Recently found documents shed new light on the discovery of (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  • Step by recursive step: Church's analysis of effective calculability.Wilfried Sieg - 1997 - Bulletin of Symbolic Logic 3 (2):154-180.
    Alonzo Church's mathematical work on computability and undecidability is well-known indeed, and we seem to have an excellent understanding of the context in which it arose. The approach Church took to the underlying conceptual issues, by contrast, is less well understood. Why, for example, was "Church's Thesis" put forward publicly only in April 1935, when it had been formulated already in February/March 1934? Why did Church choose to formulate it then in terms of Gödel's general recursiveness, not his own λ (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   30 citations  
  • Hilbert's 'Verunglückter Beweis', the first epsilon theorem, and consistency proofs.Richard Zach - 2004 - History and Philosophy of Logic 25 (2):79-94.
    In the 1920s, Ackermann and von Neumann, in pursuit of Hilbert's programme, were working on consistency proofs for arithmetical systems. One proposed method of giving such proofs is Hilbert's epsilon-substitution method. There was, however, a second approach which was not reflected in the publications of the Hilbert school in the 1920s, and which is a direct precursor of Hilbert's first epsilon theorem and a certain "general consistency result" due to Bernays. An analysis of the form of this so-called "failed proof" (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  • Existence and feasibility in arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   89 citations  
  • L'implication et la négation vues au Travers Des méthoDes de Gentzen et de Fitch.Jean-Blaise Grize - 1955 - Dialectica 9 (3‐4):363-381.
    Résumé1Le rôle prlvilégié que joue l'implication « si … alors » dans la pensée donne à sa formalisation loglque une importance capitale. Mais la formalisation classique se heurte à certaines difficultés.2On montre, par la méthode L de Gentzen, que c'est la partie positive de la logique intuitionniste qui exprime au plus près l'idée intuitive de l'implication.3L'implication est liée à la négation. On est conduit à distinguer « réfutable », «absurde» et «faux».4L'analyse de ces notions peut se faire aussi par la (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  • A Brief History of Natural Deduction.Francis Jeffry Pelletier - 1999 - History and Philosophy of Logic 20 (1):1-31.
    Natural deduction is the type of logic most familiar to current philosophers, and indeed is all that many modern philosophers know about logic. Yet natural deduction is a fairly recent innovation in logic, dating from Gentzen and Jaśkowski in 1934. This article traces the development of natural deduction from the view that these founders embraced to the widespread acceptance of the method in the 1960s. I focus especially on the different choices made by writers of elementary textbooks—the standard conduits of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   34 citations  
  • A further consistent extension of basic logic.Frederic B. Fitch - 1949 - Journal of Symbolic Logic 14 (4):209-218.