Translator Disclaimer
Winter 1998 Predicative Logic and Formal Arithmetic
John P. Burgess, A. P. Hazen
Notre Dame J. Formal Logic 39(1): 1-17 (Winter 1998). DOI: 10.1305/ndjfl/1039293018

Abstract

After a summary of earlier work it is shown that elementary or Kalmar arithmetic can be interpreted within the system of Russell's Principia Mathematica with the axiom of infinity but without the axiom of reducibility.

Citation

Download Citation

John P. Burgess. A. P. Hazen. "Predicative Logic and Formal Arithmetic." Notre Dame J. Formal Logic 39 (1) 1 - 17, Winter 1998. https://doi.org/10.1305/ndjfl/1039293018

Information

Published: Winter 1998
First available in Project Euclid: 7 December 2002

zbMATH: 0967.03048
MathSciNet: MR1671801
Digital Object Identifier: 10.1305/ndjfl/1039293018

Subjects:
Primary: 03B15
Secondary: 03F30

Rights: Copyright © 1998 University of Notre Dame

JOURNAL ARTICLE
17 PAGES


SHARE
Vol.39 • No. 1 • Winter 1998
Back to Top