Reduction of finite and infinite derivations

DOI10.1016/S0168-0072(00)00011-7zbMath0964.03057OpenAlexW1969898883MaRDI QIDQ1577482

Grigori Mints

Publication date: 9 July 2001

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(00)00011-7

zbMATH Keywords

cut eliminationnormalizationanalysisfirst-order arithmetic

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Structure of proofs (03F07) Second- and higher-order arithmetic and fragments (03F35)

Related Items (2)

A normal form for logical derivations implying one for arithmetic derivations ⋮ Substitution in non-wellfounded syntax with variable binding

Cites Work

• Proof-theoretic analysis of KPM
• The lambda calculus, its syntax and semantics
• A new reduction sequence for arithmetic
• Constructivism in mathematics. An introduction. Volume I
• Finite investigations of transfinite derivations
• Untersuchungen über das logische Schliessen. I
• Notation systems for infinitary derivations
• A normal form for logical derivations implying one for arithmetic derivations
• Intensional interpretations of functionals of finite type I
• A survey of proof theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reduction of finite and infinite derivations