Affordable Access

deepdyve-link
Publisher Website

The complexity of classification problems for models of arithmetic

Authors
Type
Published Article
Publication Date
Submission Date
Identifiers
DOI: 10.2178/bsl/1286284557
Source
arXiv
License
Yellow
External links

Abstract

We observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for recursively saturated models of arithmetic are Borel; we investigate the precise complexity of each of these. Finally, we show that the classification problem for pairs of recursively saturated models and for automorphisms of a fixed recursively saturated model are Borel complete.

Statistics

Seen <100 times