The consistency of arithmetics

Related Items

Proof-theoretic semantics, a problem with negation and prospects for modality, Hilbert's ‘Verunglückter Beweis’, the first epsilon theorem, and consistency proofs, Subformula theorems for N-sequents, THE COLLAPSE OF THE HILBERT PROGRAM: A VARIATION ON THE GÖDELIAN THEME, A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH, A survey of proof theory, EARLY STRUCTURAL REASONING. GENTZEN 1932, Ordinal arithmetic: Algorithms and mechanization, A weak intuitionistic propositional logic with purely constructive implication, Gentzen's Proof Systems: Byproducts in a Work of Genius, A Ramsey theorem in Boyer-Moore logic, Die Widerspruchsfreiheit der allgemeinen Mengenlehre, Sequent calculi for semi-De Morgan and De Morgan algebras, Zur Widerspruchsfreiheit der Zahlentheorie, Toward automating the discovery of decreasing measures, Epsilon substitution method for elementary analysis, Epsilon substitution for $ID_1$ via cut-elimination, Annual Meeting of the Association for Symbolic Logic, Pittsburgh, 1991, Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006, A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies, Size-based termination of higher-order rewriting, Book review of: R. Kahle (ed.) and M. Rathjen (ed.), Gentzen's centenary. The quest for consistency, ``Inference versus consequence revisited: inference, consequence, conditional, implication, The problem of $\Pi_{2}$-cut-introduction, Lorenzen's Proof of Consistency for Elementary Number Theory, Sequent calculus in natural deduction style, Predicatively unprovable termination of the Ackermannian Goodstein process, WHAT IS A RULE OF INFERENCE?, A semantic framework for proof evidence, Metalogic, Schopenhauer and Universal Logic, Type-theoretic approaches to ordinals, Unnamed Item, A note on harmony, The Mathematical Development of Set Theory from Cantor to Cohen, On understanding understanding, Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words, The Borel Hierarchy Theorem from Brouwer's intuitionistic perspective, NOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISM, Ackermann and Goodstein go functorial, BOLZANO’S CONCEPT OF GROUNDING (ABFOLGE) AGAINST THE BACKGROUND OF NORMAL PROOFS, The Veblen functions for computability theorists, Too naturalist and not naturalist enough: Reply to Horsten, Cut as Consequence, Harmony in multiple-conclusion natural-deduction, Problemi aperti sulle algebre diagonali, The computational content of arithmetical proofs, Normal proofs, cut free derivations and structural rules, A survey of nonstandard sequent calculi, Consistency, models, and soundness, The work of Kurt Gödel, Experimental logics and $\Delta^0_2$-theories, On the form of witness terms, Die another day, Theories and ordinals in proof theory, Semantic values for natural deduction derivations, Proof theory and ordinal analysis, Notation systems for infinitary derivations, Logic in the twenties: the nature of the quantifier, The Cantor–Bernstein theorem: how many proofs?, Decoding Gentzen's Notation, Gödel's Reformulation of Gentzen's First Consistency Proof For Arithmetic: The No-Counterexample Interpretation, Ordinals connected with formal theories for transfinitely iterated inductive definitions, Truth-value semantics and functional extensions for classical logic of partial terms based on equality, Inversion Principles and Introduction Rules, A Cut-Like Inference in a Framework of Explicit Composition for Various Calculi of Natural Deduction, Extensions of the Finitist Point of View, Georg Cantor as the author of constructions playing fundamental roles in constructive mathematics, A method of epsilon substitution for the predicate logic with equality, On the non-confluence of cut-elimination, The implicit commitment of arithmetical theories and its semantic core, Hilbert's logic. From axiomatics to proof theory, Human-centered automated proof search, On the restricted ordinal theorem, On the interpretation of intuitionistic number theory, Strong termination for the epsilon substitution method, ``Gaisi Takeuti's finitist standpoint and its mathematical embodiment, Studies in constructive mathematics and mathematical logic. Part IX, A Glimpse of $$ \sum_{3} $$-elementarity, Zur Widerspruchsfreiheit der Zahlentheorie., Lorenzen Between Gentzen and Schütte, The constructive Hilbert program and the limits of Martin-Löf type theory, Die Widerspruchsfreiheit der allgemeinen Mengenlehre.