Notation systems for infinitary derivations
DOI10.1007/BF01621472zbMATH Open0726.03038OpenAlexW2068743712MaRDI QIDQ2277451FDOQ2277451
Publication date: 1991
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01621472
Peano arithmetictransfinite inductionreduction operatorinversion operator\(\omega \) -arithmeticcut-elimination operatorinfinite derivationsnotation system
Proof theory in general (including proof-theoretic semantics) (03F03) Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The consistency of arithmetics
- Proof theory. 2nd ed
- A survey of proof theory
- Proof-theoretical analysis: Weak systems of functions and classes
- Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
- Finite investigations of transfinite derivations
- Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
Cited In (33)
- Type-theoretic approaches to ordinals
- Fundamental sequences and fast-growing hierarchies for the Bachmann-Howard ordinal
- A termination proof for epsilon substitution using partial derivations
- How to characterize provably total functions by local predicativity
- 1998 European Summer Meeting of the Association for Symbolic Logic
- A Characterisation of Definable NP Search Problems in Peano Arithmetic
- Proof theory of reflection
- 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06
- Proof theory and ordinal analysis
- 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
- Infix and postfix notations
- Slow reflection
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
- Cut elimination for a simple formulation of epsilon calculus
- Reduction of finite and infinite derivations
- Further applications of ultra-conservative ω-rules
- Finite notations for infinite terms
- Classifying the Provably Total Functions of PA
- Title not available (Why is that?)
- A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC
- Short proofs for slow consistency
- A note on iterated consistency and infinite proofs
- On the computational complexity of cut-reduction
- Witnessing flows in arithmetic
- A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH
- Intuitionistic fixed point theories over set theories
- Completeness of the primitive recursive \(\omega \)-rule
- \(\Pi_1^1\)-comprehension as a well-ordering principle
- Continuous normalization for the lambda-calculus and Gödel's T
- The consistency of arithmetic
- AN INCOMPLETENESS THEOREM VIA ORDINAL ANALYSIS
- Proof lengths for instances of the Paris-Harrington principle
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)
