Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T00:29:40.110Z Has data issue: false hasContentIssue false

Bar Induction and Π11-CA1

Published online by Cambridge University Press:  12 March 2014

Harvey Friedman*
Affiliation:
Stanford University

Extract

This paper compares the subsystem of analysis based on the Π11-comprehension axiom (Π11-CA) with classical Bar Induction (BI). An extension of Bar Induction using infinitary formulae is also considered, which was suggested to us by G. Kreisel (oral communication).

To describe these formal systems, we first describe the language, L, appropriate for their formalization. L contains the language of ENT (1st order arithmetic) plus function variables ƒi, gi, hi, etc. Number-theoretic terms are built up from +, × , ′ , 0, and application.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1969

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