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]

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 86,377

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

Some uses of dilators in combinatorial problems.V. Michele Abrusci - 1989 - Archive for Mathematical Logic 29 (2):85-109.
Π12-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2-3):75-219.
[product]¹2-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2):75.
A strong boundedness theorem for dilators.A. S. Kechris & W. H. Woodin - 1991 - Annals of Pure and Applied Logic 52 (1-2):93-97.
Boundedness theorems for dilators and ptykes.Alexander Kechris - 1991 - Annals of Pure and Applied Logic 52 (1-2):79-92.
Boundedness theorems for dilators and ptykes.Alexander S. Kechris - 1991 - Annals of Pure and Applied Logic 52 (1-2):79-92.
Some combinatorial and algorithmic problems in many-valued logics.Ivan Stojmenović - 1987 - Novi Sad: University of Novi Sad, Faculty of Science, Institute of Mathematics.
Well ordering principles and -statements: A pilot study.Anton Freund - 2021 - Journal of Symbolic Logic 86 (2):709-745.
Topological Aspects of Combinatorial Possibility.Thomas Mormann - 1997 - Logic and Logical Philosophy 5:75 - 92.
Combinatorial Analytic Tableaux.Robert Cowen - 1993 - Reports on Mathematical Logic:29-39.
Subsystems of true arithmetic and hierarchies of functions.Z. Ratajczyk - 1993 - Annals of Pure and Applied Logic 64 (2):95-152.
Large cardinals and basic sequences.Jordi Lopez-Abad - 2013 - Annals of Pure and Applied Logic 164 (12):1390-1417.
Countable Admissible Ordinals and Dilators.Gerhard Jäger - 1986 - Mathematical Logic Quarterly 32 (25‐30):451-456.

Analytics

Added to PP
2009-01-28

Downloads
54 (#250,553)

6 months
1 (#866,649)

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

[product]¹2-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical 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