A version of the ∑1-reflection principle for CFA provable in PRA

DOI10.1007/BF02011136zbMath0429.03040MaRDI QIDQ3866107

Peter Paeppinghaus

Publication date: 1980

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137958

zbMATH Keywords

metamathematicsprimitive recursive arithmeticreflection principlesyntactic analysiscut-free analysis

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35)

Related Items (1)

A result on implications of Σ₁-sentences and its application to normal form theorems

Cites Work

• Unnamed Item
• Recursive number theory. A development of recursive arithmetic in a logic-free equation calculus
• Provable equality in primitive recursive arithmetic with and without induction
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• A result on implications of Σ₁-sentences and its application to normal form theorems
• Proof theory

This page was built for publication: A version of the ∑1-reflection principle for CFA provable in PRA