A borel reducibility theory for classes of countable structures

Journal of Symbolic Logic 54 (3):894-914 (1989)
We introduce a reducibility preordering between classes of countable structures, each class containing only structures of a given similarity type (which is allowed to vary from class to class). Though we sometimes work in a slightly larger context, we are principally concerned with the case where each class is an invariant Borel class (i.e. the class of all models, with underlying set $= \omega$, of an $L_{\omega_1\omega}$ sentence; from this point of view, the reducibility can be thought of as a (rather weak) sort of $L_{\omega_1\omega}$-interpretability notion). We prove a number of general results about this notion, but our main thrust is to situate various mathematically natural classes with respect to the preordering, most notably classes of algebraic structures such as groups and fields
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274750
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,492
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

View all 14 citations / Add more citations

Similar books and articles
Added to PP index

Total downloads
19 ( #263,162 of 2,180,637 )

Recent downloads (6 months)
2 ( #155,055 of 2,180,637 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums