Stationary logic of ordinals

Annals of Pure and Applied Logic 26 (1):47-68 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(84)90040-x

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

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

Full reflection of stationary sets below ℵω.Thomas Jech & Saharon Shelah - 1990 - Journal of Symbolic Logic 55 (2):822 - 830.
Full Reflection of Stationary Sets Below $aleph_omega$.Thomas Jech & Saharon Shelah - 1990 - Journal of Symbolic Logic 55 (2):822-830.
Splitting stationary sets in.Toshimichi Usuba - 2012 - Journal of Symbolic Logic 77 (1):49-62.
Stationary Cardinals.Wenzhi Sun - 1993 - Archive for Mathematical Logic 32 (6):429-442.
Indestructibility, measurability, and degrees of supercompactness.Arthur W. Apter - 2012 - Mathematical Logic Quarterly 58 (1):75-82.
Stationary logic and its friends. I.Alan H. Mekler & Saharon Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (2):129-138.
Stationary logic and its friends. II.Alan H. Mekler & Saharon Shelah - 1986 - Notre Dame Journal of Formal Logic 27 (1):39-50.
Reflecting stationary sets.Menachem Magidor - 1982 - Journal of Symbolic Logic 47 (4):755-771.
μ-complete Souslin trees on μ+.Menachem Kojman & Saharon Shelah - 1993 - Archive for Mathematical Logic 32 (3):195-201.
Characterizing strong compactness via strongness.Arthur W. Apter - 2003 - Mathematical Logic Quarterly 49 (4):375.
A Covering Lemma for HOD of K (ℝ).Daniel W. Cunningham - 2010 - Notre Dame Journal of Formal Logic 51 (4):427-442.
Forcing notions in inner models.David Asperó - 2009 - Archive for Mathematical Logic 48 (7):643-651.
Proof theory for theories of ordinals—I: recursively Mahlo ordinals.Toshiyasu Arai - 2003 - Annals of Pure and Applied Logic 122 (1-3):1-85.

Analytics

Added to PP
2014-01-16

Downloads
19 (#775,535)

6 months
4 (#818,853)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Alfred Tarski and decidable theories.John Doner & Wilfrid Hodges - 1988 - Journal of Symbolic Logic 53 (1):20-35.

Add more citations

References found in this work

The computational complexity of logical theories.Jeanne Ferrante - 1979 - New York: Springer Verlag. Edited by Charles W. Rackoff.
Stationary logic.Jon Barwise - 1978 - Annals of Mathematical Logic 13 (2):171.
Stationary logic of finitely determinate structures.P. C. Eklof - 1979 - Annals of Mathematical Logic 17 (3):227.

Add more references