David Gonzalez

COMPUTABLE SCOTT SENTENCES AND THE FRIEDMAN–STANLEY EMBEDDING

Abstract Friedman and Stanley [9] developed the notion of Borel reducibility and illustrated its use in comparing classification problems for some familiar classes of countable structures. For many embeddings, the fact that the embedding is 1–1 on isomorphism types is explained b...