Notation systems for infinitary derivations
From MaRDI portal
Publication:2277451
Recommendations
Cites work
- scientific article; zbMATH DE number 3167150 (Why is no real title available?)
- scientific article; zbMATH DE number 4033738 (Why is no real title available?)
- scientific article; zbMATH DE number 4033742 (Why is no real title available?)
- scientific article; zbMATH DE number 4068861 (Why is no real title available?)
- scientific article; zbMATH DE number 3497842 (Why is no real title available?)
- scientific article; zbMATH DE number 3572133 (Why is no real title available?)
- A survey of proof theory
- Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
- Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
- Finite investigations of transfinite derivations
- Proof theory. 2nd ed
- Proof-theoretical analysis: Weak systems of functions and classes
- The consistency of arithmetics
Cited in
(35)- scientific article; zbMATH DE number 3941504 (Why is no real title available?)
- Continuous normalization for the lambda-calculus and Gödel's T
- Intuitionistic fixed point theories over set theories
- Classifying the Provably Total Functions of PA
- 1998 European Summer Meeting of the Association for Symbolic Logic
- How to characterize provably total functions by local predicativity
- scientific article; zbMATH DE number 1420858 (Why is no real title available?)
- Cut elimination for a simple formulation of epsilon calculus
- Reduction of finite and infinite derivations
- Completeness of the primitive recursive \(\omega \)-rule
- A mathematical commitment without computational strength
- Witnessing flows in arithmetic
- A termination proof for epsilon substitution using partial derivations
- Infix and postfix notations
- Mining the surface: witnessing the low complexity theorems of arithmetic
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
- The consistency of arithmetic
- Proof theory of reflection
- A Characterisation of Definable NP Search Problems in Peano Arithmetic
- \(\Pi_1^1\)-comprehension as a well-ordering principle
- Type-theoretic approaches to ordinals
- Finite notations for infinite terms
- Slow reflection
- Fundamental sequences and fast-growing hierarchies for the Bachmann-Howard ordinal
- 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06
- A note on fragments of uniform reflection in second order arithmetic
- Further applications of ultra-conservative ω-rules
- Proof lengths for instances of the Paris-Harrington principle
- Proof theory and ordinal analysis
- Short proofs for slow consistency
- A note on iterated consistency and infinite proofs
- On the computational complexity of cut-reduction
- Finitary treatment of operator controlled derivations
- AN INCOMPLETENESS THEOREM VIA ORDINAL ANALYSIS
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
This page was built for publication: Notation systems for infinitary derivations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277451)