\(\mathbf L^i \mathbf D^Z_\lambda\) as a basis for PRA

DOI10.1007/S00153-003-0175-1zbMath1025.03059OpenAlexW2461123387MaRDI QIDQ1411662

Uwe Petersen

Publication date: 29 October 2003

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-003-0175-1

zbMATH Keywords

inductionprimitive recursive arithmeticweak implicationnatural numberreverse definitions

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (2)

MODAL LOGIC WITHOUT CONTRACTION IN A METATHEORY WITHOUT CONTRACTION ⋮ Enhancing induction in a contraction free logic with unrestricted abstraction: from \(\mathbf{Z}\) to \(\mathbf{Z}_2\)

This page was built for publication: \(\mathbf L^i \mathbf D^Z_\lambda\) as a basis for PRA