## Abstract Let ≺ be a primitive recursive well‐ordering on the natural numbers and assume that its order‐type is greater than or equal to the proof‐theoretic ordinal of the theory T. We show that the proof‐theoretic strength of T is not increased if we add the negation of the statement which forma
Corrigendum to “Variation on a theme of Schütte”
✍ Scribed by Gerhard Jäger; Dieter Probst
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 36 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
As observed by G. Mints, Definition 5 on page 262 is too restrictive and does not reflect our intention. What we really had in mind is formulated below. We apologize for this stupid oversight.
Definition 5 (corrected) Let T be any theory which is formulated in a language L(T) comprising L 2 . Then T is called α-equivalent to PA ∞ , in symbols T α PA ∞ , if α is the least ordinal so that T A implies PA ∞ <α 0 A for all semi-closed arithmetic formulas A of L 2 .
📜 SIMILAR VOLUMES
*New York Times* bestselling author Barbara Delinsky enthralls millions of readers with emotionally powerful stories that vividly demonstrate the heart's, power to love. Here, first published in 1984, is an unforgettable story of a woman who must discover who she is before she can give herself to th
**What really goes on in a marriage?** Richard and Freya are, on the surface, a perfect couple. He has a thriving architectural practice; she plays the violin like an angel. They live in a beautiful home. They seem respectful and caring of one another. They should be happier than they are.