On the Borel classification of the isomorphism class of a countable model

Notre Dame Journal of Formal Logic 24 (1):22-34 (1983)
  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: 98,316

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

The Borel Complexity of Isomorphism for Theories with Many Types.David Marker - 2007 - Notre Dame Journal of Formal Logic 48 (1):93-97.
Isomorphism of Homogeneous Structures.John D. Clemens - 2009 - Notre Dame Journal of Formal Logic 50 (1):1-22.
Comparing Borel Reducibility and Depth of an ω-Stable Theory.Martin Koerwien - 2009 - Notre Dame Journal of Formal Logic 50 (4):365-380.
A Silver-like Perfect Set Theorem with an Application to Borel Model Theory.Joël Combase - 2011 - Notre Dame Journal of Formal Logic 52 (4):415-429.
A complicated ω-stable depth 2 theory.Martin Koerwien - 2011 - Journal of Symbolic Logic 76 (1):47 - 65.
Strange Structures from Computable Model Theory.Howard Becker - 2017 - Notre Dame Journal of Formal Logic 58 (1):97-105.
Careful choices---a last word on Borel selectors.John P. Burgess - 1981 - Notre Dame Journal of Formal Logic 22 (3):219-226.

Analytics

Added to PP
2010-08-24

Downloads
20 (#908,247)

6 months
5 (#936,811)

Historical graph of downloads
How can I increase my downloads?