Stepping up lemmas in definable partitions

Journal of Symbolic Logic 49 (1):22-31 (1984)
  Copy   BIBTEX

Abstract

Several stepping up lemmas are proved which are then used to investigate the connection between definable partition relations and admissible ordinals

Categories

Keywords

Reprint years

DOI

10.2307/2274087

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,296

External links

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

Through your library

My notes

Similar books and articles

Definable Ultrapowers and Ultrafilters Over Admissible Ordinals.Matt Kaufmann & Evangelos Kranakis - 1984 - Mathematical Logic Quarterly 30 (7-8):97-118.
Definable ultrapowers and ultrafilters over admissible ordinals.Matt Kaufmann & Evangelos Kranakis - 1984 - Mathematical Logic Quarterly 30 (7‐8):97-118.
Zfc proves that the class of ordinals is not weakly compact for definable classes.Ali Enayat & Joel David Hamkins - 2018 - Journal of Symbolic Logic 83 (1):146-164.
Definable Ramsey and definable Erdös ordinals.Evangelos Kranakis - 1983 - Archive for Mathematical Logic 23 (1):115-128.
On Bounded Type-Definable Equivalence Relations.Ludomir Newelski & Krzysztof Krupi?Ski - 2002 - Notre Dame Journal of Formal Logic 43 (4):231-242.
False Lemmas in Herbrand.Burton Dreben & Peter Andrews - 1966 - Journal of Symbolic Logic 31 (4):657-659.
Prototypes for definable subsets of algebraically closed valued fields.Jan E. Holly - 1997 - Journal of Symbolic Logic 62 (4):1093-1141.
Definable Partitions and the Projectum.Evangelos Kranakis - 1985 - Mathematical Logic Quarterly 31 (21‐23):351-355.
Prototypes for Definable Subsets of Algebraically Closed Valued Fields.Jan Holly - 1997 - Journal of Symbolic Logic 62 (4):1093-1141.
Reflection and partition properties of admissible ordinals.Evangelos Kranakis - 1982 - Annals of Mathematical Logic 22 (3):213-242.

Analytics

Added to PP
2009-01-28

Downloads
6 (#1,485,580)

6 months
26 (#116,274)

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

Definable Ultrafilters and end Extension of Constructible Sets.Evangelos Kranakis - 1982 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (27-32):395-412.
Reflection and partition properties of admissible ordinals.Evangelos Kranakis - 1982 - Annals of Mathematical Logic 22 (3):213-242.
Definable Ultrafilters and end Extension of Constructible Sets.Evangelos Kranakis - 1982 - Mathematical Logic Quarterly 28 (27‐32):395-412.

Add more references