Some Uses of Dilators in Combinatorial Problems. II

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

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]
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274952
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 46,330
Through your library

References found in this work BETA

[Product]¹2-Logic, Part 1: Dilators.J. Girard - 1981 - Annals of Pure and Applied Logic 21 (2):75.
Π12-Logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2-3):75-219.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Patterns of Projecta.Adam Krawczyk - 1981 - Journal of Symbolic Logic 46 (2):287-295.
A Model-Theoretic Approach to Ordinal Analysis.Jeremy Avigad & Richard Sommer - 1997 - Bulletin of Symbolic Logic 3 (1):17-52.
Recantation or Any Old W-Sequence Would Do After All.Paul Benacerraf - 1996 - Philosophia Mathematica 4 (2):184-189.
The Characteristic Sequence of a First-Order Formula.M. E. Malliaris - 2010 - Journal of Symbolic Logic 75 (4):1415-1440.
Biologically Unavoidable Sequences.Samuel Alexander - 2013 - Electronic Journal of Combinatorics 20 (1):1-13.
Shift-Complex Sequences.Mushfeq Khan - 2013 - Bulletin of Symbolic Logic 19 (2):199-215.
Laver Sequences for Extendible and Super-Almost-Huge Cardinals.Paul Corazza - 1999 - Journal of Symbolic Logic 64 (3):963-983.
What Are Numbers?Zvonimir Šikić - 1996 - International Studies in the Philosophy of Science 10 (2):159-171.

Analytics

Added to PP index
2009-01-28

Total views
47 ( #189,021 of 2,286,097 )

Recent downloads (6 months)
4 ( #319,399 of 2,286,097 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature