Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T06:45:44.755Z Has data issue: false hasContentIssue false

An infinitistic rule of proof1

Published online by Cambridge University Press:  12 March 2014

H. B. Enderton*
Affiliation:
University of California, Berkeley

Extract

In this paper we consider a fonnal system of second-order Peano arithmetic with a rule of inference stronger than the ω-rule [3]. We also consider the relation to a class of models for analysis (i.e. second-order arithmetic) which lies between the class of ω-models and the class of β-models [5].

The notation used is largely that of [3] and [5]. We assume that the reader has some familiarity with at least the ideas of the former. The formal system (A) of Peano arithmetic employed in [3] includes the comprehension axioms and the second-order induction axiom.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1968

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable