The consistency of arithmetics
From MaRDI portal
Cited in
(95)- A weak intuitionistic propositional logic with purely constructive implication
- Experimental logics and ^0_2-theories
- Hilbert's logic. From axiomatics to proof theory
- Studies in constructive mathematics and mathematical logic. Part IX
- Sequent calculi for semi-De Morgan and De Morgan algebras
- Epsilon substitution for \(ID_1\) via cut-elimination
- The problem of \(\Pi_{2}\)-cut-introduction
- A semantic framework for proof evidence
- The computational content of arithmetical proofs
- 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
- The implicit commitment of arithmetical theories and its semantic core
- Human-centered automated proof search
- ``Gaisi Takeuti's finitist standpoint and its mathematical embodiment
- Ackermann and Goodstein go functorial
- Harmony in multiple-conclusion natural-deduction
- Normal proofs, cut free derivations and structural rules
- A survey of nonstandard sequent calculi
- Die another day
- Proof theory and ordinal analysis
- Notation systems for infinitary derivations
- The arithmetics of a theory
- Book review of: R. Kahle (ed.) and M. Rathjen (ed.), Gentzen's centenary. The quest for consistency
- 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
- Proof-theoretic semantics, a problem with negation and prospects for modality
- Type-theoretic approaches to ordinals
- On understanding understanding
- Gentzen's proof systems: byproducts in a work of genius
- The Veblen functions for computability theorists
- Cut as consequence
- On the non-confluence of cut-elimination
- 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
- scientific article; zbMATH DE number 7447752 (Why is no real title available?)
- Early structural reasoning. Gentzen 1932
- ``Inference versus consequence revisited: inference, consequence, conditional, implication
- 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
- A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies
- Sequent calculus in natural deduction style
- scientific article; zbMATH DE number 1163361 (Why is no real title available?)
- scientific article; zbMATH DE number 2070199 (Why is no real title available?)
- A note on harmony
- Size-based termination of higher-order rewriting
- NOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISM
- Extensions of the Finitist Point of View
- The Mathematical Development of Set Theory from Cantor to Cohen
- A Glimpse of $$ \sum_{3} $$-elementarity
- Lorenzen Between Gentzen and Schütte
- THE COLLAPSE OF THE HILBERT PROGRAM: A VARIATION ON THE GÖDELIAN THEME
- A mathematical commitment without computational strength
- Predicatively unprovable termination of the Ackermannian Goodstein process
- Metalogic, Schopenhauer and universal logic
- The Cantor-Bernstein theorem: how many proofs?
- Decoding Gentzen's Notation
- Inversion principles and introduction rules
- A cut-like inference in a framework of explicit composition for various calculi of natural deduction
- Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words
- The Borel Hierarchy Theorem from Brouwer's intuitionistic perspective
- Bolzano's concept of grounding (\textit{Abfolge}) against the background of normal proofs
- Consistency, models, and soundness
- Subformula theorems for N-sequents
- A survey of proof theory
- On the restricted ordinal theorem
- On the interpretation of intuitionistic number theory
- Lorenzen's Proof of Consistency for Elementary Number Theory
- WHAT IS A RULE OF INFERENCE?
- Fundamental sequences and fast-growing hierarchies for the Bachmann-Howard ordinal
- \textit{Grundlagen der arithmetik}, {\S}17. I: Frege's anticipation of the deduction theorem
- A natural deduction system for orthomodular logic
- On the origins of Cantor's paradox: what Hilbert left unsaid at the 1900 ICM in Paris
- Mathematical Incompleteness Results in First-Order Peano Arithmetic: A Revisionist View of the Early History
- Gentzen's overview of calculi and reductions in consistency proofs
- The practice of finitism: epsilon calculus and consistency proofs in Hilbert's program
- Are proofs objects or acts? A comparison of Prawitz's and Sundholm's semantics
- Games with backtracking options corresponding to the ordinal analysis of \textit{PA}
- The total set-recursive functions of \textsf{KPI} and related systems
- Truth-value semantics and functional extensions for classical logic of partial terms based on equality
- 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
- On the form of witness terms
This page was built for publication: The consistency of arithmetics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925300)