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: 94,045

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

Ordinals and graph decompositions.Stephen Flood - 2017 - Annals of Pure and Applied Logic 168 (4):824-839.
A cut elimination theorem for stationary logic.M. E. Szabo - 1987 - Annals of Pure and Applied Logic 33 (C):181-193.
Generalized fusible numbers and their ordinals.Alexander I. Bufetov, Gabriel Nivasch & Fedor Pakhomov - 2024 - Annals of Pure and Applied Logic 175 (1):103355.
Ehrenfeucht–Fraïssé games on ordinals.F. Mwesigye & J. K. Truss - 2018 - Annals of Pure and Applied Logic 169 (7):616-636.
Capturing sets of ordinals by normal ultrapowers.Miha E. Habič & Radek Honzík - 2023 - Annals of Pure and Applied Logic 174 (6):103261.
On the existence of skinny stationary subsets.Yo Matsubara, Hiroshi Sakai & Toshimichi Usuba - 2019 - Annals of Pure and Applied Logic 170 (5):539-557.
A characterization of Σ 1 1 -reflecting ordinals.J. P. Aguilera - 2021 - Annals of Pure and Applied Logic 172 (10):103009.
Bounded stationary reflection II.Chris Lambie-Hanson - 2017 - Annals of Pure and Applied Logic 168 (1):50-71.
Goodstein sequences for prominent ordinals up to the Bachmann–Howard ordinal.Michiel De Smet & Andreas Weiermann - 2012 - Annals of Pure and Applied Logic 163 (6):669-680.
Goodstein sequences for prominent ordinals up to the Bachmann–Howard ordinal.Michiel Smet & Andreas Weiermann - 2012 - Annals of Pure and Applied Logic 163 (6):669-680.

Analytics

Added to PP
2014-01-16

Downloads
24 (#646,648)

6 months
9 (#436,380)

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