The countable admissible ordinal equivalence relation

Annals of Pure and Applied Logic 168 (6):1224-1246 (2017)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,880

External links

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

Through your library

Similar books and articles

Popa superrigidity and countable Borel equivalence relations.Simon Thomas - 2009 - Annals of Pure and Applied Logic 158 (3):175-189.
A lemma for cost attained.Greg Hjorth - 2006 - Annals of Pure and Applied Logic 143 (1-3):87-102.
Superrigidity and countable Borel equivalence relations.Simon Thomas - 2003 - Annals of Pure and Applied Logic 120 (1-3):237-262.
Recursive coloration of countable graphs.Hans-Georg Carstens & Peter Päppinghaus - 1983 - Annals of Pure and Applied Logic 25 (1):19-45.
Admissible rules for six intuitionistic modal logics.Iris van der Giessen - 2023 - Annals of Pure and Applied Logic 174 (4):103233.
Decidability and the number of countable models.Terrence Millar - 1984 - Annals of Pure and Applied Logic 27 (2):137-153.

Analytics

Added to PP
2016-12-23

Downloads
46 (#487,360)

6 months
10 (#436,689)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Model-Theoretic Logics.Jon Barwise & Solomon Feferman - 2017 - Cambridge University Press.
An example concerning Scott heights.M. Makkai - 1981 - Journal of Symbolic Logic 46 (2):301-318.
Scott sentences and admissible sets.Mark Nadel - 1974 - Annals of Mathematical Logic 7 (2):267.

Add more references