Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T15:06:29.722Z Has data issue: false hasContentIssue false

The Complexity of Classification Problems for Models of Arithmetic

Published online by Cambridge University Press:  15 January 2014

Samuel Coskey
Affiliation:
Mathematics Program, The Cuny Graduate Center, 365 Fifth Avenue, New York, NY 10016-4309, USA, E-mail: scoskey@nylogic.org, E-mail: rkossak@nylogic.org
Roman Kossak
Affiliation:
Mathematics Program, The Cuny Graduate Center, 365 Fifth Avenue, New York, NY 10016-4309, USA, E-mail: scoskey@nylogic.org, E-mail: rkossak@nylogic.org

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable