Some Uses of Dilators in Combinatorial Problems. II

Journal of Symbolic Logic 55 (1):32 - 40 (1990)
  Copy   BIBTEX

Abstract

We study increasing F-sequences, where F is a dilator: an increasing F-sequence is a sequence (indexed by ordinal numbers) of ordinal numbers, starting with 0 and terminating at the first step x where F(x) is reached (at every step x + 1 we use the same process as in decreasing F-sequences, cf. [2], but with "+ 1" instead of "- 1"). By induction on dilators, we shall prove that every increasing F-sequence terminates and moreover we can determine for every dilator F the point where the increasing F-sequence terminates. We apply these results to inverse Goodstein sequences, i.e. increasing (1 + Id) (ω) -sequences. We show that the theorem every inverse Goodstein sequence terminates (a combinatorial theorem about ordinal numbers) is not provable in ID 1 . For a general presentation of the results stated in this paper, see [1]. We use notions and results concerning the category ON (ordinal numbers), dilators and bilators, summarized in [2, pp. 25-31]

Other Versions

original Abrusci, V. Michele (1989) "Some uses of dilators in combinatorial problems". Archive for Mathematical Logic 29(2):85-109

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 104,101

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Ptykes in GödelsT und Definierbarkeit von Ordinalzahlen.Peter Päppinghaus - 1989 - Archive for Mathematical Logic 28 (2):119-141.
The Σ 2 1 theory of axioms of symmetry.Galen Weitkamp - 1989 - Journal of Symbolic Logic 54 (3):727-734.
Specker sequences revisited.Jakob G. Simonsen - 2005 - Mathematical Logic Quarterly 51 (5):532-540.
Boundedness theorems for dilators and ptykes.Alexander S. Kechris - 1991 - Annals of Pure and Applied Logic 52 (1-2):79-92.
A recursion theoretic analysis of the clopen Ramsey theorem.Peter Clote - 1984 - Journal of Symbolic Logic 49 (2):376-400.
Ordinal numbers in arithmetic progression.Frederick Bagemihl & F. Bagemihl - 1992 - Mathematical Logic Quarterly 38 (1):525-528.

Analytics

Added to PP
2009-01-28

Downloads
91 (#243,830)

6 months
1 (#1,593,032)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Π12-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2):75-219.

Add more references