The consistency of arithmetics
From MaRDI portal
Publication:5925300
DOI10.1007/BF01565428zbMath0014.38801WikidataQ55878722 ScholiaQ55878722MaRDI QIDQ5925300
Publication date: 1936
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/159839
03Exx: Set theory
Related Items
A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies, Sequent calculus in natural deduction style, Extensions of the Finitist Point of View, The Mathematical Development of Set Theory from Cantor to Cohen, The Borel Hierarchy Theorem from Brouwer's intuitionistic perspective, Subformula theorems for N-sequents, A survey of proof theory, On the restricted ordinal theorem, On the interpretation of intuitionistic number theory, The constructive Hilbert program and the limits of Martin-Löf type theory, Ordinal arithmetic: Algorithms and mechanization, Toward automating the discovery of decreasing measures, Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006, Too naturalist and not naturalist enough: Reply to Horsten, A weak intuitionistic propositional logic with purely constructive implication, Experimental logics and \(\Delta^0_2\)-theories, Hilbert's logic. From axiomatics to proof theory, Studies in constructive mathematics and mathematical logic. Part IX, Georg Cantor as the author of constructions playing fundamental roles in constructive mathematics, A method of epsilon substitution for the predicate logic with equality, A Ramsey theorem in Boyer-Moore logic, Epsilon substitution method for elementary analysis, Die another day, Proof theory and ordinal analysis, Notation systems for infinitary derivations, Theories and ordinals in proof theory, Semantic values for natural deduction derivations, Zur Widerspruchsfreiheit der Zahlentheorie., Die Widerspruchsfreiheit der allgemeinen Mengenlehre., Die Widerspruchsfreiheit der allgemeinen Mengenlehre, Zur Widerspruchsfreiheit der Zahlentheorie, On understanding understanding, Strong termination for the epsilon substitution method, Hilbert's ‘Verunglückter Beweis’, the first epsilon theorem, and consistency proofs, Gödel's Reformulation of Gentzen's First Consistency Proof For Arithmetic: The No-Counterexample Interpretation, Logic in the twenties: the nature of the quantifier, Annual Meeting of the Association for Symbolic Logic, Pittsburgh, 1991, Problemi aperti sulle algebre diagonali, The work of Kurt Gödel, Ordinals connected with formal theories for transfinitely iterated inductive definitions
