Recurrent Points and Hyperarithmetic Sets

A. R. D. Mathias ()
Additional contact information
A. R. D. Mathias: Institut d’Estudis Catalans, Centre de Recerca Matemàtica

A chapter in Set Theory, 1998, pp 157-174 from Springer

Abstract: Abstract We give an example of an iteration with recursive data which stabilises exactly at the first non-recursive ordinal. We characterise the points in the final set as those attacked by recurrent points, and use that characterisation to show that recurrent points must exist for any iteration with recursive data which does not stabilise at a recursive ordinal.

Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-8988-8_10

Ordering information: This item can be ordered from
http://www.springer.com/9789401589888

DOI: 10.1007/978-94-015-8988-8_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().