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)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2016.12.002

Links

PhilArchive



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

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

Locally countable models of Σ1-separation.Fred G. Abramson - 1981 - Journal of Symbolic Logic 46 (1):96 - 100.
HC of an admissible set.Sy D. Friedman - 1979 - Journal of Symbolic Logic 44 (1):95-102.
Popa superrigidity and countable Borel equivalence relations.Simon Thomas - 2009 - Annals of Pure and Applied Logic 158 (3):175-189.
Analytic equivalence relations and bi-embeddability.Sy-David Friedman & Luca Motto Ros - 2011 - Journal of Symbolic Logic 76 (1):243 - 266.
How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals.Michael Rathjen - 1993 - Mathematical Logic Quarterly 39 (1):47-54.
Σ1-separation.Fred G. Abramson - 1979 - Journal of Symbolic Logic 44 (3):374 - 382.
Borel equivalence relations induced by actions of the symmetric group.Greg Hjorth, Alexander S. Kechris & Alain Louveau - 1998 - Annals of Pure and Applied Logic 92 (1):63-112.
The pure part of HYP(M).Mark Nadel & Jonathan Stavi - 1977 - Journal of Symbolic Logic 42 (1):33-46.
Intermediate predicate logics determined by ordinals.Pierluigi Minari, Mitio Takano & Hiroakira Ono - 1990 - Journal of Symbolic Logic 55 (3):1099-1124.
Reverse Mathematics and Ordinal Multiplication.Jeffry L. Hirst - 1998 - Mathematical Logic Quarterly 44 (4):459-464.
The existence of countable totally nonconstructive extensions of the countable atomless Boolean algebra.E. W. Madison - 1983 - Journal of Symbolic Logic 48 (1):167-170.
A lemma for cost attained.Greg Hjorth - 2006 - Annals of Pure and Applied Logic 143 (1-3):87-102.
The Borel Complexity of Isomorphism for Theories with Many Types.David Marker - 2007 - Notre Dame Journal of Formal Logic 48 (1):93-97.
An Ulm-type classification theorem for equivalence relations in Solovay model.Vladimir Kanovei - 1997 - Journal of Symbolic Logic 62 (4):1333-1351.
Ordinal machines and admissible recursion theory.Peter Koepke & Benjamin Seyfferth - 2009 - Annals of Pure and Applied Logic 160 (3):310-318.

Analytics

Added to PP
2016-12-23

Downloads
34 (#466,013)

6 months
10 (#260,375)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Equivalence relations which are borel somewhere.William Chan - 2017 - Journal of Symbolic Logic 82 (3):893-930.

Add more citations

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.

View all 6 references / Add more references