Bounds on Scott rank for various nonelementary classes

Archive for Mathematical Logic 30 (2):73-82 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1007/bf01634977

Links

PhilArchive



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

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

Index Sets for Classes of High Rank Structures.W. Calvert, E. Fokina, S. S. Goncharov, J. F. Knight, O. Kudinov, A. S. Morozov & V. Puzarenko - 2007 - Journal of Symbolic Logic 72 (4):1418 - 1432.
Computable Trees of Scott Rank [image] , and Computable Approximation.Wesley Calvert, Julia F. Knight & Jessica Millar - 2006 - Journal of Symbolic Logic 71 (1):283 - 298.
Categoricity of computable infinitary theories.W. Calvert, S. S. Goncharov, J. F. Knight & Jessica Millar - 2009 - Archive for Mathematical Logic 48 (1):25-38.
Computable Trees of Scott Rank $\omega _{1}^{\mathit{CK}}$ , and Computable Approximation.Wesley Calvert, Julia F. Knight & Jessica Millar - 2006 - Journal of Symbolic Logic 71 (1):283 - 298.
Complexity Ranks of Countable Models.Su Gao - 2007 - Notre Dame Journal of Formal Logic 48 (1):33-48.
Local order property in nonelementary classes.Rami Grossberg & Olivier Lessmann - 2000 - Archive for Mathematical Logic 39 (6):439-457.
Rank Functions and Partial Stability Spectra for Tame Abstract Elementary Classes.Michael J. Lieberman - 2013 - Notre Dame Journal of Formal Logic 54 (2):153-166.
Classes of Ulm type and coding rank-homogeneous trees in other structures.E. Fokina, J. F. Knight, A. Melnikov, S. M. Quinn & C. Safranski - 2011 - Journal of Symbolic Logic 76 (3):846 - 869.
On Σ1 1 equivalence relations with Borel classes of bounded rank.Ramez L. Sami - 1984 - Journal of Symbolic Logic 49 (4):1273 - 1283.
The Mitchell Order below Rank-To-Rank.Itay Neeman - 2004 - Journal of Symbolic Logic 69 (4):1143 - 1162.
Honest Bounds for complexity classes of recursive functions.R. Moll & A. R. Meyer - 1974 - Journal of Symbolic Logic 39 (1):127-138.
Review: Dana Scott, The Notion of Rank in Set-Theory. [REVIEW]A. Hajnal - 1966 - Journal of Symbolic Logic 31 (4):662-663.

Analytics

Added to PP
2013-11-23

Downloads
22 (#708,419)

6 months
6 (#518,648)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Recursion-theoretic hierarchies.Peter G. Hinman - 1978 - New York: Springer Verlag.
Admissible Sets and Structures.Jon Barwise - 1978 - Studia Logica 37 (3):297-299.
Descriptive Set Theory.Richard Mansfield - 1981 - Journal of Symbolic Logic 46 (4):874-876.
Generalized erdoös cardinals and O4.James E. Baumgartner & Fred Galvin - 1978 - Annals of Mathematical Logic 15 (3):289-313.

View all 8 references / Add more references